./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sep.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/sep.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 e150e83dea41703782a488455769a24bf6c8f600 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:56,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:24:56,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:24:56,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:24:56,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:24:56,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:24:56,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:24:56,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:24:56,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:24:56,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:24:56,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:24:56,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:24:56,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:24:56,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:24:56,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:24:56,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:24:56,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:24:56,668 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:24:56,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:24:56,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:24:56,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:24:56,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:24:56,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:24:56,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:24:56,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:24:56,685 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:24:56,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:24:56,686 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:24:56,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:24:56,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:24:56,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:24:56,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:24:56,692 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:24:56,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:24:56,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:24:56,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:24:56,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:24:56,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:24:56,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:24:56,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:24:56,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:24:56,703 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:56,742 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:24:56,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:24:56,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:24:56,744 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:24:56,744 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:24:56,745 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:24:56,745 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:24:56,745 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:24:56,747 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:24:56,747 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:24:56,748 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:24:56,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:24:56,748 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:24:56,749 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:24:56,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:24:56,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:24:56,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:24:56,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:24:56,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:24:56,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:24:56,753 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:24:56,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:24:56,754 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:24:56,754 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:24:56,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:24:56,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:24:56,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:24:56,755 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:24:56,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:24:56,756 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:24:56,756 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:24:56,757 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:24:56,759 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:24:56,760 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 -> e150e83dea41703782a488455769a24bf6c8f600 [2020-07-29 03:24:57,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:24:57,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:24:57,087 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:24:57,089 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:24:57,089 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:24:57,090 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep.i [2020-07-29 03:24:57,161 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c45f9128/1994a572705b456383eacaa1a94c7a2b/FLAGada239a8f [2020-07-29 03:24:57,576 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:24:57,577 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep.i [2020-07-29 03:24:57,583 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c45f9128/1994a572705b456383eacaa1a94c7a2b/FLAGada239a8f [2020-07-29 03:24:57,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c45f9128/1994a572705b456383eacaa1a94c7a2b [2020-07-29 03:24:57,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:24:57,962 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:24:57,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:24:57,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:24:57,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:24:57,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:24:57" (1/1) ... [2020-07-29 03:24:57,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28887cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:57, skipping insertion in model container [2020-07-29 03:24:57,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:24:57" (1/1) ... [2020-07-29 03:24:57,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:24:58,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:24:58,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:24:58,188 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:24:58,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:24:58,230 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:24:58,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:58 WrapperNode [2020-07-29 03:24:58,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:24:58,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:24:58,232 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:24:58,232 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:24:58,241 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:58" (1/1) ... [2020-07-29 03:24:58,316 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:58" (1/1) ... [2020-07-29 03:24:58,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:24:58,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:24:58,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:24:58,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:24:58,364 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:58" (1/1) ... [2020-07-29 03:24:58,364 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:58" (1/1) ... [2020-07-29 03:24:58,367 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:58" (1/1) ... [2020-07-29 03:24:58,367 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:58" (1/1) ... [2020-07-29 03:24:58,377 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:58" (1/1) ... [2020-07-29 03:24:58,383 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:58" (1/1) ... [2020-07-29 03:24:58,385 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:58" (1/1) ... [2020-07-29 03:24:58,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:24:58,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:24:58,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:24:58,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:24:58,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:58" (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:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:24:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:24:58,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:24:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:24:58,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:24:58,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:24:58,928 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:24:58,929 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-29 03:24:58,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:24:58 BoogieIcfgContainer [2020-07-29 03:24:58,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:24:58,933 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:24:58,933 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:24:58,937 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:24:58,938 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:24:58,938 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:24:57" (1/3) ... [2020-07-29 03:24:58,939 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40d984b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:24:58, skipping insertion in model container [2020-07-29 03:24:58,939 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:24:58,940 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:58" (2/3) ... [2020-07-29 03:24:58,940 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40d984b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:24:58, skipping insertion in model container [2020-07-29 03:24:58,940 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:24:58,940 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:24:58" (3/3) ... [2020-07-29 03:24:58,942 INFO L371 chiAutomizerObserver]: Analyzing ICFG sep.i [2020-07-29 03:24:58,991 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:24:58,991 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:24:58,991 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:24:58,992 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:24:58,992 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:24:58,992 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:24:58,992 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:24:58,992 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:24:59,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2020-07-29 03:24:59,045 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-07-29 03:24:59,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:59,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:59,052 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 03:24:59,053 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:24:59,053 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:24:59,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2020-07-29 03:24:59,068 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-07-29 03:24:59,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:59,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:59,070 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 03:24:59,070 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:24:59,078 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 10#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; 14#L23true 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;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 6#L9-3true [2020-07-29 03:24:59,079 INFO L796 eck$LassoCheckResult]: Loop: 6#L9-3true assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 28#L11true assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 7#L9-2true sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 6#L9-3true [2020-07-29 03:24:59,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:59,086 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2020-07-29 03:24:59,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:59,098 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043839311] [2020-07-29 03:24:59,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:59,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:59,206 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:59,236 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:59,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:59,237 INFO L82 PathProgramCache]: Analyzing trace with hash 42800, now seen corresponding path program 1 times [2020-07-29 03:24:59,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:59,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568487927] [2020-07-29 03:24:59,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:59,282 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:59,303 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:59,310 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:59,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:59,314 INFO L82 PathProgramCache]: Analyzing trace with hash 889512687, now seen corresponding path program 1 times [2020-07-29 03:24:59,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:59,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401942826] [2020-07-29 03:24:59,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:59,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:59,371 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:59,376 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:59,637 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-07-29 03:24:59,712 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:24:59,713 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:24:59,714 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:24:59,714 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:24:59,714 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:24:59,715 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:59,715 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:24:59,715 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:24:59,715 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration1_Lasso [2020-07-29 03:24:59,716 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:24:59,716 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:24:59,761 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:59,772 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:59,778 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:59,784 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:59,788 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:59,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:59,803 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:59,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:59,814 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:59,819 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:59,825 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:59,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:59,839 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:59,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:59,851 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:59,858 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:59,863 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:59,869 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:59,874 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:59,880 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:59,884 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:25:00,051 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:25:00,056 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:25:00,061 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:25:00,782 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:00,787 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:25:00,804 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:25:00,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:00,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:00,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:00,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:00,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:00,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:00,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:00,817 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:25:00,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:00,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:00,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:00,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:00,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:00,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:00,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:00,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:00,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:00,872 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:00,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:00,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:00,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:00,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:00,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:00,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:00,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:00,880 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:25:00,904 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:25:00,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:00,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:00,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:00,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:00,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:00,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:00,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:00,909 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:25:00,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:00,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:00,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:00,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:00,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:00,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:00,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:00,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:00,939 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:25:00,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:00,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:00,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:00,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:00,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:00,969 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:00,969 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:00,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:01,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:01,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:01,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:01,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:01,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:01,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:01,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:01,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:01,029 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:25:01,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:01,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:01,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:01,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:01,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:01,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:01,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:01,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:01,058 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:25:01,082 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:25:01,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:01,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:01,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:01,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:01,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:01,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:01,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:01,087 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:25:01,110 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:25:01,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:01,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:01,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:01,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:01,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:01,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:01,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:01,119 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:25:01,143 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:25:01,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:01,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:01,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:01,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:01,153 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:01,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:01,162 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:25:01,188 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:25:01,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:01,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:01,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:01,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:01,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:01,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:01,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:01,193 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:25:01,216 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:25:01,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:01,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:01,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:01,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:01,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:01,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:01,223 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:25:01,248 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:25:01,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:01,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:01,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:01,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:01,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:01,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:01,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:01,253 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:25:01,279 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:25:01,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:01,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:01,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:01,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:01,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:01,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:01,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:01,285 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:25:01,306 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:25:01,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:01,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:01,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:01,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:01,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:01,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:01,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:01,317 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:25:01,346 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:25:01,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:01,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:01,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:01,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:01,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:01,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:01,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:01,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:01,383 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:25:01,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:01,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:01,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:01,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:01,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:01,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:01,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:01,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:01,410 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:25:01,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:01,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:01,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:01,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:01,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:01,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:01,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:01,414 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:01,443 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:25:01,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:01,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:01,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:01,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:01,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:01,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:01,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:01,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:01,474 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:01,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:01,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:01,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:01,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:01,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:01,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:01,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:01,479 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:01,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:01,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:01,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:01,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:01,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:01,506 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:01,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:01,509 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:01,533 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:25:01,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:01,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:01,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:01,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:01,543 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:01,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:01,556 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:01,615 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 03:25:01,615 INFO L444 ModelExtractionUtils]: 11 out of 25 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:01,623 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:01,633 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:01,633 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:01,635 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_sep_~i~0) = 1*~N~0 - 1*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2020-07-29 03:25:01,729 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 03:25:01,735 INFO L393 LassoCheck]: Loop: "assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4);" "assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2;" "sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0;" [2020-07-29 03:25:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:01,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:01,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:01,825 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {37#unseeded} is VALID [2020-07-29 03:25:01,825 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#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; {37#unseeded} is VALID [2020-07-29 03:25:01,826 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#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;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; {37#unseeded} is VALID [2020-07-29 03:25:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:01,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:25:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:01,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:01,869 INFO L280 TraceCheckUtils]: 0: Hoare triple {40#(>= oldRank0 (+ ~N~0 (* (- 1) ULTIMATE.start_sep_~i~0)))} assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); {76#(and (< ULTIMATE.start_sep_~i~0 ~N~0) (<= ~N~0 (+ oldRank0 ULTIMATE.start_sep_~i~0)))} is VALID [2020-07-29 03:25:01,871 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#(and (< ULTIMATE.start_sep_~i~0 ~N~0) (<= ~N~0 (+ oldRank0 ULTIMATE.start_sep_~i~0)))} assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; {76#(and (< ULTIMATE.start_sep_~i~0 ~N~0) (<= ~N~0 (+ oldRank0 ULTIMATE.start_sep_~i~0)))} is VALID [2020-07-29 03:25:01,872 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#(and (< ULTIMATE.start_sep_~i~0 ~N~0) (<= ~N~0 (+ oldRank0 ULTIMATE.start_sep_~i~0)))} sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; {65#(or unseeded (and (> oldRank0 (+ ~N~0 (* (- 1) ULTIMATE.start_sep_~i~0))) (>= oldRank0 0)))} is VALID [2020-07-29 03:25:01,873 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:25:01,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:01,900 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:25:01,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:25:01,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:01,912 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:25:01,913 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 3 states. [2020-07-29 03:25:02,025 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 3 states. Result 57 states and 81 transitions. Complement of second has 8 states. [2020-07-29 03:25:02,026 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:25:02,026 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:02,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2020-07-29 03:25:02,036 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-07-29 03:25:02,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:02,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:02,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:02,052 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:02,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:02,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:02,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 81 transitions. [2020-07-29 03:25:02,057 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-07-29 03:25:02,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:02,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:02,062 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states. [2020-07-29 03:25:02,069 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-07-29 03:25:02,075 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 11 examples of accepted words. [2020-07-29 03:25:02,075 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:02,081 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:02,082 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:02,082 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 57 states and 81 transitions. cyclomatic complexity: 31 [2020-07-29 03:25:02,084 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 03:25:02,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:25:02,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:25:02,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:25:02,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:02,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:02,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:02,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:02,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:02,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:02,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 57 letters. Loop has 57 letters. [2020-07-29 03:25:02,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 57 letters. [2020-07-29 03:25:02,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 57 letters. Loop has 57 letters. [2020-07-29 03:25:02,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:25:02,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:25:02,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:25:02,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:02,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:02,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:02,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:02,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:02,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:02,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:02,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:02,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:02,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:02,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:02,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:02,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:02,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:02,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:02,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:02,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:02,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:02,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:02,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:02,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:02,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:25:02,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:25:02,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:25:02,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:02,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:02,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:02,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:25:02,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:25:02,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:25:02,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 03:25:02,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 03:25:02,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 5 letters. Loop has 3 letters. [2020-07-29 03:25:02,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 03:25:02,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 03:25:02,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 4 letters. Loop has 3 letters. [2020-07-29 03:25:02,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:02,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:02,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:02,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:02,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:02,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:02,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:02,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:02,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:02,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:02,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:02,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:02,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:02,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:02,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:02,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:02,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:02,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:02,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:02,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:02,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:02,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:02,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:02,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:02,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:25:02,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:25:02,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:25:02,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:02,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:02,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 81 transitions. cyclomatic complexity: 31 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:02,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,113 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:02,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-29 03:25:02,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:25:02,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:02,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 6 letters. [2020-07-29 03:25:02,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:02,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 81 transitions. cyclomatic complexity: 31 [2020-07-29 03:25:02,123 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-07-29 03:25:02,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 20 states and 29 transitions. [2020-07-29 03:25:02,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 03:25:02,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:25:02,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2020-07-29 03:25:02,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:02,133 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-07-29 03:25:02,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2020-07-29 03:25:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-29 03:25:02,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:02,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 29 transitions. Second operand 20 states. [2020-07-29 03:25:02,162 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 29 transitions. Second operand 20 states. [2020-07-29 03:25:02,164 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 20 states. [2020-07-29 03:25:02,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:02,169 INFO L93 Difference]: Finished difference Result 20 states and 29 transitions. [2020-07-29 03:25:02,169 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2020-07-29 03:25:02,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:02,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:02,170 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states and 29 transitions. [2020-07-29 03:25:02,171 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states and 29 transitions. [2020-07-29 03:25:02,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:02,172 INFO L93 Difference]: Finished difference Result 20 states and 29 transitions. [2020-07-29 03:25:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2020-07-29 03:25:02,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:02,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:02,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:02,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 03:25:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2020-07-29 03:25:02,176 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-07-29 03:25:02,176 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-07-29 03:25:02,176 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:25:02,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2020-07-29 03:25:02,177 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-07-29 03:25:02,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:02,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:02,177 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:25:02,177 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:25:02,178 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 165#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; 166#L23 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;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 156#L9-3 assume !(sep_~i~0 < ~N~0); 153#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 154#L16 main_#t~ret5 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 155#L9-8 [2020-07-29 03:25:02,178 INFO L796 eck$LassoCheckResult]: Loop: 155#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 163#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 164#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 155#L9-8 [2020-07-29 03:25:02,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:02,178 INFO L82 PathProgramCache]: Analyzing trace with hash 889511019, now seen corresponding path program 1 times [2020-07-29 03:25:02,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:02,179 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947431545] [2020-07-29 03:25:02,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:02,246 INFO L280 TraceCheckUtils]: 0: Hoare triple {214#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {214#true} is VALID [2020-07-29 03:25:02,246 INFO L280 TraceCheckUtils]: 1: Hoare triple {214#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; {214#true} is VALID [2020-07-29 03:25:02,248 INFO L280 TraceCheckUtils]: 2: Hoare triple {214#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;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; {216#(and (= 0 ULTIMATE.start_sep_~i~0) (<= 2 ~N~0))} is VALID [2020-07-29 03:25:02,248 INFO L280 TraceCheckUtils]: 3: Hoare triple {216#(and (= 0 ULTIMATE.start_sep_~i~0) (<= 2 ~N~0))} assume !(sep_~i~0 < ~N~0); {215#false} is VALID [2020-07-29 03:25:02,249 INFO L280 TraceCheckUtils]: 4: Hoare triple {215#false} sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); {215#false} is VALID [2020-07-29 03:25:02,249 INFO L280 TraceCheckUtils]: 5: Hoare triple {215#false} main_#t~ret5 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; {215#false} is VALID [2020-07-29 03:25:02,250 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:25:02,250 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947431545] [2020-07-29 03:25:02,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:02,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:25:02,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971702653] [2020-07-29 03:25:02,254 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:02,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:02,255 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 1 times [2020-07-29 03:25:02,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:02,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560055679] [2020-07-29 03:25:02,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:02,266 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:02,274 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:02,276 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:02,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:02,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:25:02,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:25:02,363 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-07-29 03:25:02,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:02,436 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2020-07-29 03:25:02,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:25:02,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:02,445 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:25:02,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2020-07-29 03:25:02,447 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-07-29 03:25:02,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 29 transitions. [2020-07-29 03:25:02,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 03:25:02,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:25:02,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2020-07-29 03:25:02,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:02,450 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-07-29 03:25:02,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2020-07-29 03:25:02,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-07-29 03:25:02,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:02,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 29 transitions. Second operand 20 states. [2020-07-29 03:25:02,452 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 29 transitions. Second operand 20 states. [2020-07-29 03:25:02,452 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand 20 states. [2020-07-29 03:25:02,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:02,454 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2020-07-29 03:25:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2020-07-29 03:25:02,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:02,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:02,455 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 22 states and 29 transitions. [2020-07-29 03:25:02,455 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 22 states and 29 transitions. [2020-07-29 03:25:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:02,457 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2020-07-29 03:25:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2020-07-29 03:25:02,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:02,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:02,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:02,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:02,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 03:25:02,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-07-29 03:25:02,460 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-07-29 03:25:02,460 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-07-29 03:25:02,460 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:25:02,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-07-29 03:25:02,461 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-07-29 03:25:02,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:02,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:02,461 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:02,461 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:25:02,462 INFO L794 eck$LassoCheckResult]: Stem: 260#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 256#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; 257#L23 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;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 246#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 247#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 251#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 248#L9-3 assume !(sep_~i~0 < ~N~0); 243#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 244#L16 main_#t~ret5 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 245#L9-8 [2020-07-29 03:25:02,462 INFO L796 eck$LassoCheckResult]: Loop: 245#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 253#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 254#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 245#L9-8 [2020-07-29 03:25:02,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:02,463 INFO L82 PathProgramCache]: Analyzing trace with hash -473899520, now seen corresponding path program 1 times [2020-07-29 03:25:02,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:02,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945074783] [2020-07-29 03:25:02,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:02,528 INFO L280 TraceCheckUtils]: 0: Hoare triple {308#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {308#true} is VALID [2020-07-29 03:25:02,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {308#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; {308#true} is VALID [2020-07-29 03:25:02,530 INFO L280 TraceCheckUtils]: 2: Hoare triple {308#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;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; {310#(and (= 0 ULTIMATE.start_sep_~i~0) (<= 2 ~N~0))} is VALID [2020-07-29 03:25:02,531 INFO L280 TraceCheckUtils]: 3: Hoare triple {310#(and (= 0 ULTIMATE.start_sep_~i~0) (<= 2 ~N~0))} assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); {310#(and (= 0 ULTIMATE.start_sep_~i~0) (<= 2 ~N~0))} is VALID [2020-07-29 03:25:02,532 INFO L280 TraceCheckUtils]: 4: Hoare triple {310#(and (= 0 ULTIMATE.start_sep_~i~0) (<= 2 ~N~0))} assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; {310#(and (= 0 ULTIMATE.start_sep_~i~0) (<= 2 ~N~0))} is VALID [2020-07-29 03:25:02,533 INFO L280 TraceCheckUtils]: 5: Hoare triple {310#(and (= 0 ULTIMATE.start_sep_~i~0) (<= 2 ~N~0))} sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; {311#(<= (+ ULTIMATE.start_sep_~i~0 1) ~N~0)} is VALID [2020-07-29 03:25:02,534 INFO L280 TraceCheckUtils]: 6: Hoare triple {311#(<= (+ ULTIMATE.start_sep_~i~0 1) ~N~0)} assume !(sep_~i~0 < ~N~0); {309#false} is VALID [2020-07-29 03:25:02,534 INFO L280 TraceCheckUtils]: 7: Hoare triple {309#false} sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); {309#false} is VALID [2020-07-29 03:25:02,534 INFO L280 TraceCheckUtils]: 8: Hoare triple {309#false} main_#t~ret5 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; {309#false} is VALID [2020-07-29 03:25:02,535 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:25:02,535 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945074783] [2020-07-29 03:25:02,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020237739] [2020-07-29 03:25:02,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:02,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:25:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:02,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:02,695 INFO L280 TraceCheckUtils]: 0: Hoare triple {308#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {308#true} is VALID [2020-07-29 03:25:02,695 INFO L280 TraceCheckUtils]: 1: Hoare triple {308#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; {308#true} is VALID [2020-07-29 03:25:02,697 INFO L280 TraceCheckUtils]: 2: Hoare triple {308#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;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; {321#(and (<= ULTIMATE.start_sep_~i~0 0) (< 1 ~N~0))} is VALID [2020-07-29 03:25:02,698 INFO L280 TraceCheckUtils]: 3: Hoare triple {321#(and (<= ULTIMATE.start_sep_~i~0 0) (< 1 ~N~0))} assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); {321#(and (<= ULTIMATE.start_sep_~i~0 0) (< 1 ~N~0))} is VALID [2020-07-29 03:25:02,699 INFO L280 TraceCheckUtils]: 4: Hoare triple {321#(and (<= ULTIMATE.start_sep_~i~0 0) (< 1 ~N~0))} assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; {321#(and (<= ULTIMATE.start_sep_~i~0 0) (< 1 ~N~0))} is VALID [2020-07-29 03:25:02,700 INFO L280 TraceCheckUtils]: 5: Hoare triple {321#(and (<= ULTIMATE.start_sep_~i~0 0) (< 1 ~N~0))} sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; {331#(and (< 1 ~N~0) (<= ULTIMATE.start_sep_~i~0 1))} is VALID [2020-07-29 03:25:02,701 INFO L280 TraceCheckUtils]: 6: Hoare triple {331#(and (< 1 ~N~0) (<= ULTIMATE.start_sep_~i~0 1))} assume !(sep_~i~0 < ~N~0); {309#false} is VALID [2020-07-29 03:25:02,701 INFO L280 TraceCheckUtils]: 7: Hoare triple {309#false} sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); {309#false} is VALID [2020-07-29 03:25:02,701 INFO L280 TraceCheckUtils]: 8: Hoare triple {309#false} main_#t~ret5 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; {309#false} is VALID [2020-07-29 03:25:02,702 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:25:02,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:02,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-07-29 03:25:02,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187481344] [2020-07-29 03:25:02,703 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:02,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:02,704 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 2 times [2020-07-29 03:25:02,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:02,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374591522] [2020-07-29 03:25:02,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:02,720 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:02,739 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:02,745 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:02,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:02,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 03:25:02,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-29 03:25:02,839 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 10 Second operand 6 states. [2020-07-29 03:25:03,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:03,020 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2020-07-29 03:25:03,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:25:03,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:25:03,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:03,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2020-07-29 03:25:03,041 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-07-29 03:25:03,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 33 transitions. [2020-07-29 03:25:03,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 03:25:03,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:25:03,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2020-07-29 03:25:03,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:03,048 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-07-29 03:25:03,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2020-07-29 03:25:03,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-07-29 03:25:03,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:03,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 33 transitions. Second operand 23 states. [2020-07-29 03:25:03,050 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 33 transitions. Second operand 23 states. [2020-07-29 03:25:03,052 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 23 states. [2020-07-29 03:25:03,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:03,056 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2020-07-29 03:25:03,056 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2020-07-29 03:25:03,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:03,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:03,057 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 25 states and 33 transitions. [2020-07-29 03:25:03,057 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 25 states and 33 transitions. [2020-07-29 03:25:03,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:03,062 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2020-07-29 03:25:03,062 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2020-07-29 03:25:03,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:03,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:03,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:03,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 03:25:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2020-07-29 03:25:03,064 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-07-29 03:25:03,065 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-07-29 03:25:03,065 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:25:03,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2020-07-29 03:25:03,066 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-07-29 03:25:03,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:03,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:03,067 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:03,067 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:25:03,069 INFO L794 eck$LassoCheckResult]: Stem: 383#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 380#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; 381#L23 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;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 370#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 371#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 376#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 372#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 373#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 386#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 387#L9-3 assume !(sep_~i~0 < ~N~0); 367#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 368#L16 main_#t~ret5 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 369#L9-8 [2020-07-29 03:25:03,069 INFO L796 eck$LassoCheckResult]: Loop: 369#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 378#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 379#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 369#L9-8 [2020-07-29 03:25:03,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:03,069 INFO L82 PathProgramCache]: Analyzing trace with hash -331548597, now seen corresponding path program 2 times [2020-07-29 03:25:03,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:03,070 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367403072] [2020-07-29 03:25:03,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:03,131 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:03,168 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:03,180 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:03,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:03,185 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 3 times [2020-07-29 03:25:03,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:03,185 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749531030] [2020-07-29 03:25:03,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:03,197 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:03,211 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:03,213 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:03,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:03,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1260561435, now seen corresponding path program 1 times [2020-07-29 03:25:03,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:03,217 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950979247] [2020-07-29 03:25:03,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:03,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {445#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {445#true} is VALID [2020-07-29 03:25:03,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {445#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; {445#true} is VALID [2020-07-29 03:25:03,709 INFO L280 TraceCheckUtils]: 2: Hoare triple {445#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;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; {447#(and (= 0 ULTIMATE.start_sep_~i~0) (= ULTIMATE.start_sep_~x.base |ULTIMATE.start_main_~#x~0.base|) (= 0 ULTIMATE.start_sep_~x.offset) (= 0 |ULTIMATE.start_main_~#x~0.offset|))} is VALID [2020-07-29 03:25:03,713 INFO L280 TraceCheckUtils]: 3: Hoare triple {447#(and (= 0 ULTIMATE.start_sep_~i~0) (= ULTIMATE.start_sep_~x.base |ULTIMATE.start_main_~#x~0.base|) (= 0 ULTIMATE.start_sep_~x.offset) (= 0 |ULTIMATE.start_main_~#x~0.offset|))} assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); {447#(and (= 0 ULTIMATE.start_sep_~i~0) (= ULTIMATE.start_sep_~x.base |ULTIMATE.start_main_~#x~0.base|) (= 0 ULTIMATE.start_sep_~x.offset) (= 0 |ULTIMATE.start_main_~#x~0.offset|))} is VALID [2020-07-29 03:25:03,715 INFO L280 TraceCheckUtils]: 4: Hoare triple {447#(and (= 0 ULTIMATE.start_sep_~i~0) (= ULTIMATE.start_sep_~x.base |ULTIMATE.start_main_~#x~0.base|) (= 0 ULTIMATE.start_sep_~x.offset) (= 0 |ULTIMATE.start_main_~#x~0.offset|))} assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; {447#(and (= 0 ULTIMATE.start_sep_~i~0) (= ULTIMATE.start_sep_~x.base |ULTIMATE.start_main_~#x~0.base|) (= 0 ULTIMATE.start_sep_~x.offset) (= 0 |ULTIMATE.start_main_~#x~0.offset|))} is VALID [2020-07-29 03:25:03,716 INFO L280 TraceCheckUtils]: 5: Hoare triple {447#(and (= 0 ULTIMATE.start_sep_~i~0) (= ULTIMATE.start_sep_~x.base |ULTIMATE.start_main_~#x~0.base|) (= 0 ULTIMATE.start_sep_~x.offset) (= 0 |ULTIMATE.start_main_~#x~0.offset|))} sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; {448#(and (= ULTIMATE.start_sep_~x.base |ULTIMATE.start_main_~#x~0.base|) (= (+ |ULTIMATE.start_main_~#x~0.offset| 4) (+ ULTIMATE.start_sep_~x.offset (* 4 ULTIMATE.start_sep_~i~0))) (= 0 |ULTIMATE.start_main_~#x~0.offset|))} is VALID [2020-07-29 03:25:03,718 INFO L280 TraceCheckUtils]: 6: Hoare triple {448#(and (= ULTIMATE.start_sep_~x.base |ULTIMATE.start_main_~#x~0.base|) (= (+ |ULTIMATE.start_main_~#x~0.offset| 4) (+ ULTIMATE.start_sep_~x.offset (* 4 ULTIMATE.start_sep_~i~0))) (= 0 |ULTIMATE.start_main_~#x~0.offset|))} assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); {449#(and (= |ULTIMATE.start_sep_#t~mem1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4))) (= 0 |ULTIMATE.start_main_~#x~0.offset|))} is VALID [2020-07-29 03:25:03,721 INFO L280 TraceCheckUtils]: 7: Hoare triple {449#(and (= |ULTIMATE.start_sep_#t~mem1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4))) (= 0 |ULTIMATE.start_main_~#x~0.offset|))} assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; {450#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 1) (* 2 (div (+ (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 1) 2))) (= 0 |ULTIMATE.start_main_~#x~0.offset|))} is VALID [2020-07-29 03:25:03,721 INFO L280 TraceCheckUtils]: 8: Hoare triple {450#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 1) (* 2 (div (+ (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 1) 2))) (= 0 |ULTIMATE.start_main_~#x~0.offset|))} sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; {450#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 1) (* 2 (div (+ (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 1) 2))) (= 0 |ULTIMATE.start_main_~#x~0.offset|))} is VALID [2020-07-29 03:25:03,722 INFO L280 TraceCheckUtils]: 9: Hoare triple {450#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 1) (* 2 (div (+ (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 1) 2))) (= 0 |ULTIMATE.start_main_~#x~0.offset|))} assume !(sep_~i~0 < ~N~0); {450#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 1) (* 2 (div (+ (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 1) 2))) (= 0 |ULTIMATE.start_main_~#x~0.offset|))} is VALID [2020-07-29 03:25:03,723 INFO L280 TraceCheckUtils]: 10: Hoare triple {450#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 1) (* 2 (div (+ (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 1) 2))) (= 0 |ULTIMATE.start_main_~#x~0.offset|))} sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); {450#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 1) (* 2 (div (+ (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 1) 2))) (= 0 |ULTIMATE.start_main_~#x~0.offset|))} is VALID [2020-07-29 03:25:03,725 INFO L280 TraceCheckUtils]: 11: Hoare triple {450#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 1) (* 2 (div (+ (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 1) 2))) (= 0 |ULTIMATE.start_main_~#x~0.offset|))} main_#t~ret5 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; {451#(and (= 0 ULTIMATE.start_sep_~i~0) (= 0 ULTIMATE.start_sep_~x.offset) (<= (+ (select (select |#memory_int| ULTIMATE.start_sep_~x.base) (+ ULTIMATE.start_sep_~x.offset (* ULTIMATE.start_sep_~i~0 4))) 1) (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_sep_~x.base) (+ ULTIMATE.start_sep_~x.offset (* ULTIMATE.start_sep_~i~0 4))) 1) 2))))} is VALID [2020-07-29 03:25:03,729 INFO L280 TraceCheckUtils]: 12: Hoare triple {451#(and (= 0 ULTIMATE.start_sep_~i~0) (= 0 ULTIMATE.start_sep_~x.offset) (<= (+ (select (select |#memory_int| ULTIMATE.start_sep_~x.base) (+ ULTIMATE.start_sep_~x.offset (* ULTIMATE.start_sep_~i~0 4))) 1) (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_sep_~x.base) (+ ULTIMATE.start_sep_~x.offset (* ULTIMATE.start_sep_~i~0 4))) 1) 2))))} assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); {452#(<= (+ (* 2 (div |ULTIMATE.start_sep_#t~mem1| 2)) 1) |ULTIMATE.start_sep_#t~mem1|)} is VALID [2020-07-29 03:25:03,736 INFO L280 TraceCheckUtils]: 13: Hoare triple {452#(<= (+ (* 2 (div |ULTIMATE.start_sep_#t~mem1| 2)) 1) |ULTIMATE.start_sep_#t~mem1|)} assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; {446#false} is VALID [2020-07-29 03:25:03,737 INFO L280 TraceCheckUtils]: 14: Hoare triple {446#false} sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; {446#false} is VALID [2020-07-29 03:25:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:03,740 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950979247] [2020-07-29 03:25:03,740 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236152107] [2020-07-29 03:25:03,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:03,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-29 03:25:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:03,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:03,994 INFO L350 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2020-07-29 03:25:03,995 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2020-07-29 03:25:03,996 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:25:04,004 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:25:04,006 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:25:04,006 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:14 [2020-07-29 03:25:04,012 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:25:04,013 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_21|, ULTIMATE.start_main_~temp~0]. (let ((.cse1 (select |v_#memory_int_21| ULTIMATE.start_sep_~x.base)) (.cse2 (+ ULTIMATE.start_sep_~x.offset 4))) (let ((.cse0 (select .cse1 .cse2))) (and (= 0 ULTIMATE.start_sep_~i~0) (not (= 0 (mod .cse0 2))) (= (store |v_#memory_int_21| ULTIMATE.start_sep_~x.base (store (store .cse1 ULTIMATE.start_sep_~x.offset .cse0) .cse2 ULTIMATE.start_main_~temp~0)) |#memory_int|)))) [2020-07-29 03:25:04,013 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 ULTIMATE.start_sep_~i~0) (not (= 0 (mod (select (select |#memory_int| ULTIMATE.start_sep_~x.base) ULTIMATE.start_sep_~x.offset) 2)))) [2020-07-29 03:25:04,070 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2020-07-29 03:25:04,071 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:25:04,074 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:25:04,075 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:25:04,075 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:6 [2020-07-29 03:25:04,078 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:25:04,079 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_sep_~x.base, ULTIMATE.start_sep_~x.offset]. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_sep_~x.base) ULTIMATE.start_sep_~x.offset))) (and (not (= 0 (mod .cse0 2))) (= |ULTIMATE.start_sep_#t~mem1| .cse0))) [2020-07-29 03:25:04,079 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= (mod |ULTIMATE.start_sep_#t~mem1| 2) 0)) [2020-07-29 03:25:04,144 INFO L280 TraceCheckUtils]: 0: Hoare triple {445#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {445#true} is VALID [2020-07-29 03:25:04,145 INFO L280 TraceCheckUtils]: 1: Hoare triple {445#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; {445#true} is VALID [2020-07-29 03:25:04,146 INFO L280 TraceCheckUtils]: 2: Hoare triple {445#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;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; {462#(and (= 0 ULTIMATE.start_sep_~i~0) (= ULTIMATE.start_sep_~x.base |ULTIMATE.start_main_~#x~0.base|) (= |ULTIMATE.start_main_~#x~0.offset| ULTIMATE.start_sep_~x.offset))} is VALID [2020-07-29 03:25:04,147 INFO L280 TraceCheckUtils]: 3: Hoare triple {462#(and (= 0 ULTIMATE.start_sep_~i~0) (= ULTIMATE.start_sep_~x.base |ULTIMATE.start_main_~#x~0.base|) (= |ULTIMATE.start_main_~#x~0.offset| ULTIMATE.start_sep_~x.offset))} assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); {462#(and (= 0 ULTIMATE.start_sep_~i~0) (= ULTIMATE.start_sep_~x.base |ULTIMATE.start_main_~#x~0.base|) (= |ULTIMATE.start_main_~#x~0.offset| ULTIMATE.start_sep_~x.offset))} is VALID [2020-07-29 03:25:04,149 INFO L280 TraceCheckUtils]: 4: Hoare triple {462#(and (= 0 ULTIMATE.start_sep_~i~0) (= ULTIMATE.start_sep_~x.base |ULTIMATE.start_main_~#x~0.base|) (= |ULTIMATE.start_main_~#x~0.offset| ULTIMATE.start_sep_~x.offset))} assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; {462#(and (= 0 ULTIMATE.start_sep_~i~0) (= ULTIMATE.start_sep_~x.base |ULTIMATE.start_main_~#x~0.base|) (= |ULTIMATE.start_main_~#x~0.offset| ULTIMATE.start_sep_~x.offset))} is VALID [2020-07-29 03:25:04,150 INFO L280 TraceCheckUtils]: 5: Hoare triple {462#(and (= 0 ULTIMATE.start_sep_~i~0) (= ULTIMATE.start_sep_~x.base |ULTIMATE.start_main_~#x~0.base|) (= |ULTIMATE.start_main_~#x~0.offset| ULTIMATE.start_sep_~x.offset))} sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; {472#(and (= 1 ULTIMATE.start_sep_~i~0) (= ULTIMATE.start_sep_~x.base |ULTIMATE.start_main_~#x~0.base|) (= |ULTIMATE.start_main_~#x~0.offset| ULTIMATE.start_sep_~x.offset))} is VALID [2020-07-29 03:25:04,151 INFO L280 TraceCheckUtils]: 6: Hoare triple {472#(and (= 1 ULTIMATE.start_sep_~i~0) (= ULTIMATE.start_sep_~x.base |ULTIMATE.start_main_~#x~0.base|) (= |ULTIMATE.start_main_~#x~0.offset| ULTIMATE.start_sep_~x.offset))} assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); {476#(= |ULTIMATE.start_sep_#t~mem1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)))} is VALID [2020-07-29 03:25:04,152 INFO L280 TraceCheckUtils]: 7: Hoare triple {476#(= |ULTIMATE.start_sep_#t~mem1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)))} assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; {480#(not (= 0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 2)))} is VALID [2020-07-29 03:25:04,153 INFO L280 TraceCheckUtils]: 8: Hoare triple {480#(not (= 0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 2)))} sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; {480#(not (= 0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 2)))} is VALID [2020-07-29 03:25:04,154 INFO L280 TraceCheckUtils]: 9: Hoare triple {480#(not (= 0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 2)))} assume !(sep_~i~0 < ~N~0); {480#(not (= 0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 2)))} is VALID [2020-07-29 03:25:04,154 INFO L280 TraceCheckUtils]: 10: Hoare triple {480#(not (= 0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 2)))} sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); {480#(not (= 0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 2)))} is VALID [2020-07-29 03:25:04,157 INFO L280 TraceCheckUtils]: 11: Hoare triple {480#(not (= 0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|) (+ |ULTIMATE.start_main_~#x~0.offset| 4)) 2)))} main_#t~ret5 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; {493#(and (not (= 0 (mod (select (select |#memory_int| ULTIMATE.start_sep_~x.base) ULTIMATE.start_sep_~x.offset) 2))) (= 0 ULTIMATE.start_sep_~i~0))} is VALID [2020-07-29 03:25:04,159 INFO L280 TraceCheckUtils]: 12: Hoare triple {493#(and (not (= 0 (mod (select (select |#memory_int| ULTIMATE.start_sep_~x.base) ULTIMATE.start_sep_~x.offset) 2))) (= 0 ULTIMATE.start_sep_~i~0))} assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); {452#(<= (+ (* 2 (div |ULTIMATE.start_sep_#t~mem1| 2)) 1) |ULTIMATE.start_sep_#t~mem1|)} is VALID [2020-07-29 03:25:04,160 INFO L280 TraceCheckUtils]: 13: Hoare triple {452#(<= (+ (* 2 (div |ULTIMATE.start_sep_#t~mem1| 2)) 1) |ULTIMATE.start_sep_#t~mem1|)} assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; {446#false} is VALID [2020-07-29 03:25:04,160 INFO L280 TraceCheckUtils]: 14: Hoare triple {446#false} sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; {446#false} is VALID [2020-07-29 03:25:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:04,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:04,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-07-29 03:25:04,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304378760] [2020-07-29 03:25:04,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:04,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 03:25:04,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-07-29 03:25:04,271 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 13 states. [2020-07-29 03:25:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:07,061 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2020-07-29 03:25:07,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-29 03:25:07,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 03:25:07,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:07,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 135 transitions. [2020-07-29 03:25:07,112 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 28 [2020-07-29 03:25:07,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 135 transitions. [2020-07-29 03:25:07,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2020-07-29 03:25:07,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2020-07-29 03:25:07,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 135 transitions. [2020-07-29 03:25:07,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:07,117 INFO L688 BuchiCegarLoop]: Abstraction has 101 states and 135 transitions. [2020-07-29 03:25:07,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 135 transitions. [2020-07-29 03:25:07,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 31. [2020-07-29 03:25:07,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:07,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states and 135 transitions. Second operand 31 states. [2020-07-29 03:25:07,123 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states and 135 transitions. Second operand 31 states. [2020-07-29 03:25:07,123 INFO L87 Difference]: Start difference. First operand 101 states and 135 transitions. Second operand 31 states. [2020-07-29 03:25:07,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:07,127 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2020-07-29 03:25:07,127 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 135 transitions. [2020-07-29 03:25:07,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:07,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:07,128 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 101 states and 135 transitions. [2020-07-29 03:25:07,128 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 101 states and 135 transitions. [2020-07-29 03:25:07,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:07,133 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2020-07-29 03:25:07,133 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 135 transitions. [2020-07-29 03:25:07,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:07,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:07,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:07,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 03:25:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-07-29 03:25:07,135 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-07-29 03:25:07,135 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-07-29 03:25:07,135 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:25:07,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2020-07-29 03:25:07,136 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-07-29 03:25:07,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:07,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:07,137 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:07,137 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:25:07,137 INFO L794 eck$LassoCheckResult]: Stem: 637#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 633#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; 634#L23 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;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 621#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 622#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 640#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 623#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 624#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 645#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 643#L9-3 assume !(sep_~i~0 < ~N~0); 642#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 619#L16 main_#t~ret5 := sep_#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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 620#L9-8 [2020-07-29 03:25:07,137 INFO L796 eck$LassoCheckResult]: Loop: 620#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 639#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 631#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 620#L9-8 [2020-07-29 03:25:07,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:07,137 INFO L82 PathProgramCache]: Analyzing trace with hash -333395639, now seen corresponding path program 1 times [2020-07-29 03:25:07,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:07,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515529994] [2020-07-29 03:25:07,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:07,156 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.(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.(TraceCheck.java:206) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(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.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(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.(LassoCheck.java:797) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(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:25:07,160 INFO L168 Benchmark]: Toolchain (without parser) took 9199.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.0 MB). Free memory was 961.6 MB in the beginning and 935.4 MB in the end (delta: 26.2 MB). Peak memory consumption was 339.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:07,161 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:25:07,161 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.31 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 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:25:07,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:07,162 INFO L168 Benchmark]: Boogie Preprocessor took 36.07 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:25:07,163 INFO L168 Benchmark]: RCFGBuilder took 544.63 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: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:07,164 INFO L168 Benchmark]: BuchiAutomizer took 8224.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 935.4 MB in the end (delta: 152.9 MB). Peak memory consumption was 327.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:07,167 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 268.31 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 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 119.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.07 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 544.63 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: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8224.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 935.4 MB in the end (delta: 152.9 MB). Peak memory consumption was 327.5 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.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...