./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 7e1ff0e6 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-?-7e1ff0e [2023-02-15 02:21:37,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 02:21:37,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 02:21:37,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 02:21:37,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 02:21:37,376 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 02:21:37,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 02:21:37,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 02:21:37,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 02:21:37,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 02:21:37,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 02:21:37,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 02:21:37,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 02:21:37,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 02:21:37,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 02:21:37,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 02:21:37,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 02:21:37,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 02:21:37,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 02:21:37,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 02:21:37,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 02:21:37,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 02:21:37,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 02:21:37,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 02:21:37,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 02:21:37,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 02:21:37,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 02:21:37,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 02:21:37,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 02:21:37,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 02:21:37,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 02:21:37,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 02:21:37,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 02:21:37,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 02:21:37,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 02:21:37,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 02:21:37,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 02:21:37,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 02:21:37,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 02:21:37,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 02:21:37,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 02:21:37,415 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-15 02:21:37,442 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 02:21:37,443 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 02:21:37,443 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 02:21:37,443 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 02:21:37,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 02:21:37,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 02:21:37,444 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 02:21:37,445 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-15 02:21:37,445 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-15 02:21:37,445 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-15 02:21:37,445 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-15 02:21:37,446 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-15 02:21:37,446 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-15 02:21:37,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 02:21:37,446 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 02:21:37,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 02:21:37,446 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 02:21:37,446 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-15 02:21:37,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-15 02:21:37,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-15 02:21:37,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 02:21:37,447 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-15 02:21:37,447 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 02:21:37,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-15 02:21:37,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 02:21:37,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 02:21:37,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 02:21:37,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 02:21:37,449 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-15 02:21:37,449 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 02:21:37,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 02:21:37,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 02:21:37,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 02:21:37,700 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 02:21:37,700 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 02:21:37,701 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 02:21:38,847 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 02:21:38,985 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 02:21:38,985 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2023-02-15 02:21:38,995 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82e8bcf9f/61db651867d646129ba868c8017b8fea/FLAG0290a250b [2023-02-15 02:21:39,012 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82e8bcf9f/61db651867d646129ba868c8017b8fea [2023-02-15 02:21:39,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 02:21:39,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 02:21:39,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 02:21:39,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 02:21:39,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 02:21:39,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:21:39" (1/1) ... [2023-02-15 02:21:39,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e075bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:39, skipping insertion in model container [2023-02-15 02:21:39,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:21:39" (1/1) ... [2023-02-15 02:21:39,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 02:21:39,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 02:21:39,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 02:21:39,188 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 02:21:39,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 02:21:39,214 INFO L208 MainTranslator]: Completed translation [2023-02-15 02:21:39,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:39 WrapperNode [2023-02-15 02:21:39,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 02:21:39,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 02:21:39,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 02:21:39,216 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 02:21:39,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:39" (1/1) ... [2023-02-15 02:21:39,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:39" (1/1) ... [2023-02-15 02:21:39,247 INFO L138 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 61 [2023-02-15 02:21:39,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 02:21:39,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 02:21:39,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 02:21:39,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 02:21:39,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:39" (1/1) ... [2023-02-15 02:21:39,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:39" (1/1) ... [2023-02-15 02:21:39,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:39" (1/1) ... [2023-02-15 02:21:39,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:39" (1/1) ... [2023-02-15 02:21:39,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:39" (1/1) ... [2023-02-15 02:21:39,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:39" (1/1) ... [2023-02-15 02:21:39,285 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:39" (1/1) ... [2023-02-15 02:21:39,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:39" (1/1) ... [2023-02-15 02:21:39,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 02:21:39,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 02:21:39,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 02:21:39,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 02:21:39,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:39" (1/1) ... [2023-02-15 02:21:39,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:21:39,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:21:39,330 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 02:21:39,358 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 02:21:39,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 02:21:39,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 02:21:39,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 02:21:39,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 02:21:39,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 02:21:39,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 02:21:39,453 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 02:21:39,473 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 02:21:39,704 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 02:21:39,711 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 02:21:39,715 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 02:21:39,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:21:39 BoogieIcfgContainer [2023-02-15 02:21:39,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 02:21:39,718 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-15 02:21:39,721 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-15 02:21:39,724 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-15 02:21:39,738 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 02:21:39,738 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.02 02:21:39" (1/3) ... [2023-02-15 02:21:39,739 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ea26478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:21:39, skipping insertion in model container [2023-02-15 02:21:39,739 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 02:21:39,739 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:39" (2/3) ... [2023-02-15 02:21:39,740 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ea26478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:21:39, skipping insertion in model container [2023-02-15 02:21:39,740 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 02:21:39,740 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:21:39" (3/3) ... [2023-02-15 02:21:39,741 INFO L332 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2023-02-15 02:21:39,843 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-15 02:21:39,843 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-15 02:21:39,843 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-15 02:21:39,843 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-15 02:21:39,843 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-15 02:21:39,844 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-15 02:21:39,844 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-15 02:21:39,844 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-15 02:21:39,857 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 02:21:39,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 02:21:39,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 02:21:39,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 02:21:39,893 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 02:21:39,904 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 02:21:39,905 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-15 02:21:39,905 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 02:21:39,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 02:21:39,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 02:21:39,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 02:21:39,907 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 02:21:39,907 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 02:21:39,924 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 02:21:39,924 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 02:21:39,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:21:39,930 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-02-15 02:21:39,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:21:39,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974887315] [2023-02-15 02:21:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:21:39,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:21:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:21:40,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:21:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:21:40,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:21:40,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:21:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2023-02-15 02:21:40,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:21:40,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472956825] [2023-02-15 02:21:40,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:21:40,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:21:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:21:40,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:21:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:21:40,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:21:40,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:21:40,263 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2023-02-15 02:21:40,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:21:40,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587761343] [2023-02-15 02:21:40,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:21:40,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:21:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:21:40,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:21:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:21:40,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:21:41,642 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 02:21:41,643 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 02:21:41,643 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 02:21:41,643 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 02:21:41,643 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 02:21:41,643 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:21:41,643 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 02:21:41,643 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 02:21:41,644 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2023-02-15 02:21:41,644 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 02:21:41,644 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 02:21:41,657 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 02:21:41,663 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 02:21:42,182 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 02:21:42,184 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 02:21:42,187 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 02:21:42,189 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 02:21:42,191 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 02:21:42,194 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 02:21:42,196 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 02:21:42,198 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 02:21:42,200 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 02:21:42,520 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 02:21:42,523 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 02:21:42,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:21:42,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:21:42,527 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 02:21:42,533 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 02:21:42,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 02:21:42,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:21:42,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 02:21:42,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:21:42,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:21:42,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:21:42,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 02:21:42,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 02:21:42,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:21:42,573 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 02:21:42,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:21:42,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:21:42,575 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 02:21:42,579 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 02:21:42,581 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 02:21:42,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:21:42,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:21:42,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:21:42,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:21:42,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 02:21:42,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 02:21:42,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:21:42,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-02-15 02:21:42,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:21:42,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:21:42,603 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 02:21:42,605 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 02:21:42,606 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 02:21:42,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:21:42,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:21:42,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:21:42,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:21:42,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 02:21:42,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 02:21:42,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:21:42,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-02-15 02:21:42,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:21:42,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:21:42,658 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 02:21:42,669 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 02:21:42,671 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 02:21:42,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:21:42,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:21:42,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:21:42,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:21:42,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 02:21:42,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 02:21:42,697 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:21:42,702 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 02:21:42,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:21:42,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:21:42,704 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 02:21:42,706 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 02:21:42,707 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 02:21:42,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:21:42,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:21:42,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:21:42,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:21:42,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 02:21:42,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 02:21:42,724 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:21:42,727 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 02:21:42,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:21:42,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:21:42,729 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 02:21:42,731 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 02:21:42,733 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 02:21:42,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:21:42,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:21:42,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:21:42,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:21:42,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 02:21:42,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 02:21:42,750 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:21:42,754 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 02:21:42,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:21:42,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:21:42,755 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 02:21:42,757 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 02:21:42,758 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 02:21:42,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:21:42,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:21:42,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:21:42,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:21:42,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 02:21:42,767 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 02:21:42,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:21:42,779 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 02:21:42,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:21:42,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:21:42,780 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 02:21:42,781 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 02:21:42,784 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 02:21:42,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:21:42,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:21:42,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:21:42,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:21:42,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 02:21:42,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 02:21:42,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:21:42,803 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 02:21:42,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:21:42,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:21:42,804 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 02:21:42,806 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 02:21:42,808 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 02:21:42,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:21:42,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:21:42,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:21:42,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:21:42,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 02:21:42,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 02:21:42,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:21:42,855 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 02:21:42,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:21:42,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:21:42,856 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 02:21:42,861 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 02:21:42,862 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 02:21:42,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:21:42,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:21:42,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:21:42,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:21:42,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 02:21:42,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 02:21:42,900 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:21:42,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-02-15 02:21:42,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:21:42,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:21:42,905 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 02:21:42,935 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 02:21:42,935 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 02:21:42,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:21:42,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:21:42,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:21:42,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:21:42,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 02:21:42,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 02:21:42,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:21:42,968 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 02:21:42,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:21:42,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:21:42,970 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 02:21:42,972 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 02:21:42,974 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 02:21:42,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:21:42,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:21:42,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:21:42,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:21:42,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 02:21:42,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 02:21:43,005 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:21:43,008 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 02:21:43,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:21:43,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:21:43,011 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 02:21:43,028 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 02:21:43,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:21:43,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:21:43,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:21:43,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:21:43,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 02:21:43,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 02:21:43,040 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 02:21:43,048 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 02:21:43,068 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-02-15 02:21:43,068 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-02-15 02:21:43,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:21:43,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:21:43,125 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 02:21:43,163 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 02:21:43,170 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 02:21:43,185 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-02-15 02:21:43,186 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 02:21:43,186 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 02:21:43,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-02-15 02:21:43,286 INFO L156 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2023-02-15 02:21:43,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:21:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:21:43,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 02:21:43,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:21:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:21:43,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 02:21:43,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:21:43,366 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 02:21:43,403 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 02:21:43,404 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 02:21:43,432 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 02:21:43,434 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 02:21:43,437 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 02:21:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2023-02-15 02:21:43,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2023-02-15 02:21:43,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:21:43,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2023-02-15 02:21:43,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:21:43,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2023-02-15 02:21:43,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:21:43,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2023-02-15 02:21:43,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 02:21:43,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 18 transitions. [2023-02-15 02:21:43,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2023-02-15 02:21:43,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2023-02-15 02:21:43,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2023-02-15 02:21:43,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 02:21:43,446 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2023-02-15 02:21:43,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2023-02-15 02:21:43,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-02-15 02:21:43,461 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 02:21:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2023-02-15 02:21:43,462 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2023-02-15 02:21:43,463 INFO L428 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2023-02-15 02:21:43,463 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-15 02:21:43,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2023-02-15 02:21:43,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 02:21:43,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 02:21:43,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 02:21:43,464 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-15 02:21:43,464 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 02:21:43,464 INFO L748 eck$LassoCheckResult]: Stem: 234#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 235#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); 236#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 233#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); 226#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); 227#L20 [2023-02-15 02:21:43,464 INFO L750 eck$LassoCheckResult]: Loop: 227#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); 230#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 231#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); 238#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); 227#L20 [2023-02-15 02:21:43,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:21:43,465 INFO L85 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2023-02-15 02:21:43,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:21:43,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561221895] [2023-02-15 02:21:43,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:21:43,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:21:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:21:43,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-02-15 02:21:43,935 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 02:21:43,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 02:21:43,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561221895] [2023-02-15 02:21:43,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561221895] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 02:21:43,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 02:21:43,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 02:21:43,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274258975] [2023-02-15 02:21:43,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 02:21:43,939 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 02:21:43,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:21:43,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2023-02-15 02:21:43,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:21:43,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465510841] [2023-02-15 02:21:43,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:21:43,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:21:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:21:43,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:21:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:21:43,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:21:44,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 02:21:44,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 02:21:44,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 02:21:44,070 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 02:21:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 02:21:44,113 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2023-02-15 02:21:44,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2023-02-15 02:21:44,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 02:21:44,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 19 transitions. [2023-02-15 02:21:44,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2023-02-15 02:21:44,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2023-02-15 02:21:44,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2023-02-15 02:21:44,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 02:21:44,117 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2023-02-15 02:21:44,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2023-02-15 02:21:44,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2023-02-15 02:21:44,119 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 02:21:44,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2023-02-15 02:21:44,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2023-02-15 02:21:44,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 02:21:44,121 INFO L428 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2023-02-15 02:21:44,121 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-15 02:21:44,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2023-02-15 02:21:44,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 02:21:44,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 02:21:44,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 02:21:44,124 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2023-02-15 02:21:44,124 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 02:21:44,124 INFO L748 eck$LassoCheckResult]: Stem: 273#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 274#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); 270#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 271#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); 268#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); 269#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 272#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); 266#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); 267#L20 [2023-02-15 02:21:44,124 INFO L750 eck$LassoCheckResult]: Loop: 267#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); 275#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 277#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); 278#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); 267#L20 [2023-02-15 02:21:44,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:21:44,126 INFO L85 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2023-02-15 02:21:44,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:21:44,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176759705] [2023-02-15 02:21:44,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:21:44,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:21:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:21:44,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:21:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:21:44,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:21:44,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:21:44,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 2 times [2023-02-15 02:21:44,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:21:44,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101476832] [2023-02-15 02:21:44,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:21:44,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:21:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:21:44,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:21:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:21:44,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:21:44,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:21:44,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1467212285, now seen corresponding path program 1 times [2023-02-15 02:21:44,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:21:44,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660935362] [2023-02-15 02:21:44,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:21:44,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:21:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:21:44,403 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 02:21:44,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 02:21:44,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660935362] [2023-02-15 02:21:44,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660935362] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 02:21:44,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503583501] [2023-02-15 02:21:44,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:21:44,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 02:21:44,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:21:44,405 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 02:21:44,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 02:21:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:21:44,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 02:21:44,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:21:44,509 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 02:21:44,521 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 02:21:44,532 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 02:21:44,540 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 02:21:44,546 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 02:21:44,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 02:21:56,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 02:21:56,737 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 02:21:56,740 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 02:21:56,758 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 02:21:56,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503583501] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 02:21:56,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 02:21:56,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2023-02-15 02:21:56,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79015945] [2023-02-15 02:21:56,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 02:21:56,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 02:21:56,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 02:21:56,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=43, Unknown=2, NotChecked=0, Total=72 [2023-02-15 02:21:56,871 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 02:21:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 02:21:56,922 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2023-02-15 02:21:56,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2023-02-15 02:21:56,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 02:21:56,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 22 transitions. [2023-02-15 02:21:56,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-02-15 02:21:56,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-02-15 02:21:56,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2023-02-15 02:21:56,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 02:21:56,923 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-02-15 02:21:56,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2023-02-15 02:21:56,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2023-02-15 02:21:56,924 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 02:21:56,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-02-15 02:21:56,925 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-02-15 02:21:56,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 02:21:56,926 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-02-15 02:21:56,926 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-15 02:21:56,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2023-02-15 02:21:56,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 02:21:56,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 02:21:56,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 02:21:56,927 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2023-02-15 02:21:56,927 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-02-15 02:21:56,927 INFO L748 eck$LassoCheckResult]: Stem: 386#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 387#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); 383#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 384#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); 381#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); 382#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 385#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); 392#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); 389#L20 [2023-02-15 02:21:56,927 INFO L750 eck$LassoCheckResult]: Loop: 389#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); 391#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); 380#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 393#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); 394#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); 389#L20 [2023-02-15 02:21:56,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:21:56,928 INFO L85 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 2 times [2023-02-15 02:21:56,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:21:56,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932279855] [2023-02-15 02:21:56,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:21:56,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:21:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:21:56,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:21:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:21:56,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:21:56,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:21:56,964 INFO L85 PathProgramCache]: Analyzing trace with hash 49698504, now seen corresponding path program 1 times [2023-02-15 02:21:56,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:21:56,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335314716] [2023-02-15 02:21:56,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:21:56,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:21:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:21:56,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:21:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:21:56,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:21:56,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:21:56,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1758681084, now seen corresponding path program 1 times [2023-02-15 02:21:56,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:21:56,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537327410] [2023-02-15 02:21:56,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:21:56,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:21:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:21:57,284 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 02:21:57,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 02:21:57,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537327410] [2023-02-15 02:21:57,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537327410] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 02:21:57,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895715801] [2023-02-15 02:21:57,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:21:57,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 02:21:57,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:21:57,288 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 02:21:57,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 02:21:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:21:57,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 02:21:57,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:21:58,551 INFO L321 Elim1Store]: treesize reduction 489, result has 34.5 percent of original size [2023-02-15 02:21:58,551 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 250 treesize of output 1027 [2023-02-15 02:21:58,590 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 02:21:58,662 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 02:21:58,699 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 02:22:01,186 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 02:22:01,189 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 02:22:01,204 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 02:22:01,206 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 02:22:01,265 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 02:22:01,286 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 02:22:01,303 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 02:22:01,305 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 02:22:01,406 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 02:22:08,982 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 7738 treesize of output 7686 [2023-02-15 02:22:11,799 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 02:22:11,800 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2023-02-15 02:22:11,913 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 02:22:11,915 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2023-02-15 02:22:16,794 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 02:22:16,800 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 02:22:17,645 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 02:22:17,651 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 02:22:18,715 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 02:22:19,128 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 02:22:19,146 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 02:22:33,025 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 02:22:33,042 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 02:22:33,105 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 02:22:33,175 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 02:22:33,237 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 02:22:33,605 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 02:22:33,637 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 02:22:33,731 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 02:22:33,849 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 02:22:33,939 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 02:22:35,365 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 02:22:35,395 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 02:22:35,463 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 02:22:35,541 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 02:22:35,611 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 02:22:36,105 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 02:22:36,142 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 02:22:36,248 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 02:22:36,377 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 02:22:36,494 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 02:22:46,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 5 treesize of output 3 [2023-02-15 02:22:46,269 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 02:22:46,529 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 02:22:46,592 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 02:22:46,848 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 02:22:46,874 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 02:22:46,910 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 02:22:46,936 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 02:22:47,204 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 02:22:47,238 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 02:22:47,323 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 02:22:47,365 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 02:22:47,528 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 02:22:47,570 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 02:22:47,723 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 02:22:47,763 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 02:22:47,801 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 02:22:47,824 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 02:22:48,110 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 02:22:48,151 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 02:22:48,229 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 02:22:48,237 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 02:22:48,270 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 02:22:48,278 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 02:22:48,410 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 02:22:48,421 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 02:22:48,557 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 02:22:48,617 WARN L207 Elim1Store]: Array PQE input equivalent to false