./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/tree-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/tree-4.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93cf6e13715dcd5309cb599b4358d41a64464f02c52b3716bc554a9d0e833f5e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:42:57,431 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:42:57,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-01-09 21:42:57,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:42:57,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:42:57,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:42:57,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:42:57,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:42:57,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 21:42:57,498 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 21:42:57,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:42:57,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:42:57,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:42:57,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:42:57,499 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:42:57,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:42:57,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:42:57,499 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:42:57,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:42:57,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:42:57,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:42:57,500 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:42:57,500 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 21:42:57,500 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 21:42:57,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:42:57,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:42:57,500 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 21:42:57,500 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:42:57,500 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:42:57,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:42:57,500 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:42:57,500 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:42:57,501 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:42:57,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:42:57,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:42:57,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:42:57,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:42:57,501 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:42:57,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:42:57,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:42:57,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:42:57,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:42:57,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:42:57,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:42:57,502 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:42:57,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:42:57,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:42:57,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:42:57,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:42:57,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:42:57,502 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93cf6e13715dcd5309cb599b4358d41a64464f02c52b3716bc554a9d0e833f5e [2025-01-09 21:42:57,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:42:57,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:42:57,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:42:57,681 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:42:57,686 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:42:57,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/tree-4.i [2025-01-09 21:42:58,898 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e34878d4/d9662fe5ed854eb6a6a28fedc896a1cc/FLAG0b51a78be [2025-01-09 21:42:59,259 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:42:59,260 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-4.i [2025-01-09 21:42:59,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e34878d4/d9662fe5ed854eb6a6a28fedc896a1cc/FLAG0b51a78be [2025-01-09 21:42:59,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e34878d4/d9662fe5ed854eb6a6a28fedc896a1cc [2025-01-09 21:42:59,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:42:59,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:42:59,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:42:59,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:42:59,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:42:59,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:42:59" (1/1) ... [2025-01-09 21:42:59,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27adf4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:59, skipping insertion in model container [2025-01-09 21:42:59,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:42:59" (1/1) ... [2025-01-09 21:42:59,507 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:42:59,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:42:59,692 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:42:59,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:42:59,732 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:42:59,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:59 WrapperNode [2025-01-09 21:42:59,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:42:59,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:42:59,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:42:59,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:42:59,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:59" (1/1) ... [2025-01-09 21:42:59,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:59" (1/1) ... [2025-01-09 21:42:59,756 INFO L138 Inliner]: procedures = 122, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 135 [2025-01-09 21:42:59,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:42:59,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:42:59,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:42:59,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:42:59,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:59" (1/1) ... [2025-01-09 21:42:59,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:59" (1/1) ... [2025-01-09 21:42:59,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:59" (1/1) ... [2025-01-09 21:42:59,779 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2025-01-09 21:42:59,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:59" (1/1) ... [2025-01-09 21:42:59,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:59" (1/1) ... [2025-01-09 21:42:59,785 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:59" (1/1) ... [2025-01-09 21:42:59,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:59" (1/1) ... [2025-01-09 21:42:59,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:59" (1/1) ... [2025-01-09 21:42:59,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:59" (1/1) ... [2025-01-09 21:42:59,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:59" (1/1) ... [2025-01-09 21:42:59,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:42:59,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:42:59,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:42:59,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:42:59,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:59" (1/1) ... [2025-01-09 21:42:59,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:42:59,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:42:59,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:42:59,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:42:59,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 21:42:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 21:42:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-01-09 21:42:59,831 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-01-09 21:42:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 21:42:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 21:42:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:42:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:42:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 21:42:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 21:42:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 21:42:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 21:42:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:42:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 21:42:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 21:42:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:42:59,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:42:59,902 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:42:59,903 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:43:00,048 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-01-09 21:43:00,048 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:43:00,054 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:43:00,054 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-09 21:43:00,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:43:00 BoogieIcfgContainer [2025-01-09 21:43:00,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:43:00,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:43:00,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:43:00,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:43:00,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:42:59" (1/3) ... [2025-01-09 21:43:00,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62abc0a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:43:00, skipping insertion in model container [2025-01-09 21:43:00,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:59" (2/3) ... [2025-01-09 21:43:00,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62abc0a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:43:00, skipping insertion in model container [2025-01-09 21:43:00,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:43:00" (3/3) ... [2025-01-09 21:43:00,060 INFO L128 eAbstractionObserver]: Analyzing ICFG tree-4.i [2025-01-09 21:43:00,069 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:43:00,070 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree-4.i that has 2 procedures, 49 locations, 1 initial locations, 8 loop locations, and 2 error locations. [2025-01-09 21:43:00,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:43:00,105 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@d35e788, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:43:00,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 21:43:00,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 47 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 21:43:00,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 21:43:00,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:00,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:00,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:00,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash 23855414, now seen corresponding path program 1 times [2025-01-09 21:43:00,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:00,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652479525] [2025-01-09 21:43:00,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:00,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:00,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 21:43:00,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 21:43:00,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:00,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:00,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:00,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652479525] [2025-01-09 21:43:00,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652479525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:00,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:00,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:43:00,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370951763] [2025-01-09 21:43:00,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:00,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:43:00,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:00,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:43:00,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:43:00,258 INFO L87 Difference]: Start difference. First operand has 49 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 47 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2025-01-09 21:43:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:00,267 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2025-01-09 21:43:00,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:43:00,268 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) Word has length 8 [2025-01-09 21:43:00,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:00,272 INFO L225 Difference]: With dead ends: 46 [2025-01-09 21:43:00,273 INFO L226 Difference]: Without dead ends: 44 [2025-01-09 21:43:00,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:43:00,277 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:00,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:43:00,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-09 21:43:00,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-01-09 21:43:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.358974358974359) internal successors, (53), 42 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2025-01-09 21:43:00,302 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 8 [2025-01-09 21:43:00,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:00,302 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2025-01-09 21:43:00,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2025-01-09 21:43:00,302 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2025-01-09 21:43:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 21:43:00,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:00,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:00,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:43:00,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:00,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:00,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1158009843, now seen corresponding path program 1 times [2025-01-09 21:43:00,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:00,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648980503] [2025-01-09 21:43:00,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:00,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:00,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 21:43:00,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 21:43:00,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:00,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:00,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:00,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648980503] [2025-01-09 21:43:00,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648980503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:00,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:00,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:43:00,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491834574] [2025-01-09 21:43:00,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:00,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:43:00,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:00,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:43:00,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:43:00,380 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-01-09 21:43:00,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:00,419 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2025-01-09 21:43:00,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:43:00,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2025-01-09 21:43:00,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:00,421 INFO L225 Difference]: With dead ends: 49 [2025-01-09 21:43:00,421 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 21:43:00,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:43:00,422 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:00,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 97 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:43:00,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 21:43:00,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-01-09 21:43:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 46 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2025-01-09 21:43:00,426 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 9 [2025-01-09 21:43:00,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:00,426 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2025-01-09 21:43:00,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-01-09 21:43:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2025-01-09 21:43:00,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 21:43:00,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:00,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:00,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:43:00,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:00,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:00,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1159856885, now seen corresponding path program 1 times [2025-01-09 21:43:00,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:00,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888264147] [2025-01-09 21:43:00,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:00,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:00,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 21:43:00,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 21:43:00,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:00,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:00,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:00,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888264147] [2025-01-09 21:43:00,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888264147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:00,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:00,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:43:00,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46214752] [2025-01-09 21:43:00,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:00,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:43:00,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:00,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:43:00,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:43:00,453 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-01-09 21:43:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:00,471 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2025-01-09 21:43:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:43:00,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2025-01-09 21:43:00,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:00,472 INFO L225 Difference]: With dead ends: 75 [2025-01-09 21:43:00,472 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 21:43:00,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:43:00,472 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 27 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:00,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 101 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:43:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 21:43:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 51. [2025-01-09 21:43:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.326086956521739) internal successors, (61), 49 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2025-01-09 21:43:00,476 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 9 [2025-01-09 21:43:00,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:00,476 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2025-01-09 21:43:00,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-01-09 21:43:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2025-01-09 21:43:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 21:43:00,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:00,477 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:00,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:43:00,477 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:00,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:00,477 INFO L85 PathProgramCache]: Analyzing trace with hash 200797631, now seen corresponding path program 1 times [2025-01-09 21:43:00,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:00,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678159792] [2025-01-09 21:43:00,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:00,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:00,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 21:43:00,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 21:43:00,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:00,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:00,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:00,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:00,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678159792] [2025-01-09 21:43:00,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678159792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:00,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:00,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:43:00,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920366421] [2025-01-09 21:43:00,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:00,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:43:00,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:00,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:43:00,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:43:00,585 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:00,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:00,610 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2025-01-09 21:43:00,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:43:00,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 21:43:00,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:00,611 INFO L225 Difference]: With dead ends: 55 [2025-01-09 21:43:00,611 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 21:43:00,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:43:00,612 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:00,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 200 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:43:00,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 21:43:00,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-09 21:43:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 49 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2025-01-09 21:43:00,614 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 13 [2025-01-09 21:43:00,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:00,615 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2025-01-09 21:43:00,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2025-01-09 21:43:00,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 21:43:00,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:00,616 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:00,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:43:00,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:00,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:00,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1340522688, now seen corresponding path program 1 times [2025-01-09 21:43:00,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:00,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691190087] [2025-01-09 21:43:00,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:00,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:00,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:43:00,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:43:00,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:00,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:00,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:00,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691190087] [2025-01-09 21:43:00,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691190087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:00,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:00,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:43:00,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3926137] [2025-01-09 21:43:00,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:00,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:43:00,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:00,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:43:00,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:43:00,685 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) [2025-01-09 21:43:00,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:00,719 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2025-01-09 21:43:00,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:43:00,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Word has length 16 [2025-01-09 21:43:00,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:00,720 INFO L225 Difference]: With dead ends: 53 [2025-01-09 21:43:00,720 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 21:43:00,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:43:00,721 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 4 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:00,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 91 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:43:00,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 21:43:00,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-01-09 21:43:00,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2025-01-09 21:43:00,724 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 16 [2025-01-09 21:43:00,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:00,724 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2025-01-09 21:43:00,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) [2025-01-09 21:43:00,724 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2025-01-09 21:43:00,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 21:43:00,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:00,724 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:00,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:43:00,725 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:00,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:00,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1326306514, now seen corresponding path program 1 times [2025-01-09 21:43:00,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:00,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194550083] [2025-01-09 21:43:00,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:00,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:00,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 21:43:00,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 21:43:00,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:00,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:00,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:43:00,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:00,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194550083] [2025-01-09 21:43:00,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194550083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:00,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:00,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:43:00,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800298053] [2025-01-09 21:43:00,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:00,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:43:00,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:00,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:43:00,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:43:00,826 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:00,910 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2025-01-09 21:43:00,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:43:00,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 21:43:00,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:00,911 INFO L225 Difference]: With dead ends: 53 [2025-01-09 21:43:00,911 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 21:43:00,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:43:00,911 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 29 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:00,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 194 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:43:00,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 21:43:00,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-01-09 21:43:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 49 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2025-01-09 21:43:00,914 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 19 [2025-01-09 21:43:00,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:00,914 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2025-01-09 21:43:00,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:00,914 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2025-01-09 21:43:00,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 21:43:00,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:00,915 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:00,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:43:00,915 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:00,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:00,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1245869796, now seen corresponding path program 1 times [2025-01-09 21:43:00,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:00,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300950763] [2025-01-09 21:43:00,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:00,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:00,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:43:00,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:43:00,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:00,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:43:01,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:01,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300950763] [2025-01-09 21:43:01,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300950763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:01,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:01,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:43:01,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106519750] [2025-01-09 21:43:01,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:01,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:43:01,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:01,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:43:01,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:43:01,086 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:01,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:01,196 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2025-01-09 21:43:01,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 21:43:01,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-09 21:43:01,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:01,197 INFO L225 Difference]: With dead ends: 63 [2025-01-09 21:43:01,198 INFO L226 Difference]: Without dead ends: 63 [2025-01-09 21:43:01,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 21:43:01,198 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 53 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:01,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 201 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:43:01,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-09 21:43:01,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2025-01-09 21:43:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 49 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-01-09 21:43:01,201 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 23 [2025-01-09 21:43:01,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:01,201 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-01-09 21:43:01,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:01,201 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-01-09 21:43:01,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 21:43:01,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:01,202 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:01,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:43:01,202 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:01,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:01,203 INFO L85 PathProgramCache]: Analyzing trace with hash -227665076, now seen corresponding path program 1 times [2025-01-09 21:43:01,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:01,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100627797] [2025-01-09 21:43:01,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:01,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:01,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:43:01,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:43:01,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:01,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:01,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:01,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:01,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100627797] [2025-01-09 21:43:01,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100627797] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:43:01,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170100229] [2025-01-09 21:43:01,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:01,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:01,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:43:01,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:43:01,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:43:02,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:43:02,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:43:02,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:02,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:02,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 21:43:02,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:43:02,080 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 21:43:02,177 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 21:43:02,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-01-09 21:43:02,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 21:43:02,278 INFO L349 Elim1Store]: treesize reduction 187, result has 16.9 percent of original size [2025-01-09 21:43:02,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 3474 treesize of output 1996 [2025-01-09 21:43:02,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:43:02,296 INFO L378 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 58 treesize of output 42 [2025-01-09 21:43:02,304 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:43:02,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 70 [2025-01-09 21:43:02,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:43:02,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:43:02,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 26 [2025-01-09 21:43:02,349 INFO L349 Elim1Store]: treesize reduction 767, result has 0.1 percent of original size [2025-01-09 21:43:02,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 12 new quantified variables, introduced 17 case distinctions, treesize of input 3360 treesize of output 2492 [2025-01-09 21:43:02,435 INFO L378 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 24 treesize of output 12 [2025-01-09 21:43:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:02,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:43:02,458 INFO L378 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 884 treesize of output 732 [2025-01-09 21:43:02,855 INFO L349 Elim1Store]: treesize reduction 98, result has 55.9 percent of original size [2025-01-09 21:43:02,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 1028 treesize of output 648 [2025-01-09 21:43:03,052 INFO L349 Elim1Store]: treesize reduction 225, result has 18.8 percent of original size [2025-01-09 21:43:03,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 18763 treesize of output 18706 [2025-01-09 21:43:03,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:03,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1308 treesize of output 1311 [2025-01-09 21:43:03,959 INFO L378 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 1286 treesize of output 1276 [2025-01-09 21:43:04,221 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 21:43:04,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 340 treesize of output 310 [2025-01-09 21:43:04,232 INFO L378 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 302 treesize of output 298 [2025-01-09 21:43:04,331 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-09 21:43:04,413 INFO L378 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 6 treesize of output 4 [2025-01-09 21:43:04,698 INFO L378 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 6 treesize of output 4 [2025-01-09 21:43:05,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:05,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 462 treesize of output 462 [2025-01-09 21:43:05,866 INFO L378 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 8 treesize of output 6 [2025-01-09 21:43:05,944 INFO L378 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 6 treesize of output 4 [2025-01-09 21:43:05,958 INFO L378 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 6 treesize of output 4 [2025-01-09 21:43:05,981 INFO L378 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 186 treesize of output 180 [2025-01-09 21:43:06,062 INFO L378 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 8 treesize of output 6 [2025-01-09 21:43:06,088 INFO L378 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 8 treesize of output 6 [2025-01-09 21:43:06,242 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:43:06,244 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:43:06,245 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:43:06,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:06,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 185 [2025-01-09 21:43:06,258 INFO L378 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 8 treesize of output 6 [2025-01-09 21:43:06,273 INFO L349 Elim1Store]: treesize reduction 10, result has 47.4 percent of original size [2025-01-09 21:43:06,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 23 [2025-01-09 21:43:06,314 INFO L349 Elim1Store]: treesize reduction 5, result has 88.9 percent of original size [2025-01-09 21:43:06,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 79 [2025-01-09 21:43:06,349 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:43:06,350 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:43:06,357 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-01-09 21:43:06,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 1 [2025-01-09 21:43:06,364 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:43:06,365 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:43:06,373 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-01-09 21:43:06,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 185 treesize of output 1 [2025-01-09 21:43:06,376 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:43:06,378 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:43:06,379 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:43:06,385 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 21:43:06,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 1 [2025-01-09 21:43:06,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:43:06,418 INFO L349 Elim1Store]: treesize reduction 45, result has 41.6 percent of original size [2025-01-09 21:43:06,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 140 treesize of output 141 [2025-01-09 21:43:06,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:43:06,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:06,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 34 [2025-01-09 21:43:06,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:06,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2025-01-09 21:43:06,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:06,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 74 treesize of output 152 [2025-01-09 21:43:07,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:43:07,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:43:07,610 INFO L349 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2025-01-09 21:43:07,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 1241 treesize of output 1 [2025-01-09 21:43:07,643 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:43:07,696 INFO L349 Elim1Store]: treesize reduction 89, result has 36.9 percent of original size [2025-01-09 21:43:07,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 1948 treesize of output 1881 [2025-01-09 21:43:07,723 INFO L378 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 8 treesize of output 6 [2025-01-09 21:43:07,737 INFO L378 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 190 treesize of output 188 [2025-01-09 21:43:07,745 INFO L378 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 188 treesize of output 186 [2025-01-09 21:43:07,755 INFO L378 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 186 treesize of output 184 [2025-01-09 21:43:07,774 INFO L378 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 184 treesize of output 182 [2025-01-09 21:43:07,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:43:07,809 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2025-01-09 21:43:07,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2025-01-09 21:43:07,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:07,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2025-01-09 21:43:07,922 INFO L378 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 6 treesize of output 4 [2025-01-09 21:43:07,934 INFO L378 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 6 treesize of output 4 [2025-01-09 21:43:07,943 INFO L378 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 6 treesize of output 4 [2025-01-09 21:43:08,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:08,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 115 treesize of output 725 [2025-01-09 21:43:42,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:43:42,822 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-01-09 21:43:42,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 1 [2025-01-09 21:43:42,828 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:43:42,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:43:42,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:42,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 1 [2025-01-09 21:43:42,837 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:43:42,838 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:43:42,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:43:42,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 65 [2025-01-09 21:43:42,844 INFO L378 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 8 treesize of output 6 [2025-01-09 21:43:42,848 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-09 21:43:42,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:43:42,859 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2025-01-09 21:43:42,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 295 treesize of output 1 [2025-01-09 21:43:42,863 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:43:42,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:43:42,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 49 [2025-01-09 21:43:42,868 INFO L378 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 8 treesize of output 6 [2025-01-09 21:43:42,872 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-09 21:43:42,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:42,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 74 [2025-01-09 21:43:42,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:42,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2025-01-09 21:43:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:43,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170100229] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:43:43,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:43:43,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2025-01-09 21:43:43,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880766806] [2025-01-09 21:43:43,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:43:43,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 21:43:43,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:43,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 21:43:43,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=319, Unknown=1, NotChecked=0, Total=380 [2025-01-09 21:43:43,021 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:43,875 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2025-01-09 21:43:43,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 21:43:43,876 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-09 21:43:43,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:43,877 INFO L225 Difference]: With dead ends: 83 [2025-01-09 21:43:43,877 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 21:43:43,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=418, Unknown=1, NotChecked=0, Total=506 [2025-01-09 21:43:43,878 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 47 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:43,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 477 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 21:43:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 21:43:43,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 60. [2025-01-09 21:43:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 58 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2025-01-09 21:43:43,890 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 28 [2025-01-09 21:43:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:43,890 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2025-01-09 21:43:43,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:43,890 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2025-01-09 21:43:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 21:43:43,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:43,890 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:43,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:43:44,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:44,093 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:44,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:44,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1071872056, now seen corresponding path program 1 times [2025-01-09 21:43:44,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:44,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263572855] [2025-01-09 21:43:44,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:44,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:44,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:43:44,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:43:44,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:44,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:45,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:45,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263572855] [2025-01-09 21:43:45,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263572855] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:43:45,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127561291] [2025-01-09 21:43:45,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:45,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:45,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:43:45,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:43:45,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:43:45,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:43:45,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:43:45,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:45,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:45,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-01-09 21:43:45,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:43:45,195 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 21:43:45,231 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 21:43:45,232 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:43:45,240 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 21:43:45,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-01-09 21:43:45,277 INFO L349 Elim1Store]: treesize reduction 211, result has 0.5 percent of original size [2025-01-09 21:43:45,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 2976 treesize of output 2231 [2025-01-09 21:43:45,301 INFO L349 Elim1Store]: treesize reduction 385, result has 0.3 percent of original size [2025-01-09 21:43:45,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 4105 treesize of output 3128 [2025-01-09 21:43:45,321 INFO L349 Elim1Store]: treesize reduction 385, result has 0.3 percent of original size [2025-01-09 21:43:45,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 4516 treesize of output 3391 [2025-01-09 21:43:45,352 INFO L349 Elim1Store]: treesize reduction 213, result has 0.5 percent of original size [2025-01-09 21:43:45,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 3136 treesize of output 2270 [2025-01-09 21:43:45,384 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-01-09 21:43:45,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 3356 treesize of output 2570 [2025-01-09 21:43:45,433 INFO L349 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2025-01-09 21:43:45,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 2176 treesize of output 1541 [2025-01-09 21:43:45,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:43:45,448 INFO L378 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 72 treesize of output 53 [2025-01-09 21:43:45,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-01-09 21:43:45,487 INFO L349 Elim1Store]: treesize reduction 385, result has 0.3 percent of original size [2025-01-09 21:43:45,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 4190 treesize of output 3169 [2025-01-09 21:43:45,517 INFO L349 Elim1Store]: treesize reduction 385, result has 0.3 percent of original size [2025-01-09 21:43:45,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 3782 treesize of output 2909 [2025-01-09 21:43:45,539 INFO L349 Elim1Store]: treesize reduction 211, result has 0.5 percent of original size [2025-01-09 21:43:45,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 2706 treesize of output 2043 [2025-01-09 21:43:45,558 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-01-09 21:43:45,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 3628 treesize of output 2756 [2025-01-09 21:43:45,579 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2025-01-09 21:43:45,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 2362 treesize of output 1 [2025-01-09 21:43:45,607 INFO L349 Elim1Store]: treesize reduction 213, result has 0.5 percent of original size [2025-01-09 21:43:45,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 3361 treesize of output 2421 [2025-01-09 21:43:45,628 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-01-09 21:43:45,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 3628 treesize of output 2756 [2025-01-09 21:43:45,654 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2025-01-09 21:43:45,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 2362 treesize of output 1 [2025-01-09 21:43:45,679 INFO L349 Elim1Store]: treesize reduction 213, result has 0.5 percent of original size [2025-01-09 21:43:45,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 3361 treesize of output 2421 [2025-01-09 21:43:45,712 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2025-01-09 21:43:45,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 2292 treesize of output 1 [2025-01-09 21:43:45,731 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2025-01-09 21:43:45,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 3558 treesize of output 2712 [2025-01-09 21:43:45,748 INFO L349 Elim1Store]: treesize reduction 213, result has 0.5 percent of original size [2025-01-09 21:43:45,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 3291 treesize of output 2377 [2025-01-09 21:43:45,773 INFO L349 Elim1Store]: treesize reduction 385, result has 0.3 percent of original size [2025-01-09 21:43:45,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 4385 treesize of output 3304 [2025-01-09 21:43:45,798 INFO L349 Elim1Store]: treesize reduction 385, result has 0.3 percent of original size [2025-01-09 21:43:45,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 3909 treesize of output 2986 [2025-01-09 21:43:45,816 INFO L349 Elim1Store]: treesize reduction 211, result has 0.5 percent of original size [2025-01-09 21:43:45,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 3140 treesize of output 2408 [2025-01-09 21:43:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:45,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:43:46,019 INFO L349 Elim1Store]: treesize reduction 1046, result has 54.2 percent of original size [2025-01-09 21:43:46,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 3493 treesize of output 4059 [2025-01-09 21:43:46,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:46,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4163 treesize of output 4443 [2025-01-09 21:43:46,085 INFO L378 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 1464 treesize of output 1247 [2025-01-09 21:43:46,256 INFO L378 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 134 treesize of output 4 [2025-01-09 21:43:46,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:46,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 892 treesize of output 892 [2025-01-09 21:43:46,511 INFO L378 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 220 treesize of output 3 [2025-01-09 21:43:46,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:46,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5089 treesize of output 4525 [2025-01-09 21:43:47,065 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse23 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse24 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse23 (store (select |c_#memory_$Pointer$#1.base| .cse23) .cse24 0)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse23 (store (select |c_#memory_$Pointer$#1.offset| .cse23) .cse24 0))) (.cse4 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (and (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_387 (Array Int Int))) (let ((.cse1 (let ((.cse2 (store .cse3 .cse4 v_ArrVal_386))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_388)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_387) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))))) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_388 (Array Int Int))) (let ((.cse6 (store .cse3 .cse4 v_ArrVal_386))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (= .cse5 (select (select (store .cse6 .cse5 v_ArrVal_388) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))))) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_387 (Array Int Int))) (let ((.cse12 (store .cse3 .cse4 v_ArrVal_386))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse8 (store .cse12 .cse7 v_ArrVal_388))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (= .cse7 (select (select (store .cse8 .cse9 v_ArrVal_387) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_384 (Array Int Int))) (not (let ((.cse10 (store (store .cse11 .cse4 v_ArrVal_384) .cse7 v_ArrVal_390))) (= (select (select .cse10 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ (select (select (store .cse10 .cse9 v_ArrVal_393) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) 4))))))))))) (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_384 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_388 (Array Int Int))) (= (select (select (let ((.cse14 (store .cse3 .cse4 v_ArrVal_386))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store .cse11 .cse4 v_ArrVal_384) .cse13 v_ArrVal_390) (select (select (store .cse14 .cse13 v_ArrVal_388) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_393))) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) (select (select (store .cse11 .cse4 (store (select .cse11 .cse4) (+ (select (select .cse11 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) 4) 0)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_387 (Array Int Int))) (let ((.cse19 (store .cse3 .cse4 v_ArrVal_386))) (let ((.cse17 (select (select .cse19 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse18 (store .cse19 .cse17 v_ArrVal_388))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse16 (select (select (store .cse18 .cse15 v_ArrVal_387) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse15 .cse16) (= .cse17 .cse16)))))))) (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_384 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_388 (Array Int Int))) (not (let ((.cse21 (store .cse3 .cse4 v_ArrVal_386))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse20 (store (store .cse11 .cse4 v_ArrVal_384) .cse22 v_ArrVal_390))) (= (select (select .cse20 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ (select (select (store .cse20 (select (select (store .cse21 .cse22 v_ArrVal_388) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_393) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) 4))))))))))) is different from false [2025-01-09 21:43:47,261 INFO L349 Elim1Store]: treesize reduction 15, result has 70.0 percent of original size [2025-01-09 21:43:47,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 2396 treesize of output 1293 [2025-01-09 21:43:47,312 INFO L349 Elim1Store]: treesize reduction 25, result has 53.7 percent of original size [2025-01-09 21:43:47,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 1361 treesize of output 1212 [2025-01-09 21:43:47,509 INFO L349 Elim1Store]: treesize reduction 56, result has 48.1 percent of original size [2025-01-09 21:43:47,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 17555 treesize of output 16264 [2025-01-09 21:43:47,886 INFO L349 Elim1Store]: treesize reduction 56, result has 48.1 percent of original size [2025-01-09 21:43:47,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 23909 treesize of output 23344 [2025-01-09 21:43:48,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:48,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21147 treesize of output 19153 [2025-01-09 21:43:48,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:48,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 8882 treesize of output 8847 [2025-01-09 21:43:48,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:48,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 8822 treesize of output 8767 [2025-01-09 21:43:48,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:48,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16323 treesize of output 16065 [2025-01-09 21:43:49,173 INFO L378 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 9287 treesize of output 9253 [2025-01-09 21:43:49,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:49,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 9253 treesize of output 9228 [2025-01-09 21:43:49,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:49,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 9203 treesize of output 9202 [2025-01-09 21:43:49,654 INFO L378 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 9177 treesize of output 9147 [2025-01-09 21:43:49,836 INFO L378 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 9147 treesize of output 9127 [2025-01-09 21:43:50,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:50,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 9127 treesize of output 9060 [2025-01-09 21:43:50,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:50,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9035 treesize of output 8996 [2025-01-09 21:43:50,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:50,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 8987 treesize of output 8952 [2025-01-09 21:43:50,778 INFO L378 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 8927 treesize of output 8855 [2025-01-09 21:43:50,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:50,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8855 treesize of output 8804 [2025-01-09 21:43:51,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:51,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 8795 treesize of output 8436 [2025-01-09 21:43:51,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:51,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 8411 treesize of output 8196 [2025-01-09 21:43:51,648 INFO L378 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 8171 treesize of output 8087 [2025-01-09 21:43:51,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:51,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 8087 treesize of output 7970 [2025-01-09 21:43:52,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:52,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7945 treesize of output 7774 [2025-01-09 21:43:52,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:52,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7749 treesize of output 7752 [2025-01-09 21:43:52,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:52,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7743 treesize of output 7746 [2025-01-09 21:43:52,861 INFO L378 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 7737 treesize of output 7713 [2025-01-09 21:43:53,095 INFO L378 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 7713 treesize of output 7647 [2025-01-09 21:43:53,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:53,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7647 treesize of output 7624 [2025-01-09 21:43:53,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:53,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7615 treesize of output 7552 [2025-01-09 21:43:53,859 INFO L378 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 7543 treesize of output 7399