./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/tree-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:34:34,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:34:34,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:34:34,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:34:34,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:34:34,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:34:34,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:34:34,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:34:34,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:34:34,492 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:34:34,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:34:34,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:34:34,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:34:34,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:34:34,493 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:34:34,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:34:34,493 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:34:34,493 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:34:34,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:34:34,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:34:34,493 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:34:34,493 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:34:34,493 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:34:34,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:34:34,493 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:34:34,494 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:34:34,494 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:34:34,494 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:34:34,494 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:34:34,494 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:34:34,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:34:34,494 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:34:34,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:34:34,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:34:34,494 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:34:34,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:34:34,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:34:34,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:34:34,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:34:34,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:34:34,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:34:34,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:34:34,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:34:34,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:34:34,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:34:34,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:34:34,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:34:34,496 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a [2025-01-09 22:34:34,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:34:34,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:34:34,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:34:34,725 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:34:34,725 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:34:34,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/tree-2.i [2025-01-09 22:34:35,847 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ad842b4c/c612ea96d3f845829a51f2ea64e80ceb/FLAGac8350ca8 [2025-01-09 22:34:36,091 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:34:36,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-2.i [2025-01-09 22:34:36,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ad842b4c/c612ea96d3f845829a51f2ea64e80ceb/FLAGac8350ca8 [2025-01-09 22:34:36,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ad842b4c/c612ea96d3f845829a51f2ea64e80ceb [2025-01-09 22:34:36,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:34:36,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:34:36,421 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:34:36,421 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:34:36,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:34:36,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:34:36" (1/1) ... [2025-01-09 22:34:36,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378fba94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:36, skipping insertion in model container [2025-01-09 22:34:36,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:34:36" (1/1) ... [2025-01-09 22:34:36,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:34:36,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:34:36,637 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:34:36,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:34:36,710 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:34:36,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:36 WrapperNode [2025-01-09 22:34:36,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:34:36,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:34:36,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:34:36,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:34:36,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:36" (1/1) ... [2025-01-09 22:34:36,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:36" (1/1) ... [2025-01-09 22:34:36,739 INFO L138 Inliner]: procedures = 122, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2025-01-09 22:34:36,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:34:36,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:34:36,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:34:36,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:34:36,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:36" (1/1) ... [2025-01-09 22:34:36,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:36" (1/1) ... [2025-01-09 22:34:36,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:36" (1/1) ... [2025-01-09 22:34:36,788 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2025-01-09 22:34:36,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:36" (1/1) ... [2025-01-09 22:34:36,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:36" (1/1) ... [2025-01-09 22:34:36,798 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:36" (1/1) ... [2025-01-09 22:34:36,799 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:36" (1/1) ... [2025-01-09 22:34:36,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:36" (1/1) ... [2025-01-09 22:34:36,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:36" (1/1) ... [2025-01-09 22:34:36,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:36" (1/1) ... [2025-01-09 22:34:36,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:34:36,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:34:36,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:34:36,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:34:36,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:36" (1/1) ... [2025-01-09 22:34:36,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:34:36,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:36,844 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 22:34:36,847 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 22:34:36,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:34:36,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:34:36,869 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-01-09 22:34:36,870 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-01-09 22:34:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:34:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:34:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:34:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:34:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:34:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:34:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:34:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:34:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:34:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:34:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:34:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:34:36,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:34:36,947 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:34:36,948 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:34:37,253 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2025-01-09 22:34:37,253 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:34:37,261 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:34:37,261 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-09 22:34:37,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:34:37 BoogieIcfgContainer [2025-01-09 22:34:37,262 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:34:37,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:34:37,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:34:37,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:34:37,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:34:36" (1/3) ... [2025-01-09 22:34:37,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee95c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:34:37, skipping insertion in model container [2025-01-09 22:34:37,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:36" (2/3) ... [2025-01-09 22:34:37,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee95c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:34:37, skipping insertion in model container [2025-01-09 22:34:37,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:34:37" (3/3) ... [2025-01-09 22:34:37,269 INFO L128 eAbstractionObserver]: Analyzing ICFG tree-2.i [2025-01-09 22:34:37,280 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:34:37,281 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree-2.i that has 2 procedures, 147 locations, 1 initial locations, 8 loop locations, and 63 error locations. [2025-01-09 22:34:37,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:34:37,328 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;@7df565dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:34:37,330 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2025-01-09 22:34:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 79 states have (on average 2.1012658227848102) internal successors, (166), 145 states have internal predecessors, (166), 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 22:34:37,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:34:37,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:37,336 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:34:37,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:37,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:37,340 INFO L85 PathProgramCache]: Analyzing trace with hash 39226931, now seen corresponding path program 1 times [2025-01-09 22:34:37,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:37,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574863147] [2025-01-09 22:34:37,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:37,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:37,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:34:37,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:34:37,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:37,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:37,428 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 22:34:37,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:37,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574863147] [2025-01-09 22:34:37,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574863147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:37,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:37,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:37,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352274830] [2025-01-09 22:34:37,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:37,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 22:34:37,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:37,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 22:34:37,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:34:37,453 INFO L87 Difference]: Start difference. First operand has 147 states, 79 states have (on average 2.1012658227848102) internal successors, (166), 145 states have internal predecessors, (166), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:37,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:37,465 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2025-01-09 22:34:37,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 22:34:37,467 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 22:34:37,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:37,470 INFO L225 Difference]: With dead ends: 144 [2025-01-09 22:34:37,471 INFO L226 Difference]: Without dead ends: 142 [2025-01-09 22:34:37,472 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 22:34:37,473 INFO L435 NwaCegarLoop]: 155 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, 155 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 22:34:37,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:37,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-09 22:34:37,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-01-09 22:34:37,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 140 states have internal predecessors, (150), 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 22:34:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2025-01-09 22:34:37,496 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 5 [2025-01-09 22:34:37,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:37,496 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2025-01-09 22:34:37,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2025-01-09 22:34:37,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:34:37,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:37,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:34:37,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:34:37,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:37,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:37,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1214959498, now seen corresponding path program 1 times [2025-01-09 22:34:37,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:37,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655331817] [2025-01-09 22:34:37,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:37,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:37,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:34:37,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:34:37,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:37,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:37,546 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 22:34:37,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:37,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655331817] [2025-01-09 22:34:37,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655331817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:37,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:37,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:34:37,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801424288] [2025-01-09 22:34:37,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:37,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:37,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:37,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:37,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:37,548 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 22:34:37,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:37,642 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2025-01-09 22:34:37,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:37,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-01-09 22:34:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:37,643 INFO L225 Difference]: With dead ends: 146 [2025-01-09 22:34:37,645 INFO L226 Difference]: Without dead ends: 146 [2025-01-09 22:34:37,645 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 22:34:37,646 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:37,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 267 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:37,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-09 22:34:37,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2025-01-09 22:34:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 79 states have (on average 1.9493670886075949) internal successors, (154), 143 states have internal predecessors, (154), 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 22:34:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2025-01-09 22:34:37,656 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 6 [2025-01-09 22:34:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:37,657 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2025-01-09 22:34:37,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 22:34:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2025-01-09 22:34:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:34:37,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:37,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:37,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:34:37,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:37,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:37,659 INFO L85 PathProgramCache]: Analyzing trace with hash -991052427, now seen corresponding path program 1 times [2025-01-09 22:34:37,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:37,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143033118] [2025-01-09 22:34:37,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:37,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:37,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:34:37,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:34:37,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:37,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:37,704 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 22:34:37,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:37,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143033118] [2025-01-09 22:34:37,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143033118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:37,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:37,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:37,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798560860] [2025-01-09 22:34:37,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:37,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:37,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:37,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:37,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:37,705 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 22:34:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:37,806 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2025-01-09 22:34:37,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:37,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2025-01-09 22:34:37,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:37,807 INFO L225 Difference]: With dead ends: 140 [2025-01-09 22:34:37,807 INFO L226 Difference]: Without dead ends: 140 [2025-01-09 22:34:37,807 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 22:34:37,808 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 36 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:37,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 178 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:37,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-09 22:34:37,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2025-01-09 22:34:37,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 81 states have (on average 1.8518518518518519) internal successors, (150), 137 states have internal predecessors, (150), 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 22:34:37,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2025-01-09 22:34:37,813 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 7 [2025-01-09 22:34:37,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:37,814 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2025-01-09 22:34:37,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 22:34:37,814 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2025-01-09 22:34:37,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:34:37,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:37,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:37,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:34:37,814 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:37,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:37,815 INFO L85 PathProgramCache]: Analyzing trace with hash -991052426, now seen corresponding path program 1 times [2025-01-09 22:34:37,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:37,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896472388] [2025-01-09 22:34:37,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:37,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:37,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:34:37,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:34:37,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:37,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:37,867 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 22:34:37,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:37,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896472388] [2025-01-09 22:34:37,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896472388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:37,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:37,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:37,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243730855] [2025-01-09 22:34:37,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:37,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:37,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:37,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:37,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:37,869 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 22:34:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:37,964 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2025-01-09 22:34:37,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:37,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2025-01-09 22:34:37,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:37,966 INFO L225 Difference]: With dead ends: 160 [2025-01-09 22:34:37,966 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 22:34:37,966 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 22:34:37,966 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 36 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:37,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 200 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 22:34:37,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 151. [2025-01-09 22:34:37,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 96 states have (on average 1.7604166666666667) internal successors, (169), 149 states have internal predecessors, (169), 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 22:34:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 172 transitions. [2025-01-09 22:34:37,972 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 172 transitions. Word has length 7 [2025-01-09 22:34:37,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:37,972 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 172 transitions. [2025-01-09 22:34:37,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 22:34:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 172 transitions. [2025-01-09 22:34:37,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 22:34:37,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:37,973 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:37,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:34:37,973 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:37,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:37,973 INFO L85 PathProgramCache]: Analyzing trace with hash -653670325, now seen corresponding path program 1 times [2025-01-09 22:34:37,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:37,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695914310] [2025-01-09 22:34:37,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:37,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:37,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:34:37,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:34:37,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:37,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:38,008 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 22:34:38,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:38,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695914310] [2025-01-09 22:34:38,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695914310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:38,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:38,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:38,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628821358] [2025-01-09 22:34:38,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:38,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:38,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:38,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:38,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:38,010 INFO L87 Difference]: Start difference. First operand 151 states and 172 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 22:34:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:38,103 INFO L93 Difference]: Finished difference Result 229 states and 259 transitions. [2025-01-09 22:34:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:38,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 22:34:38,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:38,104 INFO L225 Difference]: With dead ends: 229 [2025-01-09 22:34:38,105 INFO L226 Difference]: Without dead ends: 228 [2025-01-09 22:34:38,105 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 22:34:38,105 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 79 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:38,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 195 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:38,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-01-09 22:34:38,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 153. [2025-01-09 22:34:38,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.7448979591836735) internal successors, (171), 151 states have internal predecessors, (171), 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 22:34:38,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 174 transitions. [2025-01-09 22:34:38,113 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 174 transitions. Word has length 8 [2025-01-09 22:34:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:38,113 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 174 transitions. [2025-01-09 22:34:38,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 22:34:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2025-01-09 22:34:38,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:34:38,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:38,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:38,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:34:38,114 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:38,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:38,114 INFO L85 PathProgramCache]: Analyzing trace with hash -837655920, now seen corresponding path program 1 times [2025-01-09 22:34:38,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:38,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923804546] [2025-01-09 22:34:38,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:38,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:38,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:34:38,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:34:38,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:38,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:38,152 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 22:34:38,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:38,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923804546] [2025-01-09 22:34:38,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923804546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:38,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:38,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:34:38,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511939302] [2025-01-09 22:34:38,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:38,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:38,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:38,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:38,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:38,154 INFO L87 Difference]: Start difference. First operand 153 states and 174 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:38,167 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2025-01-09 22:34:38,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:38,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 22:34:38,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:38,168 INFO L225 Difference]: With dead ends: 158 [2025-01-09 22:34:38,168 INFO L226 Difference]: Without dead ends: 158 [2025-01-09 22:34:38,168 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 22:34:38,169 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:38,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 271 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-01-09 22:34:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-01-09 22:34:38,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 103 states have (on average 1.7087378640776698) internal successors, (176), 156 states have internal predecessors, (176), 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 22:34:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 179 transitions. [2025-01-09 22:34:38,173 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 179 transitions. Word has length 10 [2025-01-09 22:34:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:38,174 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 179 transitions. [2025-01-09 22:34:38,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 179 transitions. [2025-01-09 22:34:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:34:38,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:38,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:38,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:34:38,174 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:38,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:38,175 INFO L85 PathProgramCache]: Analyzing trace with hash 780048484, now seen corresponding path program 1 times [2025-01-09 22:34:38,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:38,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063619527] [2025-01-09 22:34:38,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:38,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:38,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:34:38,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:34:38,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:38,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:38,258 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 22:34:38,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:38,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063619527] [2025-01-09 22:34:38,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063619527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:38,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:38,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:34:38,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800579098] [2025-01-09 22:34:38,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:38,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:34:38,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:38,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:34:38,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:34:38,261 INFO L87 Difference]: Start difference. First operand 158 states and 179 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 22:34:38,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:38,284 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2025-01-09 22:34:38,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:34:38,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 12 [2025-01-09 22:34:38,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:38,286 INFO L225 Difference]: With dead ends: 158 [2025-01-09 22:34:38,286 INFO L226 Difference]: Without dead ends: 155 [2025-01-09 22:34:38,286 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 22:34:38,286 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 5 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:38,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 541 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-09 22:34:38,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-01-09 22:34:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 100 states have (on average 1.72) internal successors, (172), 153 states have internal predecessors, (172), 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 22:34:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 175 transitions. [2025-01-09 22:34:38,299 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 175 transitions. Word has length 12 [2025-01-09 22:34:38,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:38,299 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 175 transitions. [2025-01-09 22:34:38,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 22:34:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 175 transitions. [2025-01-09 22:34:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:34:38,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:38,299 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:38,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:34:38,299 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:38,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:38,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1703570491, now seen corresponding path program 1 times [2025-01-09 22:34:38,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:38,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938582645] [2025-01-09 22:34:38,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:38,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:38,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:34:38,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:34:38,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:38,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:38,368 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 22:34:38,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:38,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938582645] [2025-01-09 22:34:38,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938582645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:38,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:38,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:34:38,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989222952] [2025-01-09 22:34:38,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:38,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:38,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:38,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:38,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:38,377 INFO L87 Difference]: Start difference. First operand 155 states and 175 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:38,435 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2025-01-09 22:34:38,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:38,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 22:34:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:38,437 INFO L225 Difference]: With dead ends: 163 [2025-01-09 22:34:38,441 INFO L226 Difference]: Without dead ends: 163 [2025-01-09 22:34:38,442 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 22:34:38,442 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 29 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:38,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 239 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:38,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-01-09 22:34:38,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2025-01-09 22:34:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 100 states have (on average 1.71) internal successors, (171), 153 states have internal predecessors, (171), 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 22:34:38,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2025-01-09 22:34:38,448 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 18 [2025-01-09 22:34:38,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:38,449 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2025-01-09 22:34:38,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:38,449 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2025-01-09 22:34:38,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:34:38,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:38,449 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:38,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:34:38,449 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:38,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:38,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1023003264, now seen corresponding path program 1 times [2025-01-09 22:34:38,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:38,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570067454] [2025-01-09 22:34:38,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:38,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:38,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:34:38,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:34:38,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:38,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:38,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:38,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570067454] [2025-01-09 22:34:38,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570067454] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:38,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547899959] [2025-01-09 22:34:38,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:38,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:38,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:38,613 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 22:34:38,615 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 22:34:38,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:34:38,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:34:38,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:38,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:38,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 22:34:38,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:38,760 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 22:34:38,798 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:34:38,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 22:34:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:38,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:38,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547899959] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:38,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:38,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2025-01-09 22:34:38,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246847417] [2025-01-09 22:34:38,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:38,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:34:38,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:38,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:34:38,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:34:38,869 INFO L87 Difference]: Start difference. First operand 155 states and 174 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 22:34:38,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:38,998 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2025-01-09 22:34:38,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:34:38,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 20 [2025-01-09 22:34:38,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:38,999 INFO L225 Difference]: With dead ends: 154 [2025-01-09 22:34:38,999 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 22:34:38,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:34:39,000 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 94 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:39,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 234 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:39,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 22:34:39,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-01-09 22:34:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 100 states have (on average 1.7) internal successors, (170), 152 states have internal predecessors, (170), 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 22:34:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 173 transitions. [2025-01-09 22:34:39,004 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 173 transitions. Word has length 20 [2025-01-09 22:34:39,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:39,004 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 173 transitions. [2025-01-09 22:34:39,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 22:34:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2025-01-09 22:34:39,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:34:39,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:39,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:39,011 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 22:34:39,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:39,209 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:39,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:39,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1023003265, now seen corresponding path program 1 times [2025-01-09 22:34:39,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:39,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469296491] [2025-01-09 22:34:39,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:39,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:39,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:34:39,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:34:39,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:39,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:39,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:39,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469296491] [2025-01-09 22:34:39,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469296491] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:39,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955605913] [2025-01-09 22:34:39,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:39,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:39,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:39,462 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 22:34:39,464 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 22:34:39,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:34:39,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:34:39,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:39,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:39,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 22:34:39,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:39,533 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 22:34:39,537 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 8 treesize of output 1 [2025-01-09 22:34:39,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:39,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:34:39,602 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:39,602 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 11 treesize of output 11 [2025-01-09 22:34:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:39,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:39,877 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:39,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955605913] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:39,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:39,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2025-01-09 22:34:39,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35701324] [2025-01-09 22:34:39,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:39,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:34:39,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:39,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:34:39,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:39,878 INFO L87 Difference]: Start difference. First operand 154 states and 173 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 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 22:34:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:40,193 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2025-01-09 22:34:40,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:34:40,194 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 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 20 [2025-01-09 22:34:40,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:40,194 INFO L225 Difference]: With dead ends: 161 [2025-01-09 22:34:40,194 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 22:34:40,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:34:40,195 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 90 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:40,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 526 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:34:40,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 22:34:40,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2025-01-09 22:34:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 100 states have (on average 1.69) internal successors, (169), 151 states have internal predecessors, (169), 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 22:34:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2025-01-09 22:34:40,198 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 20 [2025-01-09 22:34:40,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:40,198 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2025-01-09 22:34:40,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 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 22:34:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2025-01-09 22:34:40,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:34:40,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:40,199 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:40,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:34:40,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:40,399 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:40,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash -554070622, now seen corresponding path program 1 times [2025-01-09 22:34:40,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:40,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856958391] [2025-01-09 22:34:40,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:40,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:40,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:34:40,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:34:40,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:40,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:40,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:34:40,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:40,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856958391] [2025-01-09 22:34:40,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856958391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:40,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:40,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:34:40,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183225423] [2025-01-09 22:34:40,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:40,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:34:40,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:40,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:34:40,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:34:40,501 INFO L87 Difference]: Start difference. First operand 153 states and 172 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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 22:34:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:40,664 INFO L93 Difference]: Finished difference Result 152 states and 170 transitions. [2025-01-09 22:34:40,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:34:40,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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 20 [2025-01-09 22:34:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:40,669 INFO L225 Difference]: With dead ends: 152 [2025-01-09 22:34:40,669 INFO L226 Difference]: Without dead ends: 152 [2025-01-09 22:34:40,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:34:40,670 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 4 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:40,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 365 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:40,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-09 22:34:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-01-09 22:34:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 100 states have (on average 1.67) internal successors, (167), 150 states have internal predecessors, (167), 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 22:34:40,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 170 transitions. [2025-01-09 22:34:40,676 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 170 transitions. Word has length 20 [2025-01-09 22:34:40,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:40,677 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 170 transitions. [2025-01-09 22:34:40,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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 22:34:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 170 transitions. [2025-01-09 22:34:40,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:34:40,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:40,677 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:40,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:34:40,677 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:40,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:40,678 INFO L85 PathProgramCache]: Analyzing trace with hash -554070621, now seen corresponding path program 1 times [2025-01-09 22:34:40,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:40,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141259283] [2025-01-09 22:34:40,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:40,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:40,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:34:40,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:34:40,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:40,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:34:40,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:40,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141259283] [2025-01-09 22:34:40,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141259283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:40,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:40,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:34:40,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415365326] [2025-01-09 22:34:40,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:40,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:34:40,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:40,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:34:40,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:34:40,851 INFO L87 Difference]: Start difference. First operand 152 states and 170 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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 22:34:40,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:40,965 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2025-01-09 22:34:40,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:34:40,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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 20 [2025-01-09 22:34:40,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:40,967 INFO L225 Difference]: With dead ends: 151 [2025-01-09 22:34:40,967 INFO L226 Difference]: Without dead ends: 151 [2025-01-09 22:34:40,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:34:40,967 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 3 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:40,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 378 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:40,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-09 22:34:40,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-01-09 22:34:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.65) internal successors, (165), 149 states have internal predecessors, (165), 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 22:34:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2025-01-09 22:34:40,971 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 20 [2025-01-09 22:34:40,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:40,971 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2025-01-09 22:34:40,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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 22:34:40,971 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2025-01-09 22:34:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:34:40,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:40,972 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 22:34:40,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:34:40,972 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:40,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:40,972 INFO L85 PathProgramCache]: Analyzing trace with hash -758538740, now seen corresponding path program 1 times [2025-01-09 22:34:40,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:40,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362950112] [2025-01-09 22:34:40,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:40,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:40,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:34:40,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:34:40,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:40,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:41,191 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 22:34:41,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:41,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362950112] [2025-01-09 22:34:41,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362950112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:41,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:41,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:34:41,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882735794] [2025-01-09 22:34:41,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:41,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:34:41,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:41,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:34:41,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:34:41,192 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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 22:34:41,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:41,430 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2025-01-09 22:34:41,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:34:41,431 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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 23 [2025-01-09 22:34:41,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:41,431 INFO L225 Difference]: With dead ends: 152 [2025-01-09 22:34:41,431 INFO L226 Difference]: Without dead ends: 152 [2025-01-09 22:34:41,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:34:41,432 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 37 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:41,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 474 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:34:41,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-09 22:34:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2025-01-09 22:34:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.64) internal successors, (164), 149 states have internal predecessors, (164), 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 22:34:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 167 transitions. [2025-01-09 22:34:41,436 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 167 transitions. Word has length 23 [2025-01-09 22:34:41,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:41,436 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 167 transitions. [2025-01-09 22:34:41,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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 22:34:41,436 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 167 transitions. [2025-01-09 22:34:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:34:41,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:41,437 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 22:34:41,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:34:41,437 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:41,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:41,438 INFO L85 PathProgramCache]: Analyzing trace with hash -758538739, now seen corresponding path program 1 times [2025-01-09 22:34:41,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:41,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348317770] [2025-01-09 22:34:41,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:41,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:41,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:34:41,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:34:41,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:41,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:41,691 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 22:34:41,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:41,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348317770] [2025-01-09 22:34:41,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348317770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:41,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:41,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:34:41,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836932857] [2025-01-09 22:34:41,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:41,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:34:41,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:41,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:34:41,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:34:41,694 INFO L87 Difference]: Start difference. First operand 151 states and 167 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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 22:34:41,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:41,936 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2025-01-09 22:34:41,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:34:41,937 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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 23 [2025-01-09 22:34:41,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:41,937 INFO L225 Difference]: With dead ends: 151 [2025-01-09 22:34:41,938 INFO L226 Difference]: Without dead ends: 151 [2025-01-09 22:34:41,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:34:41,938 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 35 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:41,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 570 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:34:41,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-09 22:34:41,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-01-09 22:34:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.63) internal successors, (163), 149 states have internal predecessors, (163), 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 22:34:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 166 transitions. [2025-01-09 22:34:41,941 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 166 transitions. Word has length 23 [2025-01-09 22:34:41,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:41,941 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 166 transitions. [2025-01-09 22:34:41,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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 22:34:41,941 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 166 transitions. [2025-01-09 22:34:41,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:34:41,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:41,942 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] [2025-01-09 22:34:41,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:34:41,942 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:41,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:41,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1804609399, now seen corresponding path program 1 times [2025-01-09 22:34:41,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:41,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62763948] [2025-01-09 22:34:41,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:41,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:41,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:34:41,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:34:41,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:41,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:42,113 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 22:34:42,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:42,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62763948] [2025-01-09 22:34:42,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62763948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:42,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:42,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:34:42,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069009113] [2025-01-09 22:34:42,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:42,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:34:42,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:42,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:34:42,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:42,115 INFO L87 Difference]: Start difference. First operand 151 states and 166 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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 22:34:42,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:42,384 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2025-01-09 22:34:42,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:34:42,385 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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 26 [2025-01-09 22:34:42,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:42,385 INFO L225 Difference]: With dead ends: 152 [2025-01-09 22:34:42,385 INFO L226 Difference]: Without dead ends: 152 [2025-01-09 22:34:42,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:34:42,386 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 40 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:42,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 618 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:34:42,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-09 22:34:42,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2025-01-09 22:34:42,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.62) internal successors, (162), 149 states have internal predecessors, (162), 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 22:34:42,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2025-01-09 22:34:42,389 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 26 [2025-01-09 22:34:42,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:42,389 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2025-01-09 22:34:42,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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 22:34:42,389 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2025-01-09 22:34:42,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:34:42,389 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:42,389 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] [2025-01-09 22:34:42,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:34:42,389 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:42,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:42,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1804609398, now seen corresponding path program 1 times [2025-01-09 22:34:42,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:42,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893271567] [2025-01-09 22:34:42,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:42,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:42,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:34:42,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:34:42,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:42,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:42,699 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 22:34:42,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:42,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893271567] [2025-01-09 22:34:42,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893271567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:42,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:42,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:34:42,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187932694] [2025-01-09 22:34:42,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:42,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:34:42,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:42,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:34:42,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:42,701 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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 22:34:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:42,954 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2025-01-09 22:34:42,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:34:42,954 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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 26 [2025-01-09 22:34:42,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:42,955 INFO L225 Difference]: With dead ends: 151 [2025-01-09 22:34:42,955 INFO L226 Difference]: Without dead ends: 151 [2025-01-09 22:34:42,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:34:42,955 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 38 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:42,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 572 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:34:42,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-09 22:34:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-01-09 22:34:42,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.61) internal successors, (161), 149 states have internal predecessors, (161), 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 22:34:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2025-01-09 22:34:42,958 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 26 [2025-01-09 22:34:42,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:42,958 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2025-01-09 22:34:42,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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 22:34:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2025-01-09 22:34:42,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:34:42,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:42,959 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, 1] [2025-01-09 22:34:42,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:34:42,959 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:42,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:42,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1012904941, now seen corresponding path program 1 times [2025-01-09 22:34:42,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:42,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255038477] [2025-01-09 22:34:42,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:42,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:42,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:34:42,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:34:42,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:42,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:43,172 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 22:34:43,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:43,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255038477] [2025-01-09 22:34:43,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255038477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:43,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:43,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:34:43,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128183098] [2025-01-09 22:34:43,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:43,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:34:43,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:43,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:34:43,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:34:43,174 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:43,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:43,439 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2025-01-09 22:34:43,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:34:43,440 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-09 22:34:43,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:43,440 INFO L225 Difference]: With dead ends: 152 [2025-01-09 22:34:43,441 INFO L226 Difference]: Without dead ends: 152 [2025-01-09 22:34:43,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:34:43,441 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 45 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:43,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 621 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:34:43,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-09 22:34:43,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2025-01-09 22:34:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.6) internal successors, (160), 149 states have internal predecessors, (160), 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 22:34:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2025-01-09 22:34:43,443 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 29 [2025-01-09 22:34:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:43,444 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2025-01-09 22:34:43,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2025-01-09 22:34:43,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:34:43,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:43,444 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, 1] [2025-01-09 22:34:43,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:34:43,447 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:43,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:43,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1012904940, now seen corresponding path program 1 times [2025-01-09 22:34:43,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:43,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632136760] [2025-01-09 22:34:43,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:43,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:43,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:34:43,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:34:43,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:43,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:43,943 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 22:34:43,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:43,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632136760] [2025-01-09 22:34:43,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632136760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:43,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:43,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:34:43,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102906511] [2025-01-09 22:34:43,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:43,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:34:43,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:43,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:34:43,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:34:43,945 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:44,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:44,181 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2025-01-09 22:34:44,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:34:44,181 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-09 22:34:44,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:44,182 INFO L225 Difference]: With dead ends: 151 [2025-01-09 22:34:44,182 INFO L226 Difference]: Without dead ends: 151 [2025-01-09 22:34:44,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:34:44,183 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 42 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:44,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 497 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:34:44,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-09 22:34:44,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-01-09 22:34:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.59) internal successors, (159), 149 states have internal predecessors, (159), 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 22:34:44,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2025-01-09 22:34:44,188 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 29 [2025-01-09 22:34:44,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:44,188 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2025-01-09 22:34:44,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2025-01-09 22:34:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:34:44,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:44,189 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2025-01-09 22:34:44,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:34:44,189 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:44,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:44,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1421850289, now seen corresponding path program 1 times [2025-01-09 22:34:44,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:44,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750355001] [2025-01-09 22:34:44,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:44,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:44,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:34:44,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:34:44,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:44,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:44,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:44,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750355001] [2025-01-09 22:34:44,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750355001] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:44,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68137798] [2025-01-09 22:34:44,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:44,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:44,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:44,645 INFO L229 MonitoredProcess]: Starting monitored process 4 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 22:34:44,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:34:44,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:34:44,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:34:44,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:44,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:44,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 22:34:44,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:44,760 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 22:34:44,792 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 22:34:44,798 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 22:34:44,834 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 23 treesize of output 11 [2025-01-09 22:34:44,838 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 23 treesize of output 11 [2025-01-09 22:34:44,871 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:44,871 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 11 treesize of output 11 [2025-01-09 22:34:44,894 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 23 treesize of output 11 [2025-01-09 22:34:44,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2025-01-09 22:34:44,968 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:34:44,968 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 1 case distinctions, treesize of input 48 treesize of output 43 [2025-01-09 22:34:44,972 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 24 treesize of output 11 [2025-01-09 22:34:45,019 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:34:45,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 1 case distinctions, treesize of input 48 treesize of output 43 [2025-01-09 22:34:45,025 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 24 treesize of output 11 [2025-01-09 22:34:45,080 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:34:45,080 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 1 case distinctions, treesize of input 48 treesize of output 43 [2025-01-09 22:34:45,083 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 24 treesize of output 11 [2025-01-09 22:34:45,135 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:34:45,135 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 1 case distinctions, treesize of input 48 treesize of output 43 [2025-01-09 22:34:45,139 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 24 treesize of output 11 [2025-01-09 22:34:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:45,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:45,175 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_604 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem15#1.base| v_ArrVal_604) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_603 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_#t~mem15#1.base| v_ArrVal_603) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse0) 0)))) is different from false [2025-01-09 22:34:45,228 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_602) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_601) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_603) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_601))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_604)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse0) 0)))) is different from false [2025-01-09 22:34:45,294 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_599))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_600) .cse0 v_ArrVal_602) (select (select (store .cse1 .cse0 v_ArrVal_601) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_603))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_599))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_601)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_604)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse2) 0)))) is different from false [2025-01-09 22:34:45,307 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (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|)) (.cse3 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_599))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_601)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_604)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_599))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_600) .cse4 v_ArrVal_602) (select (select (store .cse5 .cse4 v_ArrVal_601) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_603))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse3) 0)))) is different from false [2025-01-09 22:34:45,327 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_597))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse2 (store .cse3 .cse0 v_ArrVal_599))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_598) .cse0 v_ArrVal_600) .cse1 v_ArrVal_602) (select (select (store .cse2 .cse1 v_ArrVal_601) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_603))))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (= (select (select (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_597))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_599)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_601)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_604)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse4) 0)))) is different from false [2025-01-09 22:34:45,342 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (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|)) (.cse5 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_597))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse3 (store .cse4 .cse1 v_ArrVal_599))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_598) .cse1 v_ArrVal_600) .cse2 v_ArrVal_602) (select (select (store .cse3 .cse2 v_ArrVal_601) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_603))))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_597))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_599)))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_601)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_604)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse5) 0)))) is different from false [2025-01-09 22:34:45,372 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_~node~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset| |c_ULTIMATE.start_create_tree_#t~malloc11#1.base|))) (.cse4 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store .cse3 |c_ULTIMATE.start_create_tree_#t~malloc11#1.base| v_ArrVal_597))) (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_599)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_601)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_604)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (|ULTIMATE.start_create_tree_#t~malloc11#1.offset| Int) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (= 0 (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_create_tree_#t~malloc11#1.base| v_ArrVal_597))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_599))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_~node~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset| |ULTIMATE.start_create_tree_#t~malloc11#1.offset|)) |c_ULTIMATE.start_create_tree_#t~malloc11#1.base| v_ArrVal_598) .cse5 v_ArrVal_600) .cse6 v_ArrVal_602) (select (select (store .cse7 .cse6 v_ArrVal_601) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_603))))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse4))))) is different from false [2025-01-09 22:34:52,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:52,619 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 226 treesize of output 111 [2025-01-09 22:34:52,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:52,633 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 33048 treesize of output 25598 [2025-01-09 22:34:52,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:52,710 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 190 treesize of output 174 [2025-01-09 22:34:52,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:52,716 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 174 treesize of output 154 [2025-01-09 22:34:52,719 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 154 treesize of output 142 [2025-01-09 22:34:52,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:52,725 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 142 treesize of output 126 [2025-01-09 22:34:52,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:52,768 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 226 treesize of output 237 [2025-01-09 22:34:52,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:52,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 111 [2025-01-09 22:34:52,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 2486 treesize of output 1940 [2025-01-09 22:34:52,796 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:52,799 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 485 treesize of output 449 [2025-01-09 22:34:52,805 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 70 treesize of output 66 [2025-01-09 22:34:52,808 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 66 treesize of output 62 [2025-01-09 22:34:52,811 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 62 treesize of output 58 [2025-01-09 22:34:52,814 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 58 treesize of output 54 [2025-01-09 22:34:52,818 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 54 treesize of output 50 [2025-01-09 22:34:52,822 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 50 treesize of output 46 [2025-01-09 22:34:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:52,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68137798] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:52,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:52,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 18] total 34 [2025-01-09 22:34:52,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336001454] [2025-01-09 22:34:52,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:52,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 22:34:52,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:52,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 22:34:52,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=577, Unknown=29, NotChecked=392, Total=1122 [2025-01-09 22:34:52,893 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 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 22:34:53,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:53,711 INFO L93 Difference]: Finished difference Result 176 states and 188 transitions. [2025-01-09 22:34:53,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:34:53,711 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 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 34 [2025-01-09 22:34:53,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:53,711 INFO L225 Difference]: With dead ends: 176 [2025-01-09 22:34:53,711 INFO L226 Difference]: Without dead ends: 176 [2025-01-09 22:34:53,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=215, Invalid=974, Unknown=29, NotChecked=504, Total=1722 [2025-01-09 22:34:53,712 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 37 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 512 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:53,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1879 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 581 Invalid, 0 Unknown, 512 Unchecked, 0.6s Time] [2025-01-09 22:34:53,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-09 22:34:53,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2025-01-09 22:34:53,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 124 states have (on average 1.4838709677419355) internal successors, (184), 173 states have internal predecessors, (184), 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 22:34:53,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 187 transitions. [2025-01-09 22:34:53,718 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 187 transitions. Word has length 34 [2025-01-09 22:34:53,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:53,718 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 187 transitions. [2025-01-09 22:34:53,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 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 22:34:53,719 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 187 transitions. [2025-01-09 22:34:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:34:53,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:53,720 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:53,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:34:53,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:53,924 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:53,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:53,925 INFO L85 PathProgramCache]: Analyzing trace with hash 599884210, now seen corresponding path program 1 times [2025-01-09 22:34:53,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:53,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205869523] [2025-01-09 22:34:53,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:53,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:53,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:34:53,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:34:53,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:53,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:53,984 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 22:34:53,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:53,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205869523] [2025-01-09 22:34:53,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205869523] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:53,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77414473] [2025-01-09 22:34:53,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:53,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:53,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:53,987 INFO L229 MonitoredProcess]: Starting monitored process 5 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 22:34:53,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 22:34:54,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:34:54,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:34:54,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:54,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:54,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 22:34:54,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:54,107 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 22:34:54,107 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:34:54,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77414473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:54,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:34:54,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2025-01-09 22:34:54,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540072766] [2025-01-09 22:34:54,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:54,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:34:54,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:54,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:34:54,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:34:54,108 INFO L87 Difference]: Start difference. First operand 175 states and 187 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 22:34:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:54,173 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2025-01-09 22:34:54,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:34:54,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 36 [2025-01-09 22:34:54,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:54,174 INFO L225 Difference]: With dead ends: 175 [2025-01-09 22:34:54,174 INFO L226 Difference]: Without dead ends: 175 [2025-01-09 22:34:54,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:34:54,175 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 71 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:54,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 525 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:54,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-09 22:34:54,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-01-09 22:34:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 124 states have (on average 1.467741935483871) internal successors, (182), 173 states have internal predecessors, (182), 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 22:34:54,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 185 transitions. [2025-01-09 22:34:54,181 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 185 transitions. Word has length 36 [2025-01-09 22:34:54,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:54,181 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 185 transitions. [2025-01-09 22:34:54,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 22:34:54,181 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 185 transitions. [2025-01-09 22:34:54,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:34:54,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:54,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:54,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 22:34:54,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:54,382 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:54,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:54,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2052933195, now seen corresponding path program 1 times [2025-01-09 22:34:54,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:54,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872074186] [2025-01-09 22:34:54,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:54,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:54,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:34:54,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:34:54,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:54,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:54,450 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 22:34:54,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:54,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872074186] [2025-01-09 22:34:54,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872074186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:54,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:54,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:34:54,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597266747] [2025-01-09 22:34:54,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:54,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:34:54,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:54,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:34:54,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:34:54,452 INFO L87 Difference]: Start difference. First operand 175 states and 185 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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 22:34:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:54,554 INFO L93 Difference]: Finished difference Result 189 states and 209 transitions. [2025-01-09 22:34:54,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:34:54,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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 40 [2025-01-09 22:34:54,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:54,556 INFO L225 Difference]: With dead ends: 189 [2025-01-09 22:34:54,556 INFO L226 Difference]: Without dead ends: 189 [2025-01-09 22:34:54,556 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 22:34:54,556 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 111 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:54,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 541 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:54,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-01-09 22:34:54,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 175. [2025-01-09 22:34:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 125 states have (on average 1.456) internal successors, (182), 173 states have internal predecessors, (182), 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 22:34:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 184 transitions. [2025-01-09 22:34:54,560 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 184 transitions. Word has length 40 [2025-01-09 22:34:54,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:54,560 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 184 transitions. [2025-01-09 22:34:54,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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 22:34:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 184 transitions. [2025-01-09 22:34:54,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:34:54,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:54,561 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:54,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 22:34:54,561 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:54,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:54,562 INFO L85 PathProgramCache]: Analyzing trace with hash -210918782, now seen corresponding path program 1 times [2025-01-09 22:34:54,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:54,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840238763] [2025-01-09 22:34:54,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:54,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:54,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:34:54,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:34:54,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:54,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:54,634 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 22:34:54,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:54,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840238763] [2025-01-09 22:34:54,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840238763] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:54,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150672578] [2025-01-09 22:34:54,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:54,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:54,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:54,636 INFO L229 MonitoredProcess]: Starting monitored process 6 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 22:34:54,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:34:54,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:34:54,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:34:54,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:54,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:54,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 22:34:54,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:54,786 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 22:34:54,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:54,813 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:34:54,813 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 12 treesize of output 11 [2025-01-09 22:34:54,818 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 22:34:54,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150672578] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:54,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:54,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2025-01-09 22:34:54,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428045881] [2025-01-09 22:34:54,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:54,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:34:54,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:54,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:34:54,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:34:54,819 INFO L87 Difference]: Start difference. First operand 175 states and 184 transitions. Second operand has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 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 22:34:54,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:54,978 INFO L93 Difference]: Finished difference Result 173 states and 183 transitions. [2025-01-09 22:34:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:34:54,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 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 39 [2025-01-09 22:34:54,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:54,982 INFO L225 Difference]: With dead ends: 173 [2025-01-09 22:34:54,982 INFO L226 Difference]: Without dead ends: 173 [2025-01-09 22:34:54,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:54,983 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 58 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:54,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 412 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:54,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-09 22:34:54,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-01-09 22:34:54,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 126 states have (on average 1.4365079365079365) internal successors, (181), 171 states have internal predecessors, (181), 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 22:34:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2025-01-09 22:34:54,987 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 39 [2025-01-09 22:34:54,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:54,987 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2025-01-09 22:34:54,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 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 22:34:54,987 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2025-01-09 22:34:54,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:34:54,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:54,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:54,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 22:34:55,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 22:34:55,188 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:55,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:55,189 INFO L85 PathProgramCache]: Analyzing trace with hash -210918781, now seen corresponding path program 1 times [2025-01-09 22:34:55,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:55,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942526707] [2025-01-09 22:34:55,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:55,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:55,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:34:55,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:34:55,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:55,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:55,323 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 22:34:55,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:55,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942526707] [2025-01-09 22:34:55,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942526707] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:55,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348750716] [2025-01-09 22:34:55,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:55,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:55,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:55,329 INFO L229 MonitoredProcess]: Starting monitored process 7 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 22:34:55,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:34:55,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:34:55,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:34:55,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:55,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:55,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 22:34:55,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:55,570 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 22:34:55,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:55,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:55,643 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 19 treesize of output 23 [2025-01-09 22:34:55,763 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 22:34:55,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348750716] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:55,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:55,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 22:34:55,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959332143] [2025-01-09 22:34:55,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:55,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:34:55,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:55,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:34:55,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:34:55,764 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand has 14 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 14 states have internal predecessors, (74), 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 22:34:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:56,065 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2025-01-09 22:34:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:34:56,065 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 14 states have internal predecessors, (74), 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 39 [2025-01-09 22:34:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:56,066 INFO L225 Difference]: With dead ends: 185 [2025-01-09 22:34:56,066 INFO L226 Difference]: Without dead ends: 185 [2025-01-09 22:34:56,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:34:56,067 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 166 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:56,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 723 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:34:56,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-09 22:34:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2025-01-09 22:34:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 170 states have internal predecessors, (179), 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 22:34:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 181 transitions. [2025-01-09 22:34:56,069 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 181 transitions. Word has length 39 [2025-01-09 22:34:56,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:56,070 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 181 transitions. [2025-01-09 22:34:56,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 14 states have internal predecessors, (74), 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 22:34:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 181 transitions. [2025-01-09 22:34:56,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:34:56,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:56,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:56,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 22:34:56,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-09 22:34:56,274 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:56,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:56,274 INFO L85 PathProgramCache]: Analyzing trace with hash -829482361, now seen corresponding path program 1 times [2025-01-09 22:34:56,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:56,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339537256] [2025-01-09 22:34:56,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:56,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:56,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:34:56,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:34:56,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:56,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:56,494 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 22:34:56,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:56,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339537256] [2025-01-09 22:34:56,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339537256] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:56,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219909379] [2025-01-09 22:34:56,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:56,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:56,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:56,497 INFO L229 MonitoredProcess]: Starting monitored process 8 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 22:34:56,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 22:34:56,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:34:56,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:34:56,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:56,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:56,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 22:34:56,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:56,609 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 22:34:56,611 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 8 treesize of output 1 [2025-01-09 22:34:56,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:56,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:34:56,674 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:56,675 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 11 treesize of output 11 [2025-01-09 22:34:56,771 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 22:34:56,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:57,022 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 22:34:57,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219909379] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:57,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:57,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2025-01-09 22:34:57,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276367271] [2025-01-09 22:34:57,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:57,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 22:34:57,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:57,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 22:34:57,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2025-01-09 22:34:57,024 INFO L87 Difference]: Start difference. First operand 172 states and 181 transitions. Second operand has 24 states, 23 states have (on average 4.913043478260869) internal successors, (113), 24 states have internal predecessors, (113), 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 22:34:57,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:57,500 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2025-01-09 22:34:57,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:34:57,500 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.913043478260869) internal successors, (113), 24 states have internal predecessors, (113), 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 41 [2025-01-09 22:34:57,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:57,501 INFO L225 Difference]: With dead ends: 185 [2025-01-09 22:34:57,501 INFO L226 Difference]: Without dead ends: 185 [2025-01-09 22:34:57,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2025-01-09 22:34:57,502 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 195 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:57,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 808 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:34:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-09 22:34:57,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 181. [2025-01-09 22:34:57,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 135 states have (on average 1.4296296296296296) internal successors, (193), 179 states have internal predecessors, (193), 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 22:34:57,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 195 transitions. [2025-01-09 22:34:57,504 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 195 transitions. Word has length 41 [2025-01-09 22:34:57,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:57,505 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 195 transitions. [2025-01-09 22:34:57,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.913043478260869) internal successors, (113), 24 states have internal predecessors, (113), 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 22:34:57,505 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 195 transitions. [2025-01-09 22:34:57,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:34:57,505 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:57,505 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:57,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:57,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:57,710 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:34:57,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:57,711 INFO L85 PathProgramCache]: Analyzing trace with hash 55823883, now seen corresponding path program 1 times [2025-01-09 22:34:57,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:57,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909674479] [2025-01-09 22:34:57,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:57,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:57,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:34:57,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:34:57,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:57,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:58,218 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 22:34:58,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:58,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909674479] [2025-01-09 22:34:58,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909674479] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:58,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759553856] [2025-01-09 22:34:58,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:58,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:58,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:58,221 INFO L229 MonitoredProcess]: Starting monitored process 9 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 22:34:58,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 22:34:58,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:34:58,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:34:58,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:58,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:58,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-01-09 22:34:58,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:58,336 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 22:34:58,420 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:58,420 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 11 treesize of output 11 [2025-01-09 22:34:58,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:34:58,451 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 22:34:58,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:34:58,551 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:34:58,551 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 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-09 22:34:58,558 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 24 treesize of output 11 [2025-01-09 22:34:58,623 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:34:58,623 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 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-09 22:34:58,626 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 24 treesize of output 11 [2025-01-09 22:34:58,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:58,693 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 43 [2025-01-09 22:34:58,696 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 24 treesize of output 11 [2025-01-09 22:34:58,750 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:34:58,751 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 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-09 22:34:58,754 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 24 treesize of output 11 [2025-01-09 22:34:58,951 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 25 treesize of output 13 [2025-01-09 22:34:58,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-01-09 22:34:58,982 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 22:34:58,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:59,342 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (|v_ULTIMATE.start_inspect_~node#1.offset_20| Int)) (or (< |v_ULTIMATE.start_inspect_~node#1.offset_20| 0) (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_20|) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_#t~mem15#1.base| v_ArrVal_1192) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_20|) 15) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem15#1.base| v_ArrVal_1191) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_20|))))) (forall ((v_ArrVal_1192 (Array Int Int)) (|v_ULTIMATE.start_inspect_~node#1.offset_20| Int)) (or (< |v_ULTIMATE.start_inspect_~node#1.offset_20| 0) (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_20|) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_#t~mem15#1.base| v_ArrVal_1192) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_20|) 13))))) is different from false [2025-01-09 22:34:59,360 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (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|))) (and (forall ((v_ArrVal_1192 (Array Int Int)) (|v_ULTIMATE.start_inspect_~node#1.offset_20| Int)) (or (< |v_ULTIMATE.start_inspect_~node#1.offset_20| 0) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1192) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_20|) 13)) (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_20|))) (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (|v_ULTIMATE.start_inspect_~node#1.offset_20| Int)) (or (< |v_ULTIMATE.start_inspect_~node#1.offset_20| 0) (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_20|) (< (+ 15 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1192) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_20|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1191) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_20|))))))) is different from false [2025-01-09 22:34:59,400 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base|)) (.cse1 (+ |c_ULTIMATE.start_create_tree_#t~mem14#1.offset| 12))) (and (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1188 Int) (|v_ULTIMATE.start_inspect_~node#1.offset_20| Int)) (or (< |v_ULTIMATE.start_inspect_~node#1.offset_20| 0) (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_20|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_1190) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| (store .cse0 .cse1 v_ArrVal_1188)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1192) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_20|) 13)))) (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1188 Int) (|v_ULTIMATE.start_inspect_~node#1.offset_20| Int)) (or (< |v_ULTIMATE.start_inspect_~node#1.offset_20| 0) (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_20|) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| (store .cse0 .cse1 v_ArrVal_1188)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (< (+ 15 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_1190) .cse2 v_ArrVal_1192) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_20|)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1191) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_20|))))))))) is different from false [2025-01-09 22:35:00,041 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (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|))) (and (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_ULTIMATE.start_create_tree_#t~mem14#1.offset_22| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1186))) (or (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1188 Int) (|v_ULTIMATE.start_inspect_~node#1.offset_20| Int)) (or (< |v_ULTIMATE.start_inspect_~node#1.offset_20| 0) (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_20|) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1187))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store .cse0 .cse1 v_ArrVal_1190) (select (select (store .cse2 .cse1 (store (select .cse2 .cse1) (+ 12 |v_ULTIMATE.start_create_tree_#t~mem14#1.offset_22|) v_ArrVal_1188)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1192))) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_20|) 13)))) (< |v_ULTIMATE.start_create_tree_#t~mem14#1.offset_22| (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))))) (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_ULTIMATE.start_create_tree_#t~mem14#1.offset_22| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1186))) (or (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1188 Int) (|v_ULTIMATE.start_inspect_~node#1.offset_20| Int)) (or (< |v_ULTIMATE.start_inspect_~node#1.offset_20| 0) (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_20|) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1187))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse7 (store .cse8 .cse5 (store (select .cse8 .cse5) (+ 12 |v_ULTIMATE.start_create_tree_#t~mem14#1.offset_22|) v_ArrVal_1188)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (< (+ 15 (select (select (store (store .cse4 .cse5 v_ArrVal_1190) .cse6 v_ArrVal_1192) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_20|)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1191) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_20|))))))))) (< |v_ULTIMATE.start_create_tree_#t~mem14#1.offset_22| (select (select .cse4 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))))))) is different from false [2025-01-09 22:35:00,139 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int)) (|v_ULTIMATE.start_create_tree_#t~mem14#1.offset_22| Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_1185))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_1184) .cse4 v_ArrVal_1186))) (or (< |v_ULTIMATE.start_create_tree_#t~mem14#1.offset_22| (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1188 Int) (|v_ULTIMATE.start_inspect_~node#1.offset_20| Int)) (or (< |v_ULTIMATE.start_inspect_~node#1.offset_20| 0) (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_20|) (< 0 (+ (select (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_1187))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store .cse0 .cse1 v_ArrVal_1190) (select (select (store .cse2 .cse1 (store (select .cse2 .cse1) (+ 12 |v_ULTIMATE.start_create_tree_#t~mem14#1.offset_22|) v_ArrVal_1188)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1192))) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_20|) 13))))))))) (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int)) (|v_ULTIMATE.start_create_tree_#t~mem14#1.offset_22| Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_1185))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_1184) .cse11 v_ArrVal_1186))) (or (< |v_ULTIMATE.start_create_tree_#t~mem14#1.offset_22| (select (select .cse5 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1188 Int) (|v_ULTIMATE.start_inspect_~node#1.offset_20| Int)) (or (< |v_ULTIMATE.start_inspect_~node#1.offset_20| 0) (let ((.cse9 (store .cse10 .cse11 v_ArrVal_1187))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse8 (store .cse9 .cse6 (store (select .cse9 .cse6) (+ 12 |v_ULTIMATE.start_create_tree_#t~mem14#1.offset_22|) v_ArrVal_1188)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (< (+ 15 (select (select (store (store .cse5 .cse6 v_ArrVal_1190) .cse7 v_ArrVal_1192) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_20|)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1191) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_20|))))))) (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_20|))))))))) is different from false [2025-01-09 22:35:00,185 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (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|))) (and (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int)) (|v_ULTIMATE.start_create_tree_#t~mem14#1.offset_22| Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_1185))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_1184) .cse6 v_ArrVal_1186))) (or (< |v_ULTIMATE.start_create_tree_#t~mem14#1.offset_22| (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1188 Int) (|v_ULTIMATE.start_inspect_~node#1.offset_20| Int)) (or (< |v_ULTIMATE.start_inspect_~node#1.offset_20| 0) (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_20|) (let ((.cse4 (store .cse5 .cse6 v_ArrVal_1187))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse3 (store .cse4 .cse1 (store (select .cse4 .cse1) (+ 12 |v_ULTIMATE.start_create_tree_#t~mem14#1.offset_22|) v_ArrVal_1188)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (< (+ (select (select (store (store .cse0 .cse1 v_ArrVal_1190) .cse2 v_ArrVal_1192) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_20|) 15) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1191) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_20|)))))))))))))) (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int)) (|v_ULTIMATE.start_create_tree_#t~mem14#1.offset_22| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_1185))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse8 (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_1184) .cse12 v_ArrVal_1186))) (or (< |v_ULTIMATE.start_create_tree_#t~mem14#1.offset_22| (select (select .cse8 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1188 Int) (|v_ULTIMATE.start_inspect_~node#1.offset_20| Int)) (or (< |v_ULTIMATE.start_inspect_~node#1.offset_20| 0) (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_20|) (< 0 (+ (select (select (let ((.cse10 (store .cse11 .cse12 v_ArrVal_1187))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store .cse8 .cse9 v_ArrVal_1190) (select (select (store .cse10 .cse9 (store (select .cse10 .cse9) (+ 12 |v_ULTIMATE.start_create_tree_#t~mem14#1.offset_22|) v_ArrVal_1188)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1192))) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_20|) 13))))))))))) is different from false [2025-01-09 22:35:00,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:00,275 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 244 [2025-01-09 22:35:00,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:00,282 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 148 [2025-01-09 22:35:00,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:00,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 201578 treesize of output 192156 [2025-01-09 22:35:00,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:00,629 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 127134 treesize of output 125657 [2025-01-09 22:35:01,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:01,274 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 10034 treesize of output 9910 [2025-01-09 22:35:01,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:01,428 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 9873 treesize of output 9783 [2025-01-09 22:35:01,609 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 9747 treesize of output 9299 [2025-01-09 22:35:01,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 9717 treesize of output 9343 [2025-01-09 22:35:01,993 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 9599 treesize of output 8981 [2025-01-09 22:35:02,132 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 8931 treesize of output 8803 [2025-01-09 22:35:40,334 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 96 treesize of output 92 [2025-01-09 22:35:40,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:40,417 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 533 treesize of output 525 [2025-01-09 22:35:40,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:40,422 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 517 treesize of output 301 [2025-01-09 22:35:40,425 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:35:40,426 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:35:40,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:40,480 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 22:35:40,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 37793 treesize of output 33759 [2025-01-09 22:35:40,785 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:35:40,785 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:35:40,786 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:35:40,786 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:35:40,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:40,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:40,798 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12662 treesize of output 12118 [2025-01-09 22:35:41,046 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 6165 treesize of output 5967 [2025-01-09 22:35:41,119 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 5967 treesize of output 5767 [2025-01-09 22:35:41,168 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 5767 treesize of output 5695 [2025-01-09 22:35:41,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:41,223 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7019 treesize of output 6239 [2025-01-09 22:35:41,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:41,386 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 2170 treesize of output 2134 [2025-01-09 22:35:42,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:42,087 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-01-09 22:35:42,323 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 22:35:42,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759553856] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:35:42,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:35:42,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 18] total 46 [2025-01-09 22:35:42,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970854390] [2025-01-09 22:35:42,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:35:42,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-01-09 22:35:42,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:42,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-01-09 22:35:42,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1478, Unknown=42, NotChecked=498, Total=2162 [2025-01-09 22:35:42,326 INFO L87 Difference]: Start difference. First operand 181 states and 195 transitions. Second operand has 47 states, 46 states have (on average 2.5652173913043477) internal successors, (118), 47 states have internal predecessors, (118), 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 22:35:44,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:44,274 INFO L93 Difference]: Finished difference Result 225 states and 247 transitions. [2025-01-09 22:35:44,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:35:44,275 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.5652173913043477) internal successors, (118), 47 states have internal predecessors, (118), 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 42 [2025-01-09 22:35:44,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:44,275 INFO L225 Difference]: With dead ends: 225 [2025-01-09 22:35:44,276 INFO L226 Difference]: Without dead ends: 225 [2025-01-09 22:35:44,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=315, Invalid=2525, Unknown=46, NotChecked=654, Total=3540 [2025-01-09 22:35:44,277 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 211 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 1893 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 2162 SdHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 834 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:44,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 2162 Invalid, 2738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1893 Invalid, 0 Unknown, 834 Unchecked, 1.1s Time] [2025-01-09 22:35:44,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-01-09 22:35:44,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 192. [2025-01-09 22:35:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 146 states have (on average 1.417808219178082) internal successors, (207), 190 states have internal predecessors, (207), 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 22:35:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 209 transitions. [2025-01-09 22:35:44,280 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 209 transitions. Word has length 42 [2025-01-09 22:35:44,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:44,280 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 209 transitions. [2025-01-09 22:35:44,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.5652173913043477) internal successors, (118), 47 states have internal predecessors, (118), 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 22:35:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 209 transitions. [2025-01-09 22:35:44,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:35:44,280 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:44,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:44,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 22:35:44,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:44,485 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:35:44,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:44,486 INFO L85 PathProgramCache]: Analyzing trace with hash 55823882, now seen corresponding path program 1 times [2025-01-09 22:35:44,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:44,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105944151] [2025-01-09 22:35:44,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:44,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:44,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:35:44,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:35:44,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:44,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:44,840 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 22:35:44,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:44,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105944151] [2025-01-09 22:35:44,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105944151] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:44,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865653388] [2025-01-09 22:35:44,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:44,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:44,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:35:44,843 INFO L229 MonitoredProcess]: Starting monitored process 10 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 22:35:44,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 22:35:44,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:35:44,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:35:44,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:44,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:44,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 22:35:44,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:35:44,966 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 22:35:45,039 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:35:45,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 22:35:45,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:35:45,172 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:35:45,172 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 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:35:45,236 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:35:45,236 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 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:35:45,300 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:35:45,301 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 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:35:45,355 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:35:45,355 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 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:35:45,534 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 25 treesize of output 13 [2025-01-09 22:35:45,564 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 22:35:45,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:35:45,837 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1303 (Array Int Int)) (|v_ULTIMATE.start_inspect_~node#1.offset_21| Int)) (or (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_21|) (< |v_ULTIMATE.start_inspect_~node#1.offset_21| 0) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_1303))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1304)) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_21|)) 1))) is different from false [2025-01-09 22:35:46,071 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (v_ArrVal_1301 (Array Int Int)) (|v_ULTIMATE.start_inspect_~node#1.offset_21| Int)) (or (= (select |c_#valid| (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_1301))) (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_1302)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1303)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1304)) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_21|)) 1) (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_21|) (< |v_ULTIMATE.start_inspect_~node#1.offset_21| 0))) is different from false [2025-01-09 22:35:46,079 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (v_ArrVal_1301 (Array Int Int)) (|v_ULTIMATE.start_inspect_~node#1.offset_21| Int)) (or (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_21|) (= (select |c_#valid| (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (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|) v_ArrVal_1301))) (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_1302)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1303)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1304)) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_21|)) 1) (< |v_ULTIMATE.start_inspect_~node#1.offset_21| 0))) is different from false [2025-01-09 22:35:46,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:46,102 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 91 [2025-01-09 22:35:46,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:46,126 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 443194 treesize of output 383977 [2025-01-09 22:35:49,439 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 11869 treesize of output 11525 [2025-01-09 22:35:49,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:49,523 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 11525 treesize of output 10737 [2025-01-09 22:35:49,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:49,607 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 10729 treesize of output 10369 [2025-01-09 22:35:49,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:49,692 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 10361 treesize of output 9337 [2025-01-09 22:36:07,195 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 22:36:07,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865653388] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:36:07,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:36:07,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 18] total 44 [2025-01-09 22:36:07,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062028671] [2025-01-09 22:36:07,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:36:07,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-09 22:36:07,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:07,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-09 22:36:07,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1513, Unknown=51, NotChecked=246, Total=1980 [2025-01-09 22:36:07,201 INFO L87 Difference]: Start difference. First operand 192 states and 209 transitions. Second operand has 45 states, 44 states have (on average 2.6136363636363638) internal successors, (115), 45 states have internal predecessors, (115), 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 22:36:08,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:08,935 INFO L93 Difference]: Finished difference Result 224 states and 246 transitions. [2025-01-09 22:36:08,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:36:08,937 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.6136363636363638) internal successors, (115), 45 states have internal predecessors, (115), 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 42 [2025-01-09 22:36:08,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:08,942 INFO L225 Difference]: With dead ends: 224 [2025-01-09 22:36:08,942 INFO L226 Difference]: Without dead ends: 224 [2025-01-09 22:36:08,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=348, Invalid=2580, Unknown=54, NotChecked=324, Total=3306 [2025-01-09 22:36:08,943 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 225 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 430 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:08,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1689 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1686 Invalid, 0 Unknown, 430 Unchecked, 1.2s Time] [2025-01-09 22:36:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-01-09 22:36:08,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 192. [2025-01-09 22:36:08,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 146 states have (on average 1.4109589041095891) internal successors, (206), 190 states have internal predecessors, (206), 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 22:36:08,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 208 transitions. [2025-01-09 22:36:08,949 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 208 transitions. Word has length 42 [2025-01-09 22:36:08,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:08,949 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 208 transitions. [2025-01-09 22:36:08,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.6136363636363638) internal successors, (115), 45 states have internal predecessors, (115), 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 22:36:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2025-01-09 22:36:08,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:36:08,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:08,950 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 22:36:08,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 22:36:09,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:09,151 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-01-09 22:36:09,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:09,151 INFO L85 PathProgramCache]: Analyzing trace with hash -367825904, now seen corresponding path program 1 times [2025-01-09 22:36:09,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:09,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44706658] [2025-01-09 22:36:09,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:09,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:09,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:36:09,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:36:09,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:09,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:09,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:09,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44706658] [2025-01-09 22:36:09,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44706658] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:36:09,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243469465] [2025-01-09 22:36:09,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:09,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:09,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:09,562 INFO L229 MonitoredProcess]: Starting monitored process 11 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 22:36:09,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 22:36:09,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:36:09,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:36:09,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:09,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:09,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-09 22:36:09,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:36:09,692 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 22:36:09,730 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:36:09,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 22:36:09,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:36:09,808 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:09,809 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 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:36:09,831 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 33 treesize of output 17 [2025-01-09 22:36:09,869 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-01-09 22:36:09,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2025-01-09 22:36:09,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 45 treesize of output 25 [2025-01-09 22:36:09,973 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:09,973 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 1 case distinctions, treesize of input 54 treesize of output 47 [2025-01-09 22:36:10,027 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:10,028 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 1 case distinctions, treesize of input 54 treesize of output 47 [2025-01-09 22:36:10,082 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:10,082 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 1 case distinctions, treesize of input 54 treesize of output 47 [2025-01-09 22:36:10,134 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:10,135 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 1 case distinctions, treesize of input 54 treesize of output 47 [2025-01-09 22:36:10,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 45 treesize of output 21 [2025-01-09 22:36:10,212 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-01-09 22:36:10,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2025-01-09 22:36:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:10,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:36:10,267 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1476 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (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|) v_ArrVal_1476) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) 1)) is different from false [2025-01-09 22:36:10,277 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1475 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_1475))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1476)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) 1)) is different from false [2025-01-09 22:36:10,367 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1473 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_1473))) (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_1474)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1475)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1476)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) 1)) is different from false [2025-01-09 22:36:10,371 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1473 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (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|) v_ArrVal_1473))) (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_1474)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1475)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1476)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) 1)) is different from false [2025-01-09 22:36:10,382 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1473 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_~node~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset| |c_ULTIMATE.start_create_tree_#t~malloc11#1.base|)) |c_ULTIMATE.start_create_tree_#t~malloc11#1.base| v_ArrVal_1473))) (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_1474)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1475)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1476)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) 1)) is different from false