./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 23:12:02,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 23:12:02,546 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 23:12:02,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 23:12:02,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 23:12:02,593 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 23:12:02,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 23:12:02,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 23:12:02,599 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 23:12:02,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 23:12:02,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 23:12:02,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 23:12:02,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 23:12:02,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 23:12:02,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 23:12:02,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 23:12:02,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 23:12:02,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 23:12:02,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 23:12:02,612 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 23:12:02,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 23:12:02,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 23:12:02,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 23:12:02,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 23:12:02,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 23:12:02,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 23:12:02,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 23:12:02,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 23:12:02,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 23:12:02,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 23:12:02,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 23:12:02,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 23:12:02,627 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 23:12:02,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 23:12:02,629 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 23:12:02,629 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 23:12:02,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 23:12:02,630 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 23:12:02,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 23:12:02,631 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 23:12:02,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 23:12:02,632 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-15 23:12:02,651 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 23:12:02,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 23:12:02,654 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 23:12:02,654 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 23:12:02,656 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 23:12:02,656 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 23:12:02,656 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 23:12:02,656 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-15 23:12:02,657 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-15 23:12:02,657 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-15 23:12:02,657 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-15 23:12:02,657 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-15 23:12:02,658 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-15 23:12:02,658 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 23:12:02,658 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 23:12:02,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 23:12:02,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 23:12:02,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-15 23:12:02,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-15 23:12:02,659 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-15 23:12:02,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 23:12:02,659 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-15 23:12:02,659 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 23:12:02,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-15 23:12:02,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 23:12:02,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 23:12:02,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 23:12:02,660 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 23:12:02,661 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-15 23:12:02,661 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 [2023-02-15 23:12:02,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 23:12:02,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 23:12:02,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 23:12:02,845 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 23:12:02,846 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 23:12:02,846 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2023-02-15 23:12:03,857 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 23:12:04,016 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 23:12:04,016 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2023-02-15 23:12:04,031 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a9c28cf7/3e201a06c5234490931a9b1c95ccb07a/FLAGfc113d8d7 [2023-02-15 23:12:04,051 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a9c28cf7/3e201a06c5234490931a9b1c95ccb07a [2023-02-15 23:12:04,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 23:12:04,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 23:12:04,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 23:12:04,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 23:12:04,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 23:12:04,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:12:04" (1/1) ... [2023-02-15 23:12:04,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d795a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:04, skipping insertion in model container [2023-02-15 23:12:04,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:12:04" (1/1) ... [2023-02-15 23:12:04,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 23:12:04,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 23:12:04,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 23:12:04,194 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 23:12:04,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 23:12:04,214 INFO L208 MainTranslator]: Completed translation [2023-02-15 23:12:04,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:04 WrapperNode [2023-02-15 23:12:04,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 23:12:04,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 23:12:04,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 23:12:04,216 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 23:12:04,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:04" (1/1) ... [2023-02-15 23:12:04,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:04" (1/1) ... [2023-02-15 23:12:04,241 INFO L138 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 61 [2023-02-15 23:12:04,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 23:12:04,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 23:12:04,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 23:12:04,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 23:12:04,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:04" (1/1) ... [2023-02-15 23:12:04,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:04" (1/1) ... [2023-02-15 23:12:04,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:04" (1/1) ... [2023-02-15 23:12:04,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:04" (1/1) ... [2023-02-15 23:12:04,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:04" (1/1) ... [2023-02-15 23:12:04,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:04" (1/1) ... [2023-02-15 23:12:04,261 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:04" (1/1) ... [2023-02-15 23:12:04,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:04" (1/1) ... [2023-02-15 23:12:04,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 23:12:04,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 23:12:04,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 23:12:04,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 23:12:04,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:04" (1/1) ... [2023-02-15 23:12:04,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:04,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:04,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:04,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-02-15 23:12:04,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 23:12:04,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 23:12:04,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 23:12:04,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 23:12:04,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 23:12:04,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 23:12:04,390 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 23:12:04,392 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 23:12:04,610 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 23:12:04,614 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 23:12:04,614 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 23:12:04,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:12:04 BoogieIcfgContainer [2023-02-15 23:12:04,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 23:12:04,616 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-15 23:12:04,616 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-15 23:12:04,633 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-15 23:12:04,634 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 23:12:04,634 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.02 11:12:04" (1/3) ... [2023-02-15 23:12:04,635 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52058730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 11:12:04, skipping insertion in model container [2023-02-15 23:12:04,635 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 23:12:04,635 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:04" (2/3) ... [2023-02-15 23:12:04,635 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52058730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 11:12:04, skipping insertion in model container [2023-02-15 23:12:04,635 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 23:12:04,635 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:12:04" (3/3) ... [2023-02-15 23:12:04,636 INFO L332 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2023-02-15 23:12:04,704 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-15 23:12:04,705 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-15 23:12:04,705 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-15 23:12:04,705 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-15 23:12:04,705 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-15 23:12:04,705 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-15 23:12:04,705 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-15 23:12:04,706 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-15 23:12:04,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:04,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 23:12:04,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:12:04,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:12:04,723 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 23:12:04,723 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 23:12:04,723 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-15 23:12:04,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:04,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 23:12:04,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:12:04,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:12:04,725 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 23:12:04,725 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 23:12:04,730 INFO L748 eck$LassoCheckResult]: Stem: 7#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 4#L24-2true [2023-02-15 23:12:04,730 INFO L750 eck$LassoCheckResult]: Loop: 4#L24-2true call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 8#L15-1true assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 2#L16true assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 4#L24-2true [2023-02-15 23:12:04,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:04,734 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-02-15 23:12:04,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:04,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518352493] [2023-02-15 23:12:04,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:04,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:04,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:04,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:04,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:04,936 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2023-02-15 23:12:04,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:04,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463692072] [2023-02-15 23:12:04,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:04,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:04,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:04,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:04,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:04,954 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2023-02-15 23:12:04,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:04,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263968625] [2023-02-15 23:12:04,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:04,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:05,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:05,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:06,313 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:12:06,314 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:12:06,314 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:12:06,314 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:12:06,315 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:12:06,315 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:06,315 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:12:06,315 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:12:06,315 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2023-02-15 23:12:06,315 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:12:06,316 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:12:06,332 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:06,339 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:06,341 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:06,344 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:06,346 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:06,348 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:06,350 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:06,943 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:06,946 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:07,298 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:12:07,303 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:12:07,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:07,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:07,307 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:07,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-02-15 23:12:07,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:07,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:07,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:12:07,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:07,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:07,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:07,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:12:07,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:12:07,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:07,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:07,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:07,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:07,354 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:07,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-02-15 23:12:07,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:07,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:07,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:12:07,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:07,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:07,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:07,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:12:07,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:12:07,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:07,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:07,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:07,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:07,403 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:07,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-02-15 23:12:07,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:07,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:07,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:07,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:07,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:07,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:07,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:07,432 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:07,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:07,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:07,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:07,437 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:07,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-02-15 23:12:07,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:07,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:07,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:12:07,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:07,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:07,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:07,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:12:07,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:12:07,464 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:07,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:07,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:07,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:07,472 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:07,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-02-15 23:12:07,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:07,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:07,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:07,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:07,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:07,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:07,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:07,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:07,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:07,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:07,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:07,529 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:07,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-02-15 23:12:07,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:07,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:07,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:12:07,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:07,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:07,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:07,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:12:07,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:12:07,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:07,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:07,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:07,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:07,564 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:07,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-02-15 23:12:07,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:07,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:07,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:07,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:07,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:07,577 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:07,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:07,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:07,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:07,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:07,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:07,613 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:07,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-02-15 23:12:07,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:07,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:07,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:07,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:07,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:07,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:07,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:07,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:07,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:07,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:07,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:07,653 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:07,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-02-15 23:12:07,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:07,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:07,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:07,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:07,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:07,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:07,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:07,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:07,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:07,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:07,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:07,728 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:07,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-02-15 23:12:07,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:07,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:07,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:07,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:07,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:07,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:07,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:07,773 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:07,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:07,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:07,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:07,780 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:07,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-02-15 23:12:07,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:07,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:07,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:07,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:07,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:07,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:07,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:07,814 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:07,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:07,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:07,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:07,820 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:07,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:07,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:07,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:07,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:07,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:07,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:07,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:07,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-02-15 23:12:07,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:07,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:07,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:07,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:07,861 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:07,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-02-15 23:12:07,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:07,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:07,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:07,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:07,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:07,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:07,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:07,912 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:07,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:07,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:07,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:07,933 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:07,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-02-15 23:12:07,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:07,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:07,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:07,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:07,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:07,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:07,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:07,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:07,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-02-15 23:12:07,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:07,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:07,990 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:08,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-02-15 23:12:08,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:08,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:08,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:08,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:08,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:08,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:08,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:08,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:08,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:08,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:08,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:08,065 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:08,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-02-15 23:12:08,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:08,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:08,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:08,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:08,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:08,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:08,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:08,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:08,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:08,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:08,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:08,117 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:08,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-02-15 23:12:08,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:08,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:08,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:08,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:08,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:08,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:08,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:08,161 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:12:08,188 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-15 23:12:08,188 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 23:12:08,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:08,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:08,209 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:08,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-02-15 23:12:08,211 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:12:08,228 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-02-15 23:12:08,228 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:12:08,229 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1 + 1 Supporting invariants [] [2023-02-15 23:12:08,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:08,342 INFO L156 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2023-02-15 23:12:08,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:08,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 23:12:08,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:12:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:08,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 23:12:08,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:12:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:08,485 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-15 23:12:08,486 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:08,517 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 36 transitions. Complement of second has 8 states. [2023-02-15 23:12:08,519 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 [2023-02-15 23:12:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:08,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2023-02-15 23:12:08,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2023-02-15 23:12:08,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:12:08,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2023-02-15 23:12:08,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:12:08,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2023-02-15 23:12:08,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:12:08,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2023-02-15 23:12:08,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 23:12:08,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 18 transitions. [2023-02-15 23:12:08,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2023-02-15 23:12:08,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2023-02-15 23:12:08,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2023-02-15 23:12:08,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:12:08,535 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2023-02-15 23:12:08,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2023-02-15 23:12:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-02-15 23:12:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2023-02-15 23:12:08,554 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2023-02-15 23:12:08,554 INFO L428 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2023-02-15 23:12:08,554 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-15 23:12:08,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2023-02-15 23:12:08,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 23:12:08,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:12:08,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:12:08,555 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-15 23:12:08,555 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 23:12:08,556 INFO L748 eck$LassoCheckResult]: Stem: 250#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 251#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 252#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 249#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 242#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 243#L20 [2023-02-15 23:12:08,556 INFO L750 eck$LassoCheckResult]: Loop: 243#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 246#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 247#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 254#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 243#L20 [2023-02-15 23:12:08,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:08,559 INFO L85 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2023-02-15 23:12:08,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:08,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832054288] [2023-02-15 23:12:08,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:08,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:09,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-02-15 23:12:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:09,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:12:09,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832054288] [2023-02-15 23:12:09,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832054288] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:12:09,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:12:09,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 23:12:09,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428220063] [2023-02-15 23:12:09,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:12:09,143 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:12:09,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:09,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2023-02-15 23:12:09,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:09,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038451423] [2023-02-15 23:12:09,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:09,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:09,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:09,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:09,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:12:09,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 23:12:09,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 23:12:09,250 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:09,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:12:09,279 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2023-02-15 23:12:09,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2023-02-15 23:12:09,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 23:12:09,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 19 transitions. [2023-02-15 23:12:09,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2023-02-15 23:12:09,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2023-02-15 23:12:09,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2023-02-15 23:12:09,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:12:09,282 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2023-02-15 23:12:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2023-02-15 23:12:09,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2023-02-15 23:12:09,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2023-02-15 23:12:09,284 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2023-02-15 23:12:09,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 23:12:09,285 INFO L428 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2023-02-15 23:12:09,285 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-15 23:12:09,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2023-02-15 23:12:09,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 23:12:09,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:12:09,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:12:09,287 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2023-02-15 23:12:09,287 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 23:12:09,287 INFO L748 eck$LassoCheckResult]: Stem: 289#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 290#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 286#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 287#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 284#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 285#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 288#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 282#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 283#L20 [2023-02-15 23:12:09,287 INFO L750 eck$LassoCheckResult]: Loop: 283#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 291#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 293#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 294#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 283#L20 [2023-02-15 23:12:09,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:09,288 INFO L85 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2023-02-15 23:12:09,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:09,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991082221] [2023-02-15 23:12:09,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:09,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:09,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:09,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:09,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:09,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 2 times [2023-02-15 23:12:09,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:09,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102344051] [2023-02-15 23:12:09,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:09,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:09,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:09,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:09,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:09,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1467212285, now seen corresponding path program 1 times [2023-02-15 23:12:09,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:09,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188825774] [2023-02-15 23:12:09,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:09,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:09,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:12:09,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188825774] [2023-02-15 23:12:09,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188825774] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:12:09,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457520378] [2023-02-15 23:12:09,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:09,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:12:09,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:09,508 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:12:09,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-15 23:12:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:09,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 23:12:09,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:12:09,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 23:12:09,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 23:12:09,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 23:12:09,658 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-15 23:12:09,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 23:12:09,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:12:09,672 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~x0~0#1.base|) |c_ULTIMATE.start_main_~x0~0#1.offset|) 0)) is different from false [2023-02-15 23:12:09,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:12:09,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 18 treesize of output 19 [2023-02-15 23:12:09,681 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 22 [2023-02-15 23:12:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 23:12:09,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457520378] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:12:09,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:12:09,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2023-02-15 23:12:09,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073287057] [2023-02-15 23:12:09,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:12:09,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:12:09,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 23:12:09,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=36, Unknown=1, NotChecked=12, Total=72 [2023-02-15 23:12:09,805 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:09,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:12:09,839 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2023-02-15 23:12:09,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2023-02-15 23:12:09,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 23:12:09,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 22 transitions. [2023-02-15 23:12:09,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-02-15 23:12:09,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-02-15 23:12:09,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2023-02-15 23:12:09,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:12:09,841 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-02-15 23:12:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2023-02-15 23:12:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2023-02-15 23:12:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-02-15 23:12:09,842 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-02-15 23:12:09,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 23:12:09,843 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-02-15 23:12:09,843 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-15 23:12:09,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2023-02-15 23:12:09,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 23:12:09,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:12:09,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:12:09,844 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2023-02-15 23:12:09,844 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-02-15 23:12:09,844 INFO L748 eck$LassoCheckResult]: Stem: 403#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 404#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 400#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 401#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 398#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 399#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 402#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 409#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 406#L20 [2023-02-15 23:12:09,844 INFO L750 eck$LassoCheckResult]: Loop: 406#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 408#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 397#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 410#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 411#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 406#L20 [2023-02-15 23:12:09,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:09,845 INFO L85 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 2 times [2023-02-15 23:12:09,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:09,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909359446] [2023-02-15 23:12:09,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:09,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:09,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:09,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:09,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:09,873 INFO L85 PathProgramCache]: Analyzing trace with hash 49698504, now seen corresponding path program 1 times [2023-02-15 23:12:09,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:09,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40184798] [2023-02-15 23:12:09,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:09,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:09,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:09,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:09,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:09,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1758681084, now seen corresponding path program 1 times [2023-02-15 23:12:09,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:09,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044308646] [2023-02-15 23:12:09,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:09,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:10,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:12:10,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044308646] [2023-02-15 23:12:10,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044308646] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:12:10,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110476977] [2023-02-15 23:12:10,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:10,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:12:10,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:10,103 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:12:10,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-15 23:12:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:10,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 23:12:10,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:12:10,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-02-15 23:12:10,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 23:12:10,279 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 23:12:10,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2023-02-15 23:12:10,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 23:12:10,323 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-15 23:12:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 23:12:10,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:12:10,336 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_523 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_523) |c_ULTIMATE.start_main_~x0~0#1.base|) |c_ULTIMATE.start_main_~x0~0#1.offset|) 0)) is different from false [2023-02-15 23:12:10,371 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2023-02-15 23:12:10,372 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 50 [2023-02-15 23:12:10,392 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-02-15 23:12:10,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 55 [2023-02-15 23:12:10,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-02-15 23:12:10,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-02-15 23:12:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 23:12:10,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110476977] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:12:10,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:12:10,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-02-15 23:12:10,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14388829] [2023-02-15 23:12:10,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:12:10,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:12:10,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 23:12:10,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=138, Unknown=1, NotChecked=24, Total=210 [2023-02-15 23:12:10,572 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:10,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:12:10,673 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2023-02-15 23:12:10,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2023-02-15 23:12:10,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2023-02-15 23:12:10,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 25 transitions. [2023-02-15 23:12:10,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-02-15 23:12:10,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2023-02-15 23:12:10,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2023-02-15 23:12:10,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:12:10,674 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-02-15 23:12:10,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2023-02-15 23:12:10,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2023-02-15 23:12:10,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:10,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-02-15 23:12:10,675 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-02-15 23:12:10,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 23:12:10,678 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-02-15 23:12:10,678 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-15 23:12:10,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2023-02-15 23:12:10,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 23:12:10,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:12:10,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:12:10,679 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2023-02-15 23:12:10,679 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-02-15 23:12:10,679 INFO L748 eck$LassoCheckResult]: Stem: 541#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 542#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 538#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 539#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 536#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 537#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 540#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 547#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 544#L20 [2023-02-15 23:12:10,679 INFO L750 eck$LassoCheckResult]: Loop: 544#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 546#L24 assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 535#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 548#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 549#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 544#L20 [2023-02-15 23:12:10,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:10,679 INFO L85 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 3 times [2023-02-15 23:12:10,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:10,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197171343] [2023-02-15 23:12:10,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:10,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:10,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:10,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:10,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:10,746 INFO L85 PathProgramCache]: Analyzing trace with hash 49758086, now seen corresponding path program 1 times [2023-02-15 23:12:10,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:10,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879007061] [2023-02-15 23:12:10,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:10,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:10,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:12:10,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879007061] [2023-02-15 23:12:10,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879007061] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:12:10,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:12:10,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 23:12:10,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044969617] [2023-02-15 23:12:10,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:12:10,792 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:12:10,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:12:10,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 23:12:10,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 23:12:10,793 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:10,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:12:10,810 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2023-02-15 23:12:10,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2023-02-15 23:12:10,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 23:12:10,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 19 transitions. [2023-02-15 23:12:10,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-02-15 23:12:10,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-02-15 23:12:10,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2023-02-15 23:12:10,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:12:10,811 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-02-15 23:12:10,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2023-02-15 23:12:10,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-02-15 23:12:10,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:10,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-02-15 23:12:10,812 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-02-15 23:12:10,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 23:12:10,812 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-02-15 23:12:10,812 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-15 23:12:10,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2023-02-15 23:12:10,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 23:12:10,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:12:10,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:12:10,813 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2023-02-15 23:12:10,813 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2023-02-15 23:12:10,813 INFO L748 eck$LassoCheckResult]: Stem: 584#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 585#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 587#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 582#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 579#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 580#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 583#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 586#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 588#L20 [2023-02-15 23:12:10,813 INFO L750 eck$LassoCheckResult]: Loop: 588#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 589#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 591#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 577#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 578#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 581#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 592#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 588#L20 [2023-02-15 23:12:10,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:10,813 INFO L85 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 4 times [2023-02-15 23:12:10,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:10,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737393302] [2023-02-15 23:12:10,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:10,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:10,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:10,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:10,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:10,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1770012235, now seen corresponding path program 1 times [2023-02-15 23:12:10,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:10,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201087495] [2023-02-15 23:12:10,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:10,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:10,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:10,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:10,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:10,889 INFO L85 PathProgramCache]: Analyzing trace with hash -161041423, now seen corresponding path program 2 times [2023-02-15 23:12:10,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:10,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274933422] [2023-02-15 23:12:10,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:10,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:10,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:10,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:12,126 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:12:12,126 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:12:12,127 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:12:12,127 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:12:12,127 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:12:12,127 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:12,127 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:12:12,127 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:12:12,127 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration6_Lasso [2023-02-15 23:12:12,127 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:12:12,127 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:12:12,130 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:12,146 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:12,714 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:12,716 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:12,717 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:12,719 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:12,720 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:12,721 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:13,143 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:12:13,144 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:12:13,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:13,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:13,151 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:13,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-02-15 23:12:13,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:13,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:13,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:12:13,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:13,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:13,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:13,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:12:13,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:12:13,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:13,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:13,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:13,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:13,175 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:13,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-02-15 23:12:13,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:13,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:13,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:13,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:13,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:13,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:13,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:13,200 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:13,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-02-15 23:12:13,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:13,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:13,204 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:13,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-02-15 23:12:13,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:13,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:13,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:13,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:13,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:13,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:13,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:13,243 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:12:13,251 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-02-15 23:12:13,251 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2023-02-15 23:12:13,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:13,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:13,253 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:13,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-02-15 23:12:13,256 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:12:13,269 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2023-02-15 23:12:13,270 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:12:13,270 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0#1.base) ULTIMATE.start_main_~x1~0#1.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0#1.base) ULTIMATE.start_main_~x1~0#1.offset)_2 + 1 Supporting invariants [3*ULTIMATE.start_main_#t~mem6#1 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0#1.base) ULTIMATE.start_main_~x1~0#1.offset)_2 >= 0, 1*ULTIMATE.start_main_#t~mem6#1 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0#1.base) ULTIMATE.start_main_~x1~0#1.offset)_2 >= 0] [2023-02-15 23:12:13,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-02-15 23:12:13,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-02-15 23:12:13,417 INFO L156 tatePredicateManager]: 38 out of 39 supporting invariants were superfluous and have been removed [2023-02-15 23:12:13,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:13,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 23:12:13,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:12:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:13,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 23:12:13,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:12:13,481 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 30 treesize of output 18 [2023-02-15 23:12:13,521 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2023-02-15 23:12:13,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 30 [2023-02-15 23:12:13,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:13,549 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2023-02-15 23:12:13,549 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:13,573 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 20 states and 24 transitions. Complement of second has 4 states. [2023-02-15 23:12:13,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 0 non-accepting loop states 2 accepting loop states [2023-02-15 23:12:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:13,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2023-02-15 23:12:13,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 7 letters. [2023-02-15 23:12:13,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:12:13,574 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:12:13,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:13,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 23:12:13,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:12:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:13,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 23:12:13,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:12:13,633 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 30 treesize of output 18 [2023-02-15 23:12:13,668 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2023-02-15 23:12:13,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 30 [2023-02-15 23:12:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:13,692 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2023-02-15 23:12:13,692 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:13,740 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 39 transitions. Complement of second has 11 states. [2023-02-15 23:12:13,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-15 23:12:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2023-02-15 23:12:13,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 8 letters. Loop has 7 letters. [2023-02-15 23:12:13,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:12:13,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 15 letters. Loop has 7 letters. [2023-02-15 23:12:13,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:12:13,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 8 letters. Loop has 14 letters. [2023-02-15 23:12:13,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:12:13,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2023-02-15 23:12:13,742 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2023-02-15 23:12:13,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 39 transitions. [2023-02-15 23:12:13,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-02-15 23:12:13,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2023-02-15 23:12:13,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2023-02-15 23:12:13,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:12:13,743 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-02-15 23:12:13,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2023-02-15 23:12:13,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2023-02-15 23:12:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:13,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2023-02-15 23:12:13,745 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-02-15 23:12:13,745 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-02-15 23:12:13,745 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-15 23:12:13,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2023-02-15 23:12:13,745 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2023-02-15 23:12:13,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:12:13,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:12:13,746 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2023-02-15 23:12:13,746 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 23:12:13,746 INFO L748 eck$LassoCheckResult]: Stem: 944#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 945#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 946#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 942#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 939#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 940#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 943#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 958#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 957#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 938#L24-2 [2023-02-15 23:12:13,746 INFO L750 eck$LassoCheckResult]: Loop: 938#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 941#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 937#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 938#L24-2 [2023-02-15 23:12:13,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:13,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 3 times [2023-02-15 23:12:13,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:13,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955344627] [2023-02-15 23:12:13,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:13,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:13,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:13,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:13,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:13,794 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 2 times [2023-02-15 23:12:13,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:13,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171948929] [2023-02-15 23:12:13,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:13,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:13,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:13,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:13,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:13,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1467212283, now seen corresponding path program 4 times [2023-02-15 23:12:13,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:13,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523946751] [2023-02-15 23:12:13,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:13,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:13,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:13,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:15,124 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:12:15,124 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:12:15,124 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:12:15,124 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:12:15,124 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:12:15,124 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:15,124 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:12:15,124 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:12:15,124 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration7_Lasso [2023-02-15 23:12:15,124 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:12:15,124 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:12:15,126 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:15,128 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:15,129 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:15,131 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:15,133 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:15,134 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:15,136 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:15,561 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:15,563 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:15,841 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:12:15,841 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:12:15,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:15,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:15,843 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:15,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-02-15 23:12:15,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:15,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:15,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:15,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:15,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:15,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:15,876 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:15,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:15,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:15,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:15,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:15,897 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:15,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-02-15 23:12:15,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:15,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:15,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:12:15,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:15,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:15,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:15,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:12:15,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:12:15,922 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:15,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:15,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:15,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:15,928 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:15,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-02-15 23:12:15,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:15,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:15,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:15,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:15,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:15,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:15,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:15,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:15,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:15,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:15,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:15,951 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:15,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-02-15 23:12:15,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:15,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:15,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:12:15,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:15,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:15,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:15,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:12:15,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:12:15,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:15,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:15,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:15,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:15,968 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:15,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-02-15 23:12:15,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:15,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:15,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:12:15,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:15,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:15,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:15,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:12:15,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:12:15,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:15,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-02-15 23:12:15,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:15,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:15,984 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:15,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-02-15 23:12:15,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:15,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:15,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:12:15,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:15,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:15,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:15,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:12:15,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:12:16,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:16,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2023-02-15 23:12:16,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:16,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:16,012 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:16,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-02-15 23:12:16,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:12:16,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:16,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:16,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:16,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:16,023 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:16,023 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:16,043 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:12:16,046 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-15 23:12:16,046 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2023-02-15 23:12:16,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:16,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:16,047 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:12:16,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-02-15 23:12:16,050 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:12:16,057 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-02-15 23:12:16,057 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:12:16,057 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_3) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_3 + 1 Supporting invariants [] [2023-02-15 23:12:16,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:16,133 INFO L156 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2023-02-15 23:12:16,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:16,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 23:12:16,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:12:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:16,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 23:12:16,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:12:16,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:16,212 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-15 23:12:16,212 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:16,225 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 61 states and 74 transitions. Complement of second has 7 states. [2023-02-15 23:12:16,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-15 23:12:16,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2023-02-15 23:12:16,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2023-02-15 23:12:16,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:12:16,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 3 letters. [2023-02-15 23:12:16,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:12:16,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 6 letters. [2023-02-15 23:12:16,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:12:16,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 74 transitions. [2023-02-15 23:12:16,240 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2023-02-15 23:12:16,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 51 states and 62 transitions. [2023-02-15 23:12:16,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2023-02-15 23:12:16,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2023-02-15 23:12:16,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 62 transitions. [2023-02-15 23:12:16,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:12:16,241 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 62 transitions. [2023-02-15 23:12:16,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 62 transitions. [2023-02-15 23:12:16,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2023-02-15 23:12:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 46 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:16,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2023-02-15 23:12:16,252 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 58 transitions. [2023-02-15 23:12:16,252 INFO L428 stractBuchiCegarLoop]: Abstraction has 47 states and 58 transitions. [2023-02-15 23:12:16,252 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-15 23:12:16,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 58 transitions. [2023-02-15 23:12:16,253 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2023-02-15 23:12:16,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:12:16,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:12:16,253 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2023-02-15 23:12:16,253 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2023-02-15 23:12:16,254 INFO L748 eck$LassoCheckResult]: Stem: 1237#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1238#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1241#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1240#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1230#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1231#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1263#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1262#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1260#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1261#L24 [2023-02-15 23:12:16,254 INFO L750 eck$LassoCheckResult]: Loop: 1261#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1272#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1271#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1270#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1257#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1269#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1255#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1256#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1261#L24 [2023-02-15 23:12:16,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:16,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2023-02-15 23:12:16,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:16,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977606846] [2023-02-15 23:12:16,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:16,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:16,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:16,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:12:16,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977606846] [2023-02-15 23:12:16,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977606846] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:12:16,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562661189] [2023-02-15 23:12:16,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:16,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:12:16,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:16,687 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:12:16,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-02-15 23:12:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:16,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-15 23:12:16,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:12:17,744 INFO L321 Elim1Store]: treesize reduction 489, result has 34.5 percent of original size [2023-02-15 23:12:17,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 31 case distinctions, treesize of input 510 treesize of output 1131 [2023-02-15 23:12:17,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 25 treesize of output 24 [2023-02-15 23:12:17,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 46 treesize of output 42 [2023-02-15 23:12:17,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 25 treesize of output 24 [2023-02-15 23:12:18,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 23:12:18,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 23:12:18,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 25 treesize of output 24 [2023-02-15 23:12:20,676 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:12:20,693 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:12:20,696 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:12:20,706 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:12:20,714 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:12:20,719 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:12:20,719 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:12:20,724 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:12:20,801 INFO L321 Elim1Store]: treesize reduction 96, result has 15.0 percent of original size [2023-02-15 23:12:20,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 18 case distinctions, treesize of input 1298 treesize of output 1632 [2023-02-15 23:12:21,631 INFO L217 Elim1Store]: Index analysis took 344 ms [2023-02-15 23:12:21,848 INFO L321 Elim1Store]: treesize reduction 276, result has 12.9 percent of original size [2023-02-15 23:12:21,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 29 case distinctions, treesize of input 1938 treesize of output 2120 [2023-02-15 23:12:33,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 101 [2023-02-15 23:12:33,365 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:12:33,375 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:12:33,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 74 [2023-02-15 23:12:33,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-02-15 23:12:33,483 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 23:12:45,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:12:49,407 INFO L321 Elim1Store]: treesize reduction 138, result has 22.9 percent of original size [2023-02-15 23:12:49,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 83311 treesize of output 78304 [2023-02-15 23:15:21,717 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:21,718 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:21,728 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:21,729 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:21,729 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:21,730 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:21,730 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:21,731 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:21,748 INFO L321 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2023-02-15 23:15:21,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 1051 treesize of output 1048 [2023-02-15 23:15:22,797 INFO L321 Elim1Store]: treesize reduction 39, result has 39.1 percent of original size [2023-02-15 23:15:22,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 2056 treesize of output 2031 [2023-02-15 23:15:25,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 558 treesize of output 450 [2023-02-15 23:15:26,089 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:26,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:26,091 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:26,093 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:26,094 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:26,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 72 [2023-02-15 23:15:26,168 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:26,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:26,169 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:26,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 84 [2023-02-15 23:15:26,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:26,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:26,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:26,599 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:26,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:26,603 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:26,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 57 [2023-02-15 23:15:26,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:26,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:26,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:26,628 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:26,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:26,632 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:26,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 57 [2023-02-15 23:15:26,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 293 [2023-02-15 23:15:27,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 293 [2023-02-15 23:15:28,463 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:28,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 107 [2023-02-15 23:15:28,470 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:28,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 95 [2023-02-15 23:15:30,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 293 [2023-02-15 23:15:30,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:30,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:30,472 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:30,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:30,475 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:30,483 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-02-15 23:15:30,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 197 treesize of output 104 [2023-02-15 23:15:30,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:30,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:30,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:30,520 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:30,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:30,527 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:30,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 55 [2023-02-15 23:15:30,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:30,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:30,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:30,564 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:30,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:30,568 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:30,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 55 [2023-02-15 23:15:30,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 293 [2023-02-15 23:15:32,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:32,185 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:32,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:32,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:32,190 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:32,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 59 [2023-02-15 23:15:32,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 23:15:32,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:32,216 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:32,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:32,234 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:32,240 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-02-15 23:15:32,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 167 treesize of output 78 [2023-02-15 23:15:33,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:33,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:33,874 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:33,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:33,877 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:33,882 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-02-15 23:15:33,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 167 treesize of output 78 [2023-02-15 23:15:34,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:34,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:34,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:34,157 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:34,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:34,161 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:34,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 59 [2023-02-15 23:15:34,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 23:15:34,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 553 treesize of output 491 [2023-02-15 23:15:35,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 553 treesize of output 491 [2023-02-15 23:15:36,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 558 treesize of output 450 [2023-02-15 23:15:37,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 705 treesize of output 575 [2023-02-15 23:15:39,019 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-02-15 23:15:39,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 712 treesize of output 571 [2023-02-15 23:15:41,233 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-02-15 23:15:41,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 719 treesize of output 576 [2023-02-15 23:15:41,811 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:41,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:41,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:41,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:41,816 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:41,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 57 [2023-02-15 23:15:42,013 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:42,027 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-02-15 23:15:42,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1640 treesize of output 1429 [2023-02-15 23:15:44,310 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-02-15 23:15:44,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 756 treesize of output 613 [2023-02-15 23:15:45,743 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-02-15 23:15:45,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 742 treesize of output 607 [2023-02-15 23:15:47,377 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-02-15 23:15:47,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 756 treesize of output 611 [2023-02-15 23:15:48,588 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:48,600 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-02-15 23:15:48,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 749 treesize of output 680 [2023-02-15 23:15:50,659 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-02-15 23:15:50,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 756 treesize of output 611 [2023-02-15 23:15:51,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:51,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:51,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:51,588 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:51,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:51,592 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:51,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 57 [2023-02-15 23:15:51,610 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:51,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 107 [2023-02-15 23:15:51,616 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:51,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 97 [2023-02-15 23:15:52,996 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:52,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:52,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:53,006 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:53,012 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-02-15 23:15:53,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 182 treesize of output 91 [2023-02-15 23:15:53,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:53,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:53,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:53,550 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:53,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:53,554 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:53,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 78 [2023-02-15 23:15:53,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 23:15:53,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:53,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:53,826 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:53,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:53,830 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:53,840 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-02-15 23:15:53,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 190 treesize of output 105 [2023-02-15 23:15:53,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 23:15:55,238 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:55,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 401 treesize of output 300 [2023-02-15 23:15:56,014 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:56,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:56,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:56,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:56,022 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:56,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 55 [2023-02-15 23:15:56,059 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:56,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:56,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:56,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:56,067 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:56,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 57 [2023-02-15 23:15:56,498 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:56,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 293 [2023-02-15 23:15:59,038 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:59,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 387 treesize of output 290 [2023-02-15 23:15:59,129 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:59,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:59,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:59,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:15:59,137 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:59,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 57 [2023-02-15 23:15:59,450 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:59,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 401 treesize of output 298 [2023-02-15 23:15:59,989 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:15:59,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 783 treesize of output 653 [2023-02-15 23:16:00,417 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:00,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 408 treesize of output 339 [2023-02-15 23:16:00,999 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:01,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 387 treesize of output 290 [2023-02-15 23:16:01,268 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:01,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:01,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:01,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:01,274 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:01,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 54 [2023-02-15 23:16:01,708 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:01,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 401 treesize of output 296 [2023-02-15 23:16:01,976 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:01,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 107 [2023-02-15 23:16:01,982 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:01,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 95 [2023-02-15 23:16:04,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:04,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:04,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:04,836 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:04,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:04,841 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:04,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 55 [2023-02-15 23:16:05,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:05,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:05,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:05,153 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:05,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:05,157 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:05,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 55 [2023-02-15 23:16:07,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:07,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:07,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:07,891 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:07,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:07,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:07,922 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:07,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 55 [2023-02-15 23:16:08,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:08,624 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:08,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:08,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:08,628 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:08,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 55 [2023-02-15 23:16:08,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:08,932 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:08,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:08,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:08,945 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:08,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 55 [2023-02-15 23:16:08,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:08,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:08,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:08,986 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:08,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:08,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:08,991 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:08,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 55 [2023-02-15 23:16:11,343 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:11,348 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-02-15 23:16:11,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 712 treesize of output 571 [2023-02-15 23:16:12,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:12,596 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:12,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:12,601 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:12,633 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-02-15 23:16:12,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 108 [2023-02-15 23:16:12,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:12,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:12,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:12,670 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:12,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:12,674 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:12,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 55 [2023-02-15 23:16:13,161 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:13,169 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-02-15 23:16:13,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 656 treesize of output 517 [2023-02-15 23:16:14,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:14,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:14,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:14,336 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:14,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:14,341 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:14,346 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-02-15 23:16:14,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 108 [2023-02-15 23:16:14,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:14,973 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:14,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:14,977 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:14,986 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-02-15 23:16:14,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 317 treesize of output 210 [2023-02-15 23:16:15,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 23:16:15,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 23:16:16,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:16,020 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:16,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:16,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:16,027 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:16,038 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-02-15 23:16:16,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 239 treesize of output 146 [2023-02-15 23:16:16,209 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:16,222 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-02-15 23:16:16,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 143 [2023-02-15 23:16:16,231 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:16,242 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-02-15 23:16:16,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 184 treesize of output 133 [2023-02-15 23:16:18,909 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:18,915 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-02-15 23:16:18,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 719 treesize of output 576 [2023-02-15 23:16:19,981 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:19,996 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-02-15 23:16:19,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 96 [2023-02-15 23:16:20,014 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:20,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:20,026 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-02-15 23:16:20,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 96 [2023-02-15 23:16:20,447 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:20,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:20,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:20,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:16:20,454 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:16:20,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 57