./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0504_1.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/list-ext-properties/test-0504_1.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 ad4b9fd301578a7ddb25530c70896459a49284f596306d3b6d0c853e43916174 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:16:59,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:16:59,150 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:16:59,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:16:59,159 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:16:59,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:16:59,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:16:59,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:16:59,187 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:16:59,187 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:16:59,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:16:59,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:16:59,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:16:59,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:16:59,189 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:16:59,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:16:59,190 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:16:59,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:16:59,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:16:59,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:16:59,190 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:16:59,190 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:16:59,190 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:16:59,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:16:59,190 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:16:59,191 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:16:59,191 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:16:59,191 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:16:59,191 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:16:59,191 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:16:59,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:16:59,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:16:59,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:16:59,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:16:59,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:16:59,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:16:59,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:16:59,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:16:59,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:16:59,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:16:59,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:16:59,193 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:16:59,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:16:59,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:16:59,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:16:59,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:16:59,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:16:59,193 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 -> ad4b9fd301578a7ddb25530c70896459a49284f596306d3b6d0c853e43916174 [2025-01-09 22:16:59,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:16:59,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:16:59,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:16:59,489 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:16:59,490 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:16:59,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0504_1.i [2025-01-09 22:17:00,845 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb4cd549f/75bb2394558b4835ba8259dbd8568322/FLAG0f72ec72a [2025-01-09 22:17:01,186 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:17:01,189 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0504_1.i [2025-01-09 22:17:01,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb4cd549f/75bb2394558b4835ba8259dbd8568322/FLAG0f72ec72a [2025-01-09 22:17:01,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb4cd549f/75bb2394558b4835ba8259dbd8568322 [2025-01-09 22:17:01,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:17:01,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:17:01,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:17:01,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:17:01,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:17:01,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:17:01" (1/1) ... [2025-01-09 22:17:01,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d08bdda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:01, skipping insertion in model container [2025-01-09 22:17:01,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:17:01" (1/1) ... [2025-01-09 22:17:01,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:17:01,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:17:01,547 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:17:01,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:17:01,606 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:17:01,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:01 WrapperNode [2025-01-09 22:17:01,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:17:01,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:17:01,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:17:01,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:17:01,613 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:17:01" (1/1) ... [2025-01-09 22:17:01,622 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:17:01" (1/1) ... [2025-01-09 22:17:01,645 INFO L138 Inliner]: procedures = 123, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 108 [2025-01-09 22:17:01,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:17:01,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:17:01,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:17:01,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:17:01,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:01" (1/1) ... [2025-01-09 22:17:01,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:01" (1/1) ... [2025-01-09 22:17:01,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:01" (1/1) ... [2025-01-09 22:17:01,677 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2025-01-09 22:17:01,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:01" (1/1) ... [2025-01-09 22:17:01,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:01" (1/1) ... [2025-01-09 22:17:01,689 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:01" (1/1) ... [2025-01-09 22:17:01,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:01" (1/1) ... [2025-01-09 22:17:01,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:01" (1/1) ... [2025-01-09 22:17:01,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:01" (1/1) ... [2025-01-09 22:17:01,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:01" (1/1) ... [2025-01-09 22:17:01,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:17:01,702 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:17:01,705 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:17:01,706 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:17:01,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:01" (1/1) ... [2025-01-09 22:17:01,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:17:01,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:01,735 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:17:01,742 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:17:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:17:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:17:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:17:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:17:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:17:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:17:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:17:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:17:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:17:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:17:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:17:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:17:01,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:17:01,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:17:01,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:17:01,865 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:17:01,867 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:17:02,168 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2025-01-09 22:17:02,168 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:17:02,180 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:17:02,181 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 22:17:02,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:17:02 BoogieIcfgContainer [2025-01-09 22:17:02,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:17:02,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:17:02,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:17:02,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:17:02,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:17:01" (1/3) ... [2025-01-09 22:17:02,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137a874d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:17:02, skipping insertion in model container [2025-01-09 22:17:02,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:01" (2/3) ... [2025-01-09 22:17:02,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137a874d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:17:02, skipping insertion in model container [2025-01-09 22:17:02,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:17:02" (3/3) ... [2025-01-09 22:17:02,194 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0504_1.i [2025-01-09 22:17:02,206 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:17:02,207 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0504_1.i that has 1 procedures, 97 locations, 1 initial locations, 4 loop locations, and 43 error locations. [2025-01-09 22:17:02,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:17:02,260 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;@3b9df358, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:17:02,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-01-09 22:17:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 96 states have internal predecessors, (108), 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:17:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:17:02,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:02,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:17:02,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:02,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:02,273 INFO L85 PathProgramCache]: Analyzing trace with hash 28796107, now seen corresponding path program 1 times [2025-01-09 22:17:02,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:02,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120032283] [2025-01-09 22:17:02,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:02,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:02,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:17:02,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:17:02,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:02,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:02,394 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:17:02,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:02,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120032283] [2025-01-09 22:17:02,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120032283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:02,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:02,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:17:02,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225114586] [2025-01-09 22:17:02,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:02,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 22:17:02,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:02,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 22:17:02,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:17:02,425 INFO L87 Difference]: Start difference. First operand has 97 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 96 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 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:17:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:02,441 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2025-01-09 22:17:02,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 22:17:02,443 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:17:02,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:02,449 INFO L225 Difference]: With dead ends: 97 [2025-01-09 22:17:02,449 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 22:17:02,451 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:17:02,455 INFO L435 NwaCegarLoop]: 104 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, 104 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:17:02,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:17:02,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 22:17:02,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-01-09 22:17:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 94 states have internal predecessors, (102), 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:17:02,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2025-01-09 22:17:02,495 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 5 [2025-01-09 22:17:02,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:02,496 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2025-01-09 22:17:02,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:17:02,496 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2025-01-09 22:17:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:17:02,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:02,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:02,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:17:02,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:02,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:02,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1805897805, now seen corresponding path program 1 times [2025-01-09 22:17:02,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:02,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44848064] [2025-01-09 22:17:02,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:02,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:02,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:17:02,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:17:02,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:02,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:02,598 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:17:02,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:02,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44848064] [2025-01-09 22:17:02,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44848064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:02,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:02,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:17:02,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117610251] [2025-01-09 22:17:02,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:02,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:17:02,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:02,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:17:02,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:17:02,600 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) 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:17:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:02,631 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2025-01-09 22:17:02,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:17:02,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) 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:17:02,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:02,634 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:17:02,634 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:17:02,634 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:17:02,635 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 2 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:02,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 194 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:17:02,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:17:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-01-09 22:17:02,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 98 states have internal predecessors, (108), 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:17:02,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2025-01-09 22:17:02,646 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 7 [2025-01-09 22:17:02,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:02,646 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2025-01-09 22:17:02,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) 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:17:02,647 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2025-01-09 22:17:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:17:02,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:02,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:02,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:17:02,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:02,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:02,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1805899149, now seen corresponding path program 1 times [2025-01-09 22:17:02,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:02,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607142228] [2025-01-09 22:17:02,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:02,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:02,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:17:02,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:17:02,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:02,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:02,702 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:17:02,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:02,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607142228] [2025-01-09 22:17:02,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607142228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:02,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:02,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:17:02,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926752391] [2025-01-09 22:17:02,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:02,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:17:02,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:02,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:17:02,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:17:02,705 INFO L87 Difference]: Start difference. First operand 99 states and 108 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:17:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:02,790 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2025-01-09 22:17:02,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:17:02,791 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:17:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:02,792 INFO L225 Difference]: With dead ends: 101 [2025-01-09 22:17:02,792 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:17:02,793 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:17:02,794 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:02,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 158 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:02,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:17:02,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-01-09 22:17:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 55 states have (on average 1.9272727272727272) internal successors, (106), 97 states have internal predecessors, (106), 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:17:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2025-01-09 22:17:02,803 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 7 [2025-01-09 22:17:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:02,803 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2025-01-09 22:17:02,803 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:17:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2025-01-09 22:17:02,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 22:17:02,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:02,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:02,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:17:02,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:02,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:02,804 INFO L85 PathProgramCache]: Analyzing trace with hash 148105389, now seen corresponding path program 1 times [2025-01-09 22:17:02,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:02,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761418105] [2025-01-09 22:17:02,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:02,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:02,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:17:02,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:17:02,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:02,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:02,887 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:17:02,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:02,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761418105] [2025-01-09 22:17:02,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761418105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:02,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:02,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:17:02,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513243463] [2025-01-09 22:17:02,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:02,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:17:02,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:02,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:17:02,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:17:02,890 INFO L87 Difference]: Start difference. First operand 98 states and 106 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:17:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:02,985 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2025-01-09 22:17:02,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:17:02,986 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:17:02,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:02,986 INFO L225 Difference]: With dead ends: 90 [2025-01-09 22:17:02,987 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 22:17:02,987 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:17:02,987 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 38 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:02,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 89 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:02,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 22:17:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-09 22:17:03,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.7818181818181817) internal successors, (98), 89 states have internal predecessors, (98), 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:17:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2025-01-09 22:17:03,001 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 8 [2025-01-09 22:17:03,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:03,001 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2025-01-09 22:17:03,001 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:17:03,001 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2025-01-09 22:17:03,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 22:17:03,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:03,004 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:03,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:17:03,005 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:03,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:03,005 INFO L85 PathProgramCache]: Analyzing trace with hash 148105390, now seen corresponding path program 1 times [2025-01-09 22:17:03,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:03,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456044656] [2025-01-09 22:17:03,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:03,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:03,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:17:03,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:17:03,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:03,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:03,157 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:17:03,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:03,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456044656] [2025-01-09 22:17:03,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456044656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:03,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:03,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:17:03,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107765182] [2025-01-09 22:17:03,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:03,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:17:03,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:03,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:17:03,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:17:03,159 INFO L87 Difference]: Start difference. First operand 90 states and 98 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:17:03,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:03,243 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2025-01-09 22:17:03,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:17:03,243 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:17:03,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:03,245 INFO L225 Difference]: With dead ends: 96 [2025-01-09 22:17:03,245 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 22:17:03,245 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:17:03,246 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 17 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:03,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 126 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 22:17:03,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2025-01-09 22:17:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 91 states have internal predecessors, (105), 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:17:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2025-01-09 22:17:03,253 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 8 [2025-01-09 22:17:03,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:03,254 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2025-01-09 22:17:03,254 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:17:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2025-01-09 22:17:03,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:17:03,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:03,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:03,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:17:03,255 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:03,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:03,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1321981186, now seen corresponding path program 1 times [2025-01-09 22:17:03,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:03,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552668632] [2025-01-09 22:17:03,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:03,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:03,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:17:03,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:17:03,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:03,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:03,650 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:17:03,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:03,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552668632] [2025-01-09 22:17:03,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552668632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:03,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:03,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:17:03,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723098854] [2025-01-09 22:17:03,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:03,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:17:03,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:03,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:17:03,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:17:03,652 INFO L87 Difference]: Start difference. First operand 92 states and 105 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:17:03,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:03,769 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2025-01-09 22:17:03,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:17:03,770 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 19 [2025-01-09 22:17:03,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:03,771 INFO L225 Difference]: With dead ends: 89 [2025-01-09 22:17:03,771 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 22:17:03,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:17:03,771 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 41 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:03,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 119 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:03,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 22:17:03,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2025-01-09 22:17:03,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 81 states have internal predecessors, (90), 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:17:03,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2025-01-09 22:17:03,779 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 19 [2025-01-09 22:17:03,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:03,779 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2025-01-09 22:17:03,779 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:17:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2025-01-09 22:17:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:17:03,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:03,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:03,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:17:03,780 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:03,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:03,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1322074528, now seen corresponding path program 1 times [2025-01-09 22:17:03,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:03,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400029858] [2025-01-09 22:17:03,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:03,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:03,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:17:03,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:17:03,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:03,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:03,861 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:17:03,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:03,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400029858] [2025-01-09 22:17:03,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400029858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:03,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:03,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:17:03,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308098379] [2025-01-09 22:17:03,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:03,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:17:03,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:03,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:17:03,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:17:03,864 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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:17:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:03,882 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2025-01-09 22:17:03,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:17:03,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 22:17:03,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:03,884 INFO L225 Difference]: With dead ends: 117 [2025-01-09 22:17:03,885 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 22:17:03,885 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:17:03,886 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 25 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:03,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 163 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:17:03,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 22:17:03,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 107. [2025-01-09 22:17:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 80 states have (on average 1.5875) internal successors, (127), 106 states have internal predecessors, (127), 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:17:03,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions. [2025-01-09 22:17:03,895 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 19 [2025-01-09 22:17:03,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:03,896 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 127 transitions. [2025-01-09 22:17:03,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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:17:03,896 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions. [2025-01-09 22:17:03,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:17:03,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:03,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:03,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:17:03,897 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:03,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:03,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1968256187, now seen corresponding path program 1 times [2025-01-09 22:17:03,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:03,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383776951] [2025-01-09 22:17:03,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:03,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:03,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:17:03,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:17:03,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:03,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:03,998 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:17:03,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:03,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383776951] [2025-01-09 22:17:03,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383776951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:03,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:03,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:17:03,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336056483] [2025-01-09 22:17:03,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:03,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:17:03,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:04,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:17:04,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:17:04,001 INFO L87 Difference]: Start difference. First operand 107 states and 127 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:17:04,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:04,059 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2025-01-09 22:17:04,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:17:04,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-09 22:17:04,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:04,061 INFO L225 Difference]: With dead ends: 103 [2025-01-09 22:17:04,061 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 22:17:04,061 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:17:04,061 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:04,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 109 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:04,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 22:17:04,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-01-09 22:17:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 80 states have (on average 1.4875) internal successors, (119), 102 states have internal predecessors, (119), 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:17:04,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2025-01-09 22:17:04,069 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 20 [2025-01-09 22:17:04,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:04,070 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2025-01-09 22:17:04,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:17:04,070 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2025-01-09 22:17:04,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:17:04,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:04,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:04,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:17:04,070 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:04,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:04,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1968256186, now seen corresponding path program 1 times [2025-01-09 22:17:04,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:04,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888987887] [2025-01-09 22:17:04,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:04,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:04,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:17:04,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:17:04,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:04,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:04,174 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:17:04,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:04,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888987887] [2025-01-09 22:17:04,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888987887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:04,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:04,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:17:04,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759737967] [2025-01-09 22:17:04,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:04,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:17:04,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:04,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:17:04,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:17:04,177 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:17:04,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:04,225 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2025-01-09 22:17:04,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:17:04,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-09 22:17:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:04,226 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:17:04,226 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:17:04,227 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:17:04,227 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:04,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 114 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:17:04,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:17:04,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 22:17:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3875) internal successors, (111), 98 states have internal predecessors, (111), 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:17:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2025-01-09 22:17:04,231 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 20 [2025-01-09 22:17:04,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:04,231 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2025-01-09 22:17:04,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:17:04,231 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2025-01-09 22:17:04,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:17:04,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:04,232 INFO L218 NwaCegarLoop]: trace histogram [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:17:04,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:17:04,232 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:04,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:04,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1426501177, now seen corresponding path program 1 times [2025-01-09 22:17:04,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:04,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000069995] [2025-01-09 22:17:04,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:04,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:04,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:17:04,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:17:04,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:04,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:04,506 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:17:04,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:04,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000069995] [2025-01-09 22:17:04,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000069995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:04,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:04,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:17:04,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156491126] [2025-01-09 22:17:04,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:04,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:17:04,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:04,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:17:04,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:17:04,508 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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:17:04,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:04,666 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2025-01-09 22:17:04,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:17:04,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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:17:04,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:04,668 INFO L225 Difference]: With dead ends: 137 [2025-01-09 22:17:04,668 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 22:17:04,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:17:04,669 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 10 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:04,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 240 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:04,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 22:17:04,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2025-01-09 22:17:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.37) internal successors, (137), 118 states have internal predecessors, (137), 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:17:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2025-01-09 22:17:04,674 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 23 [2025-01-09 22:17:04,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:04,678 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2025-01-09 22:17:04,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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:17:04,679 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2025-01-09 22:17:04,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:17:04,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:04,680 INFO L218 NwaCegarLoop]: trace histogram [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:17:04,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:17:04,680 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:04,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:04,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1426501176, now seen corresponding path program 1 times [2025-01-09 22:17:04,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:04,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691881056] [2025-01-09 22:17:04,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:04,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:04,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:17:04,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:17:04,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:04,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:05,304 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:17:05,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:05,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691881056] [2025-01-09 22:17:05,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691881056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:05,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:05,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:17:05,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428033401] [2025-01-09 22:17:05,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:05,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:17:05,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:05,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:17:05,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:17:05,309 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 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:17:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:05,637 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2025-01-09 22:17:05,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:17:05,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 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:17:05,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:05,642 INFO L225 Difference]: With dead ends: 136 [2025-01-09 22:17:05,642 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 22:17:05,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:17:05,643 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 115 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:05,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 293 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:17:05,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 22:17:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 119. [2025-01-09 22:17:05,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.35) internal successors, (135), 118 states have internal predecessors, (135), 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:17:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2025-01-09 22:17:05,650 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 23 [2025-01-09 22:17:05,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:05,651 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2025-01-09 22:17:05,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 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:17:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2025-01-09 22:17:05,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:17:05,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:05,653 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] [2025-01-09 22:17:05,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:17:05,653 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:05,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:05,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2015810969, now seen corresponding path program 1 times [2025-01-09 22:17:05,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:05,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27186361] [2025-01-09 22:17:05,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:05,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:05,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:17:05,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:17:05,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:05,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:05,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:05,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27186361] [2025-01-09 22:17:05,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27186361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:05,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:05,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:17:05,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218774696] [2025-01-09 22:17:05,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:05,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:17:05,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:05,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:17:05,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:17:05,724 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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:17:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:05,823 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2025-01-09 22:17:05,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:17:05,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2025-01-09 22:17:05,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:05,824 INFO L225 Difference]: With dead ends: 125 [2025-01-09 22:17:05,824 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 22:17:05,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:17:05,825 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 57 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:05,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 133 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:05,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 22:17:05,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2025-01-09 22:17:05,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.3627450980392157) internal successors, (139), 120 states have internal predecessors, (139), 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:17:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2025-01-09 22:17:05,828 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 24 [2025-01-09 22:17:05,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:05,828 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2025-01-09 22:17:05,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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:17:05,828 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2025-01-09 22:17:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:17:05,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:05,829 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] [2025-01-09 22:17:05,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:17:05,829 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:05,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:05,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2015810968, now seen corresponding path program 1 times [2025-01-09 22:17:05,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:05,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549453840] [2025-01-09 22:17:05,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:05,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:05,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:17:05,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:17:05,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:05,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:05,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:05,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549453840] [2025-01-09 22:17:05,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549453840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:05,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:05,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:17:05,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231128129] [2025-01-09 22:17:05,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:05,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:17:05,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:05,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:17:05,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:17:05,941 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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:17:06,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:06,051 INFO L93 Difference]: Finished difference Result 157 states and 181 transitions. [2025-01-09 22:17:06,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:17:06,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2025-01-09 22:17:06,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:06,052 INFO L225 Difference]: With dead ends: 157 [2025-01-09 22:17:06,052 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 22:17:06,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:17:06,053 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 35 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:06,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 165 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:06,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 22:17:06,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 147. [2025-01-09 22:17:06,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 128 states have (on average 1.359375) internal successors, (174), 146 states have internal predecessors, (174), 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:17:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 174 transitions. [2025-01-09 22:17:06,059 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 174 transitions. Word has length 24 [2025-01-09 22:17:06,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:06,059 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 174 transitions. [2025-01-09 22:17:06,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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:17:06,059 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 174 transitions. [2025-01-09 22:17:06,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:17:06,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:06,060 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] [2025-01-09 22:17:06,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:17:06,061 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:06,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:06,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2015809625, now seen corresponding path program 1 times [2025-01-09 22:17:06,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:06,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105729899] [2025-01-09 22:17:06,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:06,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:06,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:17:06,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:17:06,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:06,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:06,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:06,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105729899] [2025-01-09 22:17:06,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105729899] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:06,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846259897] [2025-01-09 22:17:06,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:06,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:06,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:06,125 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:17:06,126 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:17:06,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:17:06,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:17:06,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:06,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:06,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 22:17:06,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:06,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:17:06,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846259897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:06,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:17:06,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-09 22:17:06,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457934272] [2025-01-09 22:17:06,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:06,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:17:06,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:06,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:17:06,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:17:06,305 INFO L87 Difference]: Start difference. First operand 147 states and 174 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:17:06,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:06,324 INFO L93 Difference]: Finished difference Result 147 states and 172 transitions. [2025-01-09 22:17:06,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:17:06,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2025-01-09 22:17:06,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:06,325 INFO L225 Difference]: With dead ends: 147 [2025-01-09 22:17:06,325 INFO L226 Difference]: Without dead ends: 147 [2025-01-09 22:17:06,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:17:06,325 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 79 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:06,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 112 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:17:06,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-09 22:17:06,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-01-09 22:17:06,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 128 states have (on average 1.34375) internal successors, (172), 146 states have internal predecessors, (172), 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:17:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2025-01-09 22:17:06,331 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 24 [2025-01-09 22:17:06,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:06,331 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2025-01-09 22:17:06,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:17:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2025-01-09 22:17:06,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:17:06,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:06,332 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] [2025-01-09 22:17:06,339 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:17:06,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 22:17:06,535 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:06,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:06,535 INFO L85 PathProgramCache]: Analyzing trace with hash -164087960, now seen corresponding path program 1 times [2025-01-09 22:17:06,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:06,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031913992] [2025-01-09 22:17:06,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:06,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:06,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:17:06,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:17:06,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:06,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:06,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:06,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031913992] [2025-01-09 22:17:06,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031913992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:06,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:06,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:17:06,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755925092] [2025-01-09 22:17:06,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:06,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:17:06,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:06,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:17:06,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:17:06,610 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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:17:06,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:06,777 INFO L93 Difference]: Finished difference Result 172 states and 198 transitions. [2025-01-09 22:17:06,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:17:06,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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:17:06,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:06,779 INFO L225 Difference]: With dead ends: 172 [2025-01-09 22:17:06,780 INFO L226 Difference]: Without dead ends: 172 [2025-01-09 22:17:06,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:17:06,781 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 79 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:06,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 163 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:06,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-09 22:17:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 158. [2025-01-09 22:17:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 139 states have (on average 1.381294964028777) internal successors, (192), 157 states have internal predecessors, (192), 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:17:06,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 192 transitions. [2025-01-09 22:17:06,790 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 192 transitions. Word has length 26 [2025-01-09 22:17:06,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:06,790 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 192 transitions. [2025-01-09 22:17:06,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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:17:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 192 transitions. [2025-01-09 22:17:06,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:17:06,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:06,794 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] [2025-01-09 22:17:06,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:17:06,794 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:06,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:06,794 INFO L85 PathProgramCache]: Analyzing trace with hash -164087959, now seen corresponding path program 1 times [2025-01-09 22:17:06,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:06,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247230793] [2025-01-09 22:17:06,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:06,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:06,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:17:06,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:17:06,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:06,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:06,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:06,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:06,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247230793] [2025-01-09 22:17:06,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247230793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:06,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:06,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:17:06,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253107391] [2025-01-09 22:17:06,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:06,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:17:06,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:06,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:17:06,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:17:06,929 INFO L87 Difference]: Start difference. First operand 158 states and 192 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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:17:07,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:07,095 INFO L93 Difference]: Finished difference Result 193 states and 233 transitions. [2025-01-09 22:17:07,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:17:07,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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:17:07,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:07,096 INFO L225 Difference]: With dead ends: 193 [2025-01-09 22:17:07,097 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 22:17:07,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:17:07,097 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 54 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:07,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 198 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:07,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 22:17:07,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 178. [2025-01-09 22:17:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 159 states have (on average 1.4276729559748427) internal successors, (227), 177 states have internal predecessors, (227), 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:17:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 227 transitions. [2025-01-09 22:17:07,103 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 227 transitions. Word has length 26 [2025-01-09 22:17:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:07,103 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 227 transitions. [2025-01-09 22:17:07,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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:17:07,103 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 227 transitions. [2025-01-09 22:17:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:17:07,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:07,104 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] [2025-01-09 22:17:07,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:17:07,104 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:07,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:07,105 INFO L85 PathProgramCache]: Analyzing trace with hash -671544013, now seen corresponding path program 1 times [2025-01-09 22:17:07,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:07,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299292113] [2025-01-09 22:17:07,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:07,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:07,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:17:07,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:17:07,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:07,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:07,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:07,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299292113] [2025-01-09 22:17:07,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299292113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:07,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:07,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:17:07,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534511035] [2025-01-09 22:17:07,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:07,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:17:07,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:07,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:17:07,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:17:07,318 INFO L87 Difference]: Start difference. First operand 178 states and 227 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 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:17:07,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:07,546 INFO L93 Difference]: Finished difference Result 214 states and 269 transitions. [2025-01-09 22:17:07,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:17:07,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 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:17:07,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:07,547 INFO L225 Difference]: With dead ends: 214 [2025-01-09 22:17:07,547 INFO L226 Difference]: Without dead ends: 214 [2025-01-09 22:17:07,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:17:07,548 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 60 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:07,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 261 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:17:07,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-09 22:17:07,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 189. [2025-01-09 22:17:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 170 states have (on average 1.423529411764706) internal successors, (242), 188 states have internal predecessors, (242), 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:17:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 242 transitions. [2025-01-09 22:17:07,553 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 242 transitions. Word has length 29 [2025-01-09 22:17:07,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:07,553 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 242 transitions. [2025-01-09 22:17:07,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 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:17:07,553 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 242 transitions. [2025-01-09 22:17:07,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:17:07,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:07,554 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] [2025-01-09 22:17:07,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:17:07,554 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:07,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:07,555 INFO L85 PathProgramCache]: Analyzing trace with hash -671544012, now seen corresponding path program 1 times [2025-01-09 22:17:07,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:07,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205541638] [2025-01-09 22:17:07,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:07,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:07,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:17:07,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:17:07,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:07,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:07,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:07,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205541638] [2025-01-09 22:17:07,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205541638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:07,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:07,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:17:07,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860118259] [2025-01-09 22:17:07,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:07,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:17:07,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:07,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:17:07,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:17:07,796 INFO L87 Difference]: Start difference. First operand 189 states and 242 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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:17:07,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:07,947 INFO L93 Difference]: Finished difference Result 197 states and 248 transitions. [2025-01-09 22:17:07,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:17:07,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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:17:07,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:07,948 INFO L225 Difference]: With dead ends: 197 [2025-01-09 22:17:07,948 INFO L226 Difference]: Without dead ends: 197 [2025-01-09 22:17:07,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:17:07,949 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 16 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:07,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 345 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:07,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-01-09 22:17:07,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2025-01-09 22:17:07,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 169 states have (on average 1.4142011834319526) internal successors, (239), 187 states have internal predecessors, (239), 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:17:07,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 239 transitions. [2025-01-09 22:17:07,954 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 239 transitions. Word has length 29 [2025-01-09 22:17:07,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:07,954 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 239 transitions. [2025-01-09 22:17:07,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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:17:07,954 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 239 transitions. [2025-01-09 22:17:07,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:17:07,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:07,955 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] [2025-01-09 22:17:07,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:17:07,955 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:07,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:07,955 INFO L85 PathProgramCache]: Analyzing trace with hash 656994050, now seen corresponding path program 1 times [2025-01-09 22:17:07,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:07,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318780896] [2025-01-09 22:17:07,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:07,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:07,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:17:07,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:17:07,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:07,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:08,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:08,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318780896] [2025-01-09 22:17:08,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318780896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:08,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:08,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:17:08,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992202246] [2025-01-09 22:17:08,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:08,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:17:08,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:08,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:17:08,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:17:08,030 INFO L87 Difference]: Start difference. First operand 188 states and 239 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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:17:08,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:08,150 INFO L93 Difference]: Finished difference Result 219 states and 276 transitions. [2025-01-09 22:17:08,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:17:08,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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 30 [2025-01-09 22:17:08,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:08,151 INFO L225 Difference]: With dead ends: 219 [2025-01-09 22:17:08,151 INFO L226 Difference]: Without dead ends: 219 [2025-01-09 22:17:08,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:17:08,152 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 78 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:08,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 268 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:08,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-01-09 22:17:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2025-01-09 22:17:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 189 states have (on average 1.4603174603174602) internal successors, (276), 207 states have internal predecessors, (276), 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:17:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 276 transitions. [2025-01-09 22:17:08,159 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 276 transitions. Word has length 30 [2025-01-09 22:17:08,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:08,159 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 276 transitions. [2025-01-09 22:17:08,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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:17:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 276 transitions. [2025-01-09 22:17:08,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:17:08,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:08,160 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-01-09 22:17:08,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 22:17:08,160 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:08,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:08,160 INFO L85 PathProgramCache]: Analyzing trace with hash 343955127, now seen corresponding path program 1 times [2025-01-09 22:17:08,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:08,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452617232] [2025-01-09 22:17:08,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:08,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:08,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:17:08,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:17:08,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:08,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:08,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:08,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:08,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452617232] [2025-01-09 22:17:08,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452617232] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:08,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040590630] [2025-01-09 22:17:08,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:08,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:08,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:08,213 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:17:08,232 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:17:08,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:17:08,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:17:08,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:08,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:08,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 22:17:08,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:08,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:17:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:08,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040590630] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:17:08,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:17:08,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-01-09 22:17:08,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927121157] [2025-01-09 22:17:08,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:17:08,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:17:08,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:08,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:17:08,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:17:08,426 INFO L87 Difference]: Start difference. First operand 208 states and 276 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:17:08,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:08,451 INFO L93 Difference]: Finished difference Result 265 states and 344 transitions. [2025-01-09 22:17:08,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:17:08,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 33 [2025-01-09 22:17:08,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:08,452 INFO L225 Difference]: With dead ends: 265 [2025-01-09 22:17:08,453 INFO L226 Difference]: Without dead ends: 265 [2025-01-09 22:17:08,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:17:08,453 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 70 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:08,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 205 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:17:08,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-09 22:17:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 250. [2025-01-09 22:17:08,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 231 states have (on average 1.4805194805194806) internal successors, (342), 249 states have internal predecessors, (342), 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:17:08,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 342 transitions. [2025-01-09 22:17:08,458 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 342 transitions. Word has length 33 [2025-01-09 22:17:08,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:08,459 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 342 transitions. [2025-01-09 22:17:08,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:17:08,459 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 342 transitions. [2025-01-09 22:17:08,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:17:08,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:08,459 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] [2025-01-09 22:17:08,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 22:17:08,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:08,663 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:08,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:08,663 INFO L85 PathProgramCache]: Analyzing trace with hash 343956471, now seen corresponding path program 1 times [2025-01-09 22:17:08,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:08,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796527898] [2025-01-09 22:17:08,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:08,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:08,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:17:08,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:17:08,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:08,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:08,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:08,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796527898] [2025-01-09 22:17:08,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796527898] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:08,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791371268] [2025-01-09 22:17:08,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:08,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:08,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:08,776 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:17:08,777 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:17:08,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:17:08,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:17:08,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:08,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:08,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 22:17:08,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:08,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 13 treesize of output 9 [2025-01-09 22:17:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:08,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:17:09,054 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.base_40| Int)) (or (= (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_40| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_40|) 0)))) is different from false [2025-01-09 22:17:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-01-09 22:17:09,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791371268] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:17:09,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:17:09,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 7 [2025-01-09 22:17:09,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376844462] [2025-01-09 22:17:09,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:17:09,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:17:09,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:09,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:17:09,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2025-01-09 22:17:09,078 INFO L87 Difference]: Start difference. First operand 250 states and 342 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 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:17:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:09,261 INFO L93 Difference]: Finished difference Result 255 states and 346 transitions. [2025-01-09 22:17:09,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:17:09,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 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 33 [2025-01-09 22:17:09,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:09,262 INFO L225 Difference]: With dead ends: 255 [2025-01-09 22:17:09,262 INFO L226 Difference]: Without dead ends: 244 [2025-01-09 22:17:09,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2025-01-09 22:17:09,263 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 6 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:09,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 316 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2025-01-09 22:17:09,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-01-09 22:17:09,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2025-01-09 22:17:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 224 states have (on average 1.4910714285714286) internal successors, (334), 242 states have internal predecessors, (334), 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:17:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 334 transitions. [2025-01-09 22:17:09,269 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 334 transitions. Word has length 33 [2025-01-09 22:17:09,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:09,269 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 334 transitions. [2025-01-09 22:17:09,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 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:17:09,269 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 334 transitions. [2025-01-09 22:17:09,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:17:09,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:09,270 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:09,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 22:17:09,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:09,471 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:09,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:09,471 INFO L85 PathProgramCache]: Analyzing trace with hash 219825338, now seen corresponding path program 1 times [2025-01-09 22:17:09,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:09,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473819360] [2025-01-09 22:17:09,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:09,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:09,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:17:09,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:17:09,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:09,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:09,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:09,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473819360] [2025-01-09 22:17:09,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473819360] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:09,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36388092] [2025-01-09 22:17:09,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:09,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:09,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:09,619 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:17:09,625 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:17:09,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:17:09,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:17:09,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:09,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:09,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 22:17:09,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:09,747 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:17:09,800 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:17:09,800 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 19 treesize of output 16 [2025-01-09 22:17:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:09,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:17:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:09,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36388092] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:17:09,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:17:09,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2025-01-09 22:17:09,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092418584] [2025-01-09 22:17:09,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:17:09,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:17:09,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:09,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:17:09,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:17:09,985 INFO L87 Difference]: Start difference. First operand 243 states and 334 transitions. Second operand has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 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:17:10,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:10,125 INFO L93 Difference]: Finished difference Result 264 states and 351 transitions. [2025-01-09 22:17:10,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:17:10,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 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:17:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:10,126 INFO L225 Difference]: With dead ends: 264 [2025-01-09 22:17:10,126 INFO L226 Difference]: Without dead ends: 264 [2025-01-09 22:17:10,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:17:10,128 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 173 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:10,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 171 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-01-09 22:17:10,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 242. [2025-01-09 22:17:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 224 states have (on average 1.4821428571428572) internal successors, (332), 241 states have internal predecessors, (332), 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:17:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 332 transitions. [2025-01-09 22:17:10,133 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 332 transitions. Word has length 36 [2025-01-09 22:17:10,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:10,133 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 332 transitions. [2025-01-09 22:17:10,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 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:17:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 332 transitions. [2025-01-09 22:17:10,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:17:10,134 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:10,134 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:10,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 22:17:10,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 22:17:10,334 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:10,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:10,335 INFO L85 PathProgramCache]: Analyzing trace with hash 219825339, now seen corresponding path program 1 times [2025-01-09 22:17:10,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:10,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679199453] [2025-01-09 22:17:10,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:10,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:10,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:17:10,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:17:10,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:10,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:10,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:10,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679199453] [2025-01-09 22:17:10,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679199453] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:10,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015992002] [2025-01-09 22:17:10,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:10,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:10,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:10,516 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:17:10,518 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:17:10,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:17:10,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:17:10,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:10,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:10,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:17:10,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:10,650 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:17:10,656 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:17:10,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:17:10,784 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:17:10,790 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:17:10,791 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:17:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:10,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:17:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:11,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015992002] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:17:11,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:17:11,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2025-01-09 22:17:11,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630329317] [2025-01-09 22:17:11,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:17:11,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:17:11,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:11,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:17:11,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:17:11,210 INFO L87 Difference]: Start difference. First operand 242 states and 332 transitions. Second operand has 10 states, 9 states have (on average 10.88888888888889) internal successors, (98), 10 states have internal predecessors, (98), 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:17:11,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:11,431 INFO L93 Difference]: Finished difference Result 263 states and 349 transitions. [2025-01-09 22:17:11,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:17:11,432 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.88888888888889) internal successors, (98), 10 states have internal predecessors, (98), 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:17:11,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:11,433 INFO L225 Difference]: With dead ends: 263 [2025-01-09 22:17:11,433 INFO L226 Difference]: Without dead ends: 263 [2025-01-09 22:17:11,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:17:11,433 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 230 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:11,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 212 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:17:11,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-09 22:17:11,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 241. [2025-01-09 22:17:11,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 224 states have (on average 1.4732142857142858) internal successors, (330), 240 states have internal predecessors, (330), 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:17:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 330 transitions. [2025-01-09 22:17:11,439 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 330 transitions. Word has length 36 [2025-01-09 22:17:11,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:11,439 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 330 transitions. [2025-01-09 22:17:11,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.88888888888889) internal successors, (98), 10 states have internal predecessors, (98), 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:17:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 330 transitions. [2025-01-09 22:17:11,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 22:17:11,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:11,440 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:17:11,448 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:17:11,640 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,SelfDestructingSolverStorable22 [2025-01-09 22:17:11,641 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:11,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:11,641 INFO L85 PathProgramCache]: Analyzing trace with hash -882570338, now seen corresponding path program 1 times [2025-01-09 22:17:11,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:11,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230915655] [2025-01-09 22:17:11,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:11,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:11,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:17:11,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:17:11,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:11,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:11,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:11,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230915655] [2025-01-09 22:17:11,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230915655] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:11,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051809259] [2025-01-09 22:17:11,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:11,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:11,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:11,941 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:17:11,942 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:17:12,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:17:12,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:17:12,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:12,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:12,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:17:12,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:12,093 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:17:12,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:17:12,134 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-01-09 22:17:12,135 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 16 treesize of output 18 [2025-01-09 22:17:12,193 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-01-09 22:17:12,193 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2025-01-09 22:17:12,231 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-09 22:17:12,231 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 28 treesize of output 12 [2025-01-09 22:17:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:12,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:17:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:12,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051809259] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:17:12,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:17:12,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 11 [2025-01-09 22:17:12,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969988712] [2025-01-09 22:17:12,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:17:12,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:17:12,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:12,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:17:12,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:17:12,301 INFO L87 Difference]: Start difference. First operand 241 states and 330 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 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:17:12,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:12,519 INFO L93 Difference]: Finished difference Result 240 states and 328 transitions. [2025-01-09 22:17:12,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:17:12,519 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 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 38 [2025-01-09 22:17:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:12,520 INFO L225 Difference]: With dead ends: 240 [2025-01-09 22:17:12,520 INFO L226 Difference]: Without dead ends: 240 [2025-01-09 22:17:12,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:17:12,521 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 21 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:12,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 311 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:17:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-01-09 22:17:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-01-09 22:17:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 224 states have (on average 1.4642857142857142) internal successors, (328), 239 states have internal predecessors, (328), 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:17:12,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 328 transitions. [2025-01-09 22:17:12,528 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 328 transitions. Word has length 38 [2025-01-09 22:17:12,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:12,528 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 328 transitions. [2025-01-09 22:17:12,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 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:17:12,529 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 328 transitions. [2025-01-09 22:17:12,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 22:17:12,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:12,530 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:17:12,538 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:17:12,730 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,SelfDestructingSolverStorable23 [2025-01-09 22:17:12,731 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:12,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:12,732 INFO L85 PathProgramCache]: Analyzing trace with hash -882570337, now seen corresponding path program 1 times [2025-01-09 22:17:12,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:12,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752309776] [2025-01-09 22:17:12,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:12,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:12,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:17:12,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:17:12,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:12,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:13,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:13,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752309776] [2025-01-09 22:17:13,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752309776] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:13,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117540356] [2025-01-09 22:17:13,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:13,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:13,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:13,137 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:17:13,139 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:17:13,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:17:13,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:17:13,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:13,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:13,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 22:17:13,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:13,297 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:17:13,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:17:13,340 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:17:13,376 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-01-09 22:17:13,376 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 16 treesize of output 18 [2025-01-09 22:17:13,458 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-01-09 22:17:13,458 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2025-01-09 22:17:13,473 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-01-09 22:17:13,474 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-01-09 22:17:13,553 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-09 22:17:13,554 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 28 treesize of output 12 [2025-01-09 22:17:13,560 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-09 22:17:13,561 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 15 treesize of output 7 [2025-01-09 22:17:13,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:13,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:17:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:13,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117540356] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:17:13,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:17:13,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2025-01-09 22:17:13,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107803535] [2025-01-09 22:17:13,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:17:13,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:17:13,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:13,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:17:13,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:17:13,792 INFO L87 Difference]: Start difference. First operand 240 states and 328 transitions. Second operand has 16 states, 15 states have (on average 4.4) internal successors, (66), 16 states have internal predecessors, (66), 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:17:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:14,197 INFO L93 Difference]: Finished difference Result 248 states and 335 transitions. [2025-01-09 22:17:14,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:17:14,198 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 16 states have internal predecessors, (66), 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 38 [2025-01-09 22:17:14,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:14,199 INFO L225 Difference]: With dead ends: 248 [2025-01-09 22:17:14,199 INFO L226 Difference]: Without dead ends: 248 [2025-01-09 22:17:14,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2025-01-09 22:17:14,200 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 26 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:14,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 484 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:17:14,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-01-09 22:17:14,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 225. [2025-01-09 22:17:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 210 states have (on average 1.4857142857142858) internal successors, (312), 224 states have internal predecessors, (312), 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:17:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 312 transitions. [2025-01-09 22:17:14,206 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 312 transitions. Word has length 38 [2025-01-09 22:17:14,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:14,206 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 312 transitions. [2025-01-09 22:17:14,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 16 states have internal predecessors, (66), 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:17:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 312 transitions. [2025-01-09 22:17:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:17:14,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:14,207 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:14,216 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:17:14,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:14,412 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:14,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:14,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1961143153, now seen corresponding path program 1 times [2025-01-09 22:17:14,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:14,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798562503] [2025-01-09 22:17:14,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:14,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:14,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:17:14,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:17:14,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:14,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:14,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:14,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798562503] [2025-01-09 22:17:14,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798562503] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:14,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645539102] [2025-01-09 22:17:14,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:14,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:14,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:14,851 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:17:14,853 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:17:14,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:17:14,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:17:14,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:14,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:15,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:17:15,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:15,010 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:17:15,012 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:17:15,034 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:17:15,049 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 19 treesize of output 18 [2025-01-09 22:17:15,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-01-09 22:17:15,151 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:17:15,152 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 14 treesize of output 13 [2025-01-09 22:17:15,167 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:17:15,167 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:17:15,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2025-01-09 22:17:15,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2025-01-09 22:17:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:15,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:17:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:15,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645539102] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:17:15,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:17:15,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 4] total 16 [2025-01-09 22:17:15,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758979652] [2025-01-09 22:17:15,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:17:15,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:17:15,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:15,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:17:15,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:17:15,626 INFO L87 Difference]: Start difference. First operand 225 states and 312 transitions. Second operand has 17 states, 16 states have (on average 5.5625) internal successors, (89), 17 states have internal predecessors, (89), 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:17:15,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:15,996 INFO L93 Difference]: Finished difference Result 273 states and 364 transitions. [2025-01-09 22:17:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:17:15,997 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.5625) internal successors, (89), 17 states have internal predecessors, (89), 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:17:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:15,998 INFO L225 Difference]: With dead ends: 273 [2025-01-09 22:17:15,998 INFO L226 Difference]: Without dead ends: 273 [2025-01-09 22:17:15,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2025-01-09 22:17:15,999 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 88 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:15,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 313 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:17:16,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-01-09 22:17:16,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 247. [2025-01-09 22:17:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 232 states have (on average 1.456896551724138) internal successors, (338), 246 states have internal predecessors, (338), 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:17:16,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 338 transitions. [2025-01-09 22:17:16,004 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 338 transitions. Word has length 39 [2025-01-09 22:17:16,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:16,004 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 338 transitions. [2025-01-09 22:17:16,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.5625) internal successors, (89), 17 states have internal predecessors, (89), 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:17:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 338 transitions. [2025-01-09 22:17:16,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:17:16,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:16,005 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:16,014 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:17:16,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 22:17:16,210 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:16,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:16,210 INFO L85 PathProgramCache]: Analyzing trace with hash -832071118, now seen corresponding path program 1 times [2025-01-09 22:17:16,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:16,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775391210] [2025-01-09 22:17:16,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:16,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:16,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:17:16,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:17:16,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:16,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:16,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:16,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:16,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775391210] [2025-01-09 22:17:16,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775391210] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:16,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743154631] [2025-01-09 22:17:16,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:16,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:16,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:16,639 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:17:16,641 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:17:16,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:17:16,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:17:16,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:16,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:16,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 22:17:16,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:17:16,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:17:16,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743154631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:16,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:17:16,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2025-01-09 22:17:16,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692815405] [2025-01-09 22:17:16,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:16,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:17:16,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:16,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:17:16,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:17:16,884 INFO L87 Difference]: Start difference. First operand 247 states and 338 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 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:17:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:16,995 INFO L93 Difference]: Finished difference Result 254 states and 336 transitions. [2025-01-09 22:17:16,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:17:16,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 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 41 [2025-01-09 22:17:16,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:16,996 INFO L225 Difference]: With dead ends: 254 [2025-01-09 22:17:16,996 INFO L226 Difference]: Without dead ends: 254 [2025-01-09 22:17:16,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:17:16,998 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 56 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:16,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 175 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-01-09 22:17:17,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 247. [2025-01-09 22:17:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 232 states have (on average 1.4482758620689655) internal successors, (336), 246 states have internal predecessors, (336), 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:17:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 336 transitions. [2025-01-09 22:17:17,003 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 336 transitions. Word has length 41 [2025-01-09 22:17:17,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:17,003 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 336 transitions. [2025-01-09 22:17:17,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 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:17:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 336 transitions. [2025-01-09 22:17:17,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:17:17,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:17,005 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:17,013 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:17:17,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:17,209 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:17,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:17,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1974350711, now seen corresponding path program 1 times [2025-01-09 22:17:17,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:17,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950272988] [2025-01-09 22:17:17,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:17,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:17,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:17:17,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:17:17,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:17,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:17,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:17:17,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:17,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950272988] [2025-01-09 22:17:17,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950272988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:17,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:17,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:17:17,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612380427] [2025-01-09 22:17:17,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:17,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:17:17,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:17,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:17:17,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:17:17,322 INFO L87 Difference]: Start difference. First operand 247 states and 336 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 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:17:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:17,380 INFO L93 Difference]: Finished difference Result 255 states and 332 transitions. [2025-01-09 22:17:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:17:17,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 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 44 [2025-01-09 22:17:17,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:17,381 INFO L225 Difference]: With dead ends: 255 [2025-01-09 22:17:17,381 INFO L226 Difference]: Without dead ends: 255 [2025-01-09 22:17:17,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:17:17,382 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:17,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 168 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:17:17,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-01-09 22:17:17,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 205. [2025-01-09 22:17:17,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 190 states have (on average 1.4210526315789473) internal successors, (270), 204 states have internal predecessors, (270), 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:17:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 270 transitions. [2025-01-09 22:17:17,390 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 270 transitions. Word has length 44 [2025-01-09 22:17:17,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:17,390 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 270 transitions. [2025-01-09 22:17:17,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 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:17:17,390 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 270 transitions. [2025-01-09 22:17:17,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:17:17,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:17,391 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:17,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 22:17:17,391 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:17,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:17,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1974351414, now seen corresponding path program 1 times [2025-01-09 22:17:17,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:17,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398811763] [2025-01-09 22:17:17,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:17,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:17,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:17:17,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:17:17,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:17,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:17,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:17,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398811763] [2025-01-09 22:17:17,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398811763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:17,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:17,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:17:17,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779146364] [2025-01-09 22:17:17,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:17,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:17:17,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:17,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:17:17,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:17:17,544 INFO L87 Difference]: Start difference. First operand 205 states and 270 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 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:17:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:17,746 INFO L93 Difference]: Finished difference Result 241 states and 317 transitions. [2025-01-09 22:17:17,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:17:17,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 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 44 [2025-01-09 22:17:17,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:17,748 INFO L225 Difference]: With dead ends: 241 [2025-01-09 22:17:17,748 INFO L226 Difference]: Without dead ends: 241 [2025-01-09 22:17:17,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:17:17,749 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 35 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:17,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 259 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:17:17,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-01-09 22:17:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 218. [2025-01-09 22:17:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 203 states have (on average 1.4236453201970443) internal successors, (289), 217 states have internal predecessors, (289), 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:17:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 289 transitions. [2025-01-09 22:17:17,757 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 289 transitions. Word has length 44 [2025-01-09 22:17:17,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:17,758 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 289 transitions. [2025-01-09 22:17:17,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 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:17:17,758 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 289 transitions. [2025-01-09 22:17:17,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:17:17,758 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:17,758 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:17,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 22:17:17,759 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:17,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:17,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1974351413, now seen corresponding path program 1 times [2025-01-09 22:17:17,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:17,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518553376] [2025-01-09 22:17:17,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:17,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:17,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:17:17,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:17:17,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:17,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:18,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:18,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518553376] [2025-01-09 22:17:18,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518553376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:18,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:18,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:17:18,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724421337] [2025-01-09 22:17:18,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:18,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:17:18,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:18,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:17:18,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:17:18,049 INFO L87 Difference]: Start difference. First operand 218 states and 289 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 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:17:18,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:18,290 INFO L93 Difference]: Finished difference Result 254 states and 331 transitions. [2025-01-09 22:17:18,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:17:18,290 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 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 44 [2025-01-09 22:17:18,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:18,292 INFO L225 Difference]: With dead ends: 254 [2025-01-09 22:17:18,292 INFO L226 Difference]: Without dead ends: 254 [2025-01-09 22:17:18,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:17:18,293 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 32 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:18,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 367 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:17:18,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-01-09 22:17:18,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 218. [2025-01-09 22:17:18,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 203 states have (on average 1.4137931034482758) internal successors, (287), 217 states have internal predecessors, (287), 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:17:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 287 transitions. [2025-01-09 22:17:18,299 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 287 transitions. Word has length 44 [2025-01-09 22:17:18,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:18,299 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 287 transitions. [2025-01-09 22:17:18,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 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:17:18,300 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 287 transitions. [2025-01-09 22:17:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 22:17:18,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:18,300 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:18,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 22:17:18,301 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:18,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:18,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1023839115, now seen corresponding path program 1 times [2025-01-09 22:17:18,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:18,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512785147] [2025-01-09 22:17:18,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:18,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:18,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:17:18,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:17:18,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:18,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:17:18,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:18,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512785147] [2025-01-09 22:17:18,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512785147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:18,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:18,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:17:18,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917198820] [2025-01-09 22:17:18,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:18,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:17:18,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:18,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:17:18,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:17:18,376 INFO L87 Difference]: Start difference. First operand 218 states and 287 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 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:17:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:18,440 INFO L93 Difference]: Finished difference Result 219 states and 281 transitions. [2025-01-09 22:17:18,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:17:18,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 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 46 [2025-01-09 22:17:18,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:18,441 INFO L225 Difference]: With dead ends: 219 [2025-01-09 22:17:18,441 INFO L226 Difference]: Without dead ends: 219 [2025-01-09 22:17:18,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:17:18,442 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 6 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:18,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 130 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:17:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-01-09 22:17:18,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2025-01-09 22:17:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 203 states have (on average 1.3694581280788178) internal successors, (278), 215 states have internal predecessors, (278), 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:17:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 278 transitions. [2025-01-09 22:17:18,447 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 278 transitions. Word has length 46 [2025-01-09 22:17:18,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:18,448 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 278 transitions. [2025-01-09 22:17:18,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 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:17:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 278 transitions. [2025-01-09 22:17:18,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 22:17:18,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:18,448 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:18,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 22:17:18,450 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:18,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:18,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1023839116, now seen corresponding path program 1 times [2025-01-09 22:17:18,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:18,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473234977] [2025-01-09 22:17:18,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:18,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:18,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:17:18,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:17:18,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:18,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:18,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:18,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:18,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473234977] [2025-01-09 22:17:18,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473234977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:18,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:18,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:17:18,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762826673] [2025-01-09 22:17:18,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:18,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:17:18,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:18,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:17:18,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:17:18,798 INFO L87 Difference]: Start difference. First operand 216 states and 278 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 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:17:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:19,137 INFO L93 Difference]: Finished difference Result 260 states and 333 transitions. [2025-01-09 22:17:19,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:17:19,138 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 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 46 [2025-01-09 22:17:19,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:19,138 INFO L225 Difference]: With dead ends: 260 [2025-01-09 22:17:19,139 INFO L226 Difference]: Without dead ends: 260 [2025-01-09 22:17:19,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:17:19,139 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 41 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:19,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 439 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:17:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-01-09 22:17:19,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 220. [2025-01-09 22:17:19,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 207 states have (on average 1.3623188405797102) internal successors, (282), 219 states have internal predecessors, (282), 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:17:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 282 transitions. [2025-01-09 22:17:19,145 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 282 transitions. Word has length 46 [2025-01-09 22:17:19,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:19,145 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 282 transitions. [2025-01-09 22:17:19,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 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:17:19,145 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 282 transitions. [2025-01-09 22:17:19,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 22:17:19,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:19,146 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:19,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 22:17:19,146 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:19,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:19,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1013642510, now seen corresponding path program 1 times [2025-01-09 22:17:19,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:19,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609944686] [2025-01-09 22:17:19,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:19,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:19,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 22:17:19,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:17:19,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:19,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:19,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:19,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609944686] [2025-01-09 22:17:19,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609944686] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:19,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398528643] [2025-01-09 22:17:19,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:19,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:19,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:19,330 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:17:19,332 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:17:19,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 22:17:19,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:17:19,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:19,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:19,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 22:17:19,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:19,519 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:17:19,565 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:17:19,566 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:17:19,605 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:17:19,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:17:19,659 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 16 treesize of output 16 [2025-01-09 22:17:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:19,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:17:19,812 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 11 treesize of output 9 [2025-01-09 22:17:19,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 20 treesize of output 18 [2025-01-09 22:17:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:19,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398528643] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:17:19,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:17:19,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2025-01-09 22:17:19,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673968005] [2025-01-09 22:17:19,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:17:19,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:17:19,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:19,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:17:19,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:17:19,935 INFO L87 Difference]: Start difference. First operand 220 states and 282 transitions. Second operand has 20 states, 20 states have (on average 5.1) internal successors, (102), 20 states have internal predecessors, (102), 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:17:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:20,464 INFO L93 Difference]: Finished difference Result 274 states and 342 transitions. [2025-01-09 22:17:20,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:17:20,465 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.1) internal successors, (102), 20 states have internal predecessors, (102), 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 48 [2025-01-09 22:17:20,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:20,466 INFO L225 Difference]: With dead ends: 274 [2025-01-09 22:17:20,466 INFO L226 Difference]: Without dead ends: 274 [2025-01-09 22:17:20,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2025-01-09 22:17:20,467 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 90 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:20,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 794 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:17:20,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-01-09 22:17:20,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 220. [2025-01-09 22:17:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 207 states have (on average 1.3526570048309179) internal successors, (280), 219 states have internal predecessors, (280), 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:17:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 280 transitions. [2025-01-09 22:17:20,471 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 280 transitions. Word has length 48 [2025-01-09 22:17:20,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:20,472 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 280 transitions. [2025-01-09 22:17:20,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.1) internal successors, (102), 20 states have internal predecessors, (102), 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:17:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 280 transitions. [2025-01-09 22:17:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 22:17:20,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:20,472 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:20,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 22:17:20,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:20,677 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:20,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:20,677 INFO L85 PathProgramCache]: Analyzing trace with hash 361882059, now seen corresponding path program 1 times [2025-01-09 22:17:20,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:20,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318872124] [2025-01-09 22:17:20,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:20,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:20,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 22:17:20,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:17:20,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:20,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:20,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:20,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318872124] [2025-01-09 22:17:20,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318872124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:20,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:20,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:17:20,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777805261] [2025-01-09 22:17:20,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:20,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:17:20,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:20,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:17:20,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:17:20,951 INFO L87 Difference]: Start difference. First operand 220 states and 280 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 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:17:21,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:21,263 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2025-01-09 22:17:21,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:17:21,263 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 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 48 [2025-01-09 22:17:21,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:21,269 INFO L225 Difference]: With dead ends: 258 [2025-01-09 22:17:21,269 INFO L226 Difference]: Without dead ends: 258 [2025-01-09 22:17:21,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:17:21,270 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 36 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:21,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 525 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:17:21,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-01-09 22:17:21,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 224. [2025-01-09 22:17:21,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 211 states have (on average 1.3554502369668247) internal successors, (286), 223 states have internal predecessors, (286), 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:17:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 286 transitions. [2025-01-09 22:17:21,276 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 286 transitions. Word has length 48 [2025-01-09 22:17:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:21,276 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 286 transitions. [2025-01-09 22:17:21,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 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:17:21,276 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 286 transitions. [2025-01-09 22:17:21,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:17:21,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:21,277 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:21,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 22:17:21,277 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:21,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1666557891, now seen corresponding path program 1 times [2025-01-09 22:17:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:21,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374942278] [2025-01-09 22:17:21,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:21,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:21,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:17:21,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:17:21,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:21,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:21,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:21,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374942278] [2025-01-09 22:17:21,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374942278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:17:21,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:17:21,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:17:21,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199253262] [2025-01-09 22:17:21,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:17:21,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:17:21,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:21,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:17:21,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:17:21,464 INFO L87 Difference]: Start difference. First operand 224 states and 286 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 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:17:21,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:17:21,710 INFO L93 Difference]: Finished difference Result 262 states and 331 transitions. [2025-01-09 22:17:21,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:17:21,710 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 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 49 [2025-01-09 22:17:21,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:17:21,712 INFO L225 Difference]: With dead ends: 262 [2025-01-09 22:17:21,713 INFO L226 Difference]: Without dead ends: 262 [2025-01-09 22:17:21,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:17:21,713 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 41 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:17:21,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 466 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:17:21,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-01-09 22:17:21,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 226. [2025-01-09 22:17:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 213 states have (on average 1.352112676056338) internal successors, (288), 225 states have internal predecessors, (288), 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:17:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 288 transitions. [2025-01-09 22:17:21,720 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 288 transitions. Word has length 49 [2025-01-09 22:17:21,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:17:21,720 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 288 transitions. [2025-01-09 22:17:21,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 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:17:21,720 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 288 transitions. [2025-01-09 22:17:21,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:17:21,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:17:21,723 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:17:21,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 22:17:21,723 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:17:21,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:17:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1388670552, now seen corresponding path program 1 times [2025-01-09 22:17:21,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:17:21,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702621845] [2025-01-09 22:17:21,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:21,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:17:21,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:17:21,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:17:21,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:21,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:22,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:17:22,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702621845] [2025-01-09 22:17:22,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702621845] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:17:22,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045634163] [2025-01-09 22:17:22,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:17:22,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:17:22,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:17:22,274 INFO L229 MonitoredProcess]: Starting monitored process 12 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:17:22,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 22:17:22,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:17:22,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:17:22,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:17:22,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:17:22,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-01-09 22:17:22,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:17:22,481 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:17:22,501 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:17:22,505 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:17:22,536 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:17:22,541 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 19 treesize of output 18 [2025-01-09 22:17:22,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-01-09 22:17:22,586 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:17:22,757 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:17:22,759 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:17:22,817 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 16 [2025-01-09 22:17:22,827 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 16 treesize of output 11 [2025-01-09 22:17:22,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 16 treesize of output 11 [2025-01-09 22:17:22,846 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 16 [2025-01-09 22:17:22,862 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 16 [2025-01-09 22:17:22,869 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 16 treesize of output 11 [2025-01-09 22:17:22,882 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 16 [2025-01-09 22:17:22,890 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 16 treesize of output 11 [2025-01-09 22:17:22,904 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 16 treesize of output 11 [2025-01-09 22:17:22,918 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 16 [2025-01-09 22:17:23,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:17:23,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:17:23,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2025-01-09 22:17:23,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:17:23,015 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 27 treesize of output 11 [2025-01-09 22:17:23,063 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:17:23,063 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 65 treesize of output 58 [2025-01-09 22:17:23,068 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 28 treesize of output 11 [2025-01-09 22:17:23,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:17:23,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:17:23,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:17:23,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 14 [2025-01-09 22:17:23,261 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 7 treesize of output 3 [2025-01-09 22:17:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:23,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:17:23,406 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2224 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2224) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) (forall ((v_ArrVal_2225 (Array Int Int))) (= |c_ULTIMATE.start_main_~first~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2225) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|)))) is different from false [2025-01-09 22:17:30,250 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:17:30,251 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:17:30,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:17:30,256 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 28 treesize of output 39 [2025-01-09 22:17:30,259 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:17:30,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:17:30,261 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 1 case distinctions, treesize of input 54 treesize of output 28 [2025-01-09 22:17:30,262 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 5 treesize of output 3 [2025-01-09 22:17:30,266 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:17:30,267 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:17:30,270 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-01-09 22:17:30,270 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 28 treesize of output 1 [2025-01-09 22:17:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:17:30,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045634163] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:17:30,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:17:30,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 33 [2025-01-09 22:17:30,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090202690] [2025-01-09 22:17:30,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:17:30,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 22:17:30,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:17:30,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 22:17:30,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=875, Unknown=14, NotChecked=60, Total=1056 [2025-01-09 22:17:30,299 INFO L87 Difference]: Start difference. First operand 226 states and 288 transitions. Second operand has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 33 states have internal predecessors, (135), 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:17:34,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:17:38,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:17:42,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:17:46,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:17:50,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:17:54,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:17:58,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:18:03,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:18:03,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:03,487 INFO L93 Difference]: Finished difference Result 273 states and 340 transitions. [2025-01-09 22:18:03,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 22:18:03,488 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 33 states have internal predecessors, (135), 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 49 [2025-01-09 22:18:03,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:03,489 INFO L225 Difference]: With dead ends: 273 [2025-01-09 22:18:03,489 INFO L226 Difference]: Without dead ends: 273 [2025-01-09 22:18:03,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=290, Invalid=1862, Unknown=14, NotChecked=90, Total=2256 [2025-01-09 22:18:03,490 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 129 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 26 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:03,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1171 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1165 Invalid, 8 Unknown, 107 Unchecked, 32.7s Time] [2025-01-09 22:18:03,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-01-09 22:18:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 246. [2025-01-09 22:18:03,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 233 states have (on average 1.3433476394849786) internal successors, (313), 245 states have internal predecessors, (313), 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:18:03,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 313 transitions. [2025-01-09 22:18:03,496 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 313 transitions. Word has length 49 [2025-01-09 22:18:03,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:03,497 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 313 transitions. [2025-01-09 22:18:03,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 33 states have internal predecessors, (135), 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:18:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 313 transitions. [2025-01-09 22:18:03,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 22:18:03,498 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:03,498 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:03,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 22:18:03,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-01-09 22:18:03,702 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:18:03,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash -123441330, now seen corresponding path program 1 times [2025-01-09 22:18:03,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:03,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380400415] [2025-01-09 22:18:03,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:03,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:03,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:18:03,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:18:03,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:03,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:04,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:04,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380400415] [2025-01-09 22:18:04,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380400415] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:18:04,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265885820] [2025-01-09 22:18:04,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:04,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:18:04,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:18:04,548 INFO L229 MonitoredProcess]: Starting monitored process 13 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:18:04,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 22:18:04,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:18:04,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:18:04,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:04,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:04,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 22:18:04,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:18:04,776 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:18:04,801 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 19 treesize of output 18 [2025-01-09 22:18:04,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:18:04,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-01-09 22:18:04,911 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-01-09 22:18:04,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2025-01-09 22:18:05,028 INFO L349 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2025-01-09 22:18:05,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 49 [2025-01-09 22:18:05,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2025-01-09 22:18:05,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-01-09 22:18:05,097 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 22 [2025-01-09 22:18:05,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:18:05,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2025-01-09 22:18:05,165 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:18:05,183 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-01-09 22:18:05,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2025-01-09 22:18:05,432 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 7 treesize of output 3 [2025-01-09 22:18:05,568 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:18:05,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 17 [2025-01-09 22:18:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:05,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:18:06,055 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2360 (Array Int Int))) (or (= |ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base|)) |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2360) |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) 1))) (or (forall ((|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2360 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base|)) |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2360) |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) 1)) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.offset|))) is different from false [2025-01-09 22:18:06,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:18:06,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 136 [2025-01-09 22:18:06,233 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse5 (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| v_prenex_3 (store (select |c_#memory_$Pointer$#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.offset| .cse2)) .cse2 v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))) (.cse3 (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.offset|))) (and (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#1.base| v_prenex_3 (store (select |c_#memory_$Pointer$#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.offset| .cse2)) .cse2 v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.offset|))) (or (forall ((|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2360 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| .cse2)) .cse2 v_ArrVal_2360) |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse1 .cse0)))) (= .cse1 |c_ULTIMATE.start_main_~x~0#1.base|)))) (or .cse3 (forall ((v_prenex_3 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.base| v_prenex_3 (store (select |c_#memory_$Pointer$#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.offset| .cse2)) .cse2 v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.offset|))) (or (= .cse4 (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| .cse2)) .cse2 v_ArrVal_2360) |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (= .cse4 |c_ULTIMATE.start_main_~x~0#1.base|))))) (or .cse5 (forall ((|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2360 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| .cse2)) .cse2 v_ArrVal_2360) |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)))) (or (forall ((|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2360 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| .cse2)) .cse2 v_ArrVal_2360) |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) .cse5 .cse3) (forall ((v_prenex_3 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| .cse2)) .cse2 v_ArrVal_2360) |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (or (= .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$#1.base| v_prenex_3 (store (select |c_#memory_$Pointer$#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.offset| .cse2)) .cse2 v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.offset|) .cse6)))) (or (forall ((v_prenex_3 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| .cse2)) .cse2 v_ArrVal_2360) |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (.cse8 (select (select (store (store |c_#memory_$Pointer$#1.base| v_prenex_3 (store (select |c_#memory_$Pointer$#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.offset| .cse2)) .cse2 v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.offset|))) (or (= .cse7 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse8 .cse7) (= .cse8 |c_ULTIMATE.start_main_~x~0#1.base|)))) .cse3)))) is different from false [2025-01-09 22:18:06,360 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse0 (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| v_prenex_3 (store (select |c_#memory_$Pointer$#1.base| v_prenex_3) 0 .cse1)) .cse1 v_prenex_4) v_prenex_3) 0) |c_ULTIMATE.start_main_~x~0#1.base|))) (.cse4 (= |c_ULTIMATE.start_main_~x~0#1.offset| 0))) (and (or .cse0 (forall ((|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2360 (Array Int Int))) (or (= |ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) 0 .cse1)) .cse1 v_ArrVal_2360) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$#1.base| v_prenex_3 (store (select |c_#memory_$Pointer$#1.base| v_prenex_3) 0 .cse1)) .cse1 v_prenex_4) v_prenex_3) 0))) (or (= .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) 0 .cse1)) .cse1 v_ArrVal_2360) |ULTIMATE.start_main_~y~0#1.base|) 0))) (or (= |ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse2 .cse3))))))) (or .cse4 (forall ((v_prenex_3 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.base| v_prenex_3 (store (select |c_#memory_$Pointer$#1.base| v_prenex_3) 0 .cse1)) .cse1 v_prenex_4) v_prenex_3) 0)) (.cse6 (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) 0 .cse1)) .cse1 v_ArrVal_2360) |ULTIMATE.start_main_~y~0#1.base|) 0))) (or (= .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse5 .cse6))))) (forall ((v_prenex_3 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) 0 .cse1)) .cse1 v_ArrVal_2360) |ULTIMATE.start_main_~y~0#1.base|) 0))) (or (= |ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse7 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$#1.base| v_prenex_3 (store (select |c_#memory_$Pointer$#1.base| v_prenex_3) 0 .cse1)) .cse1 v_prenex_4) v_prenex_3) 0) .cse7)))) (or (forall ((|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2360 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) 0 .cse1)) .cse1 v_ArrVal_2360) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)) .cse4 .cse0) (or .cse4 (forall ((v_prenex_3 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$#1.base| v_prenex_3 (store (select |c_#memory_$Pointer$#1.base| v_prenex_3) 0 .cse1)) .cse1 v_prenex_4) v_prenex_3) 0))) (or (= .cse8 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse8 (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base|) 0 .cse1)) .cse1 v_ArrVal_2360) |ULTIMATE.start_main_~y~0#1.base|) 0))))))))) is different from false [2025-01-09 22:18:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-01-09 22:18:06,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265885820] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:18:06,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:18:06,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 17] total 44 [2025-01-09 22:18:06,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977221273] [2025-01-09 22:18:06,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:18:06,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-09 22:18:06,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:06,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-09 22:18:06,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1507, Unknown=10, NotChecked=240, Total=1892 [2025-01-09 22:18:06,763 INFO L87 Difference]: Start difference. First operand 246 states and 313 transitions. Second operand has 44 states, 44 states have (on average 2.840909090909091) internal successors, (125), 44 states have internal predecessors, (125), 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:18:08,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:08,303 INFO L93 Difference]: Finished difference Result 353 states and 431 transitions. [2025-01-09 22:18:08,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 22:18:08,303 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.840909090909091) internal successors, (125), 44 states have internal predecessors, (125), 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 50 [2025-01-09 22:18:08,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:08,304 INFO L225 Difference]: With dead ends: 353 [2025-01-09 22:18:08,304 INFO L226 Difference]: Without dead ends: 353 [2025-01-09 22:18:08,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=344, Invalid=3440, Unknown=10, NotChecked=366, Total=4160 [2025-01-09 22:18:08,306 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 138 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 324 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:08,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1155 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1304 Invalid, 0 Unknown, 324 Unchecked, 0.7s Time] [2025-01-09 22:18:08,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-01-09 22:18:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 321. [2025-01-09 22:18:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 308 states have (on average 1.2954545454545454) internal successors, (399), 320 states have internal predecessors, (399), 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:18:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 399 transitions. [2025-01-09 22:18:08,312 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 399 transitions. Word has length 50 [2025-01-09 22:18:08,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:08,313 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 399 transitions. [2025-01-09 22:18:08,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.840909090909091) internal successors, (125), 44 states have internal predecessors, (125), 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:18:08,314 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 399 transitions. [2025-01-09 22:18:08,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 22:18:08,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:08,314 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:08,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 22:18:08,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:18:08,515 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:18:08,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:08,516 INFO L85 PathProgramCache]: Analyzing trace with hash -90905519, now seen corresponding path program 2 times [2025-01-09 22:18:08,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:08,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709366378] [2025-01-09 22:18:08,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:18:08,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:08,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-01-09 22:18:08,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:18:08,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:18:08,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:18:08,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:08,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709366378] [2025-01-09 22:18:08,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709366378] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:18:08,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668403010] [2025-01-09 22:18:08,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:18:08,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:18:08,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:18:08,570 INFO L229 MonitoredProcess]: Starting monitored process 14 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:18:08,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 22:18:08,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-01-09 22:18:08,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:18:08,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:18:08,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:08,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:18:08,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:18:08,806 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:18:08,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:18:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:18:08,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668403010] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:18:08,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:18:08,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-01-09 22:18:08,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47621321] [2025-01-09 22:18:08,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:18:08,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:18:08,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:08,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:18:08,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:18:08,840 INFO L87 Difference]: Start difference. First operand 321 states and 399 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:18:08,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:08,894 INFO L93 Difference]: Finished difference Result 281 states and 346 transitions. [2025-01-09 22:18:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:18:08,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 50 [2025-01-09 22:18:08,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:08,896 INFO L225 Difference]: With dead ends: 281 [2025-01-09 22:18:08,896 INFO L226 Difference]: Without dead ends: 281 [2025-01-09 22:18:08,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:18:08,896 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 38 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:08,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 168 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:18:08,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-01-09 22:18:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 259. [2025-01-09 22:18:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 246 states have (on average 1.3008130081300813) internal successors, (320), 258 states have internal predecessors, (320), 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:18:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 320 transitions. [2025-01-09 22:18:08,901 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 320 transitions. Word has length 50 [2025-01-09 22:18:08,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:08,901 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 320 transitions. [2025-01-09 22:18:08,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:18:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 320 transitions. [2025-01-09 22:18:08,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 22:18:08,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:08,902 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 22:18:08,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 22:18:09,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:18:09,103 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:18:09,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:09,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1573020324, now seen corresponding path program 1 times [2025-01-09 22:18:09,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:09,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587340362] [2025-01-09 22:18:09,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:09,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:09,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 22:18:09,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:18:09,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:09,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:09,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587340362] [2025-01-09 22:18:09,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587340362] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:18:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399234928] [2025-01-09 22:18:09,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:09,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:18:09,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:18:09,437 INFO L229 MonitoredProcess]: Starting monitored process 15 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:18:09,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 22:18:09,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 22:18:09,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:18:09,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:09,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:09,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:18:09,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:18:09,679 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:18:09,778 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:18:09,779 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:18:09,906 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:18:09,934 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:18:09,935 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:18:10,001 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:18:10,050 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 0 case distinctions, treesize of input 19 treesize of output 12 [2025-01-09 22:18:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:10,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:18:10,110 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (forall ((v_ArrVal_2653 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2653) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) |c_ULTIMATE.start_main_~first~0#1.base|))) (forall ((v_ArrVal_2653 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2653) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0)) 1)))) is different from false [2025-01-09 22:18:10,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:18:10,114 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 23 treesize of output 24 [2025-01-09 22:18:10,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:18:10,120 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 39 treesize of output 38 [2025-01-09 22:18:10,122 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 22 treesize of output 18 [2025-01-09 22:18:10,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:18:10,133 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-01-09 22:18:10,135 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:18:10,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:18:10,136 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-09 22:18:10,266 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:10,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399234928] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:18:10,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:18:10,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2025-01-09 22:18:10,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143321848] [2025-01-09 22:18:10,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:18:10,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 22:18:10,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:10,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 22:18:10,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=381, Unknown=1, NotChecked=40, Total=506 [2025-01-09 22:18:10,267 INFO L87 Difference]: Start difference. First operand 259 states and 320 transitions. Second operand has 23 states, 22 states have (on average 5.454545454545454) internal successors, (120), 23 states have internal predecessors, (120), 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:18:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:10,635 INFO L93 Difference]: Finished difference Result 337 states and 410 transitions. [2025-01-09 22:18:10,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:18:10,636 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.454545454545454) internal successors, (120), 23 states have internal predecessors, (120), 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 53 [2025-01-09 22:18:10,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:10,637 INFO L225 Difference]: With dead ends: 337 [2025-01-09 22:18:10,637 INFO L226 Difference]: Without dead ends: 337 [2025-01-09 22:18:10,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=562, Unknown=1, NotChecked=50, Total=756 [2025-01-09 22:18:10,638 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 169 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:10,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 680 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 634 Invalid, 0 Unknown, 155 Unchecked, 0.3s Time] [2025-01-09 22:18:10,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-01-09 22:18:10,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 321. [2025-01-09 22:18:10,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 308 states have (on average 1.2922077922077921) internal successors, (398), 320 states have internal predecessors, (398), 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:18:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 398 transitions. [2025-01-09 22:18:10,644 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 398 transitions. Word has length 53 [2025-01-09 22:18:10,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:10,644 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 398 transitions. [2025-01-09 22:18:10,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.454545454545454) internal successors, (120), 23 states have internal predecessors, (120), 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:18:10,644 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 398 transitions. [2025-01-09 22:18:10,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 22:18:10,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:10,645 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 22:18:10,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-09 22:18:10,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-01-09 22:18:10,849 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:18:10,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:10,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1573020323, now seen corresponding path program 1 times [2025-01-09 22:18:10,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:10,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393562298] [2025-01-09 22:18:10,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:10,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:10,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 22:18:10,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:18:10,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:10,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:11,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:11,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393562298] [2025-01-09 22:18:11,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393562298] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:18:11,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034920151] [2025-01-09 22:18:11,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:11,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:18:11,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:18:11,553 INFO L229 MonitoredProcess]: Starting monitored process 16 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:18:11,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 22:18:11,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 22:18:11,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:18:11,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:11,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:11,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 22:18:11,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:18:11,772 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:18:11,839 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:18:11,840 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:18:11,847 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:18:11,968 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:18:11,974 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:18:12,009 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:18:12,009 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:18:12,015 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:18:12,094 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:18:12,099 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:18:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:12,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:18:12,227 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (forall ((v_ArrVal_2815 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2815) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 12))) (forall ((v_ArrVal_2814 (Array Int Int)) (v_ArrVal_2815 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2815) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 16) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2814) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0)))))) is different from false [2025-01-09 22:18:12,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:18:12,236 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 24 treesize of output 25 [2025-01-09 22:18:12,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:18:12,244 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 40 treesize of output 39 [2025-01-09 22:18:12,247 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 9 treesize of output 5 [2025-01-09 22:18:12,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:18:12,258 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 45 treesize of output 46 [2025-01-09 22:18:12,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:18:12,263 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-01-09 22:18:12,265 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:18:12,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:18:12,267 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-01-09 22:18:12,269 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:18:12,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:18:12,271 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-01-09 22:18:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:12,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034920151] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:18:12,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:18:12,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2025-01-09 22:18:12,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11700981] [2025-01-09 22:18:12,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:18:12,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 22:18:12,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:12,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 22:18:12,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=323, Unknown=1, NotChecked=36, Total=420 [2025-01-09 22:18:12,462 INFO L87 Difference]: Start difference. First operand 321 states and 398 transitions. Second operand has 21 states, 20 states have (on average 6.15) internal successors, (123), 21 states have internal predecessors, (123), 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:18:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:13,014 INFO L93 Difference]: Finished difference Result 394 states and 480 transitions. [2025-01-09 22:18:13,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:18:13,015 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.15) internal successors, (123), 21 states have internal predecessors, (123), 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 53 [2025-01-09 22:18:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:13,016 INFO L225 Difference]: With dead ends: 394 [2025-01-09 22:18:13,016 INFO L226 Difference]: Without dead ends: 394 [2025-01-09 22:18:13,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=598, Unknown=1, NotChecked=52, Total=812 [2025-01-09 22:18:13,017 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 206 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:13,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 847 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 645 Invalid, 0 Unknown, 158 Unchecked, 0.4s Time] [2025-01-09 22:18:13,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-01-09 22:18:13,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 353. [2025-01-09 22:18:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 340 states have (on average 1.3) internal successors, (442), 352 states have internal predecessors, (442), 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:18:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 442 transitions. [2025-01-09 22:18:13,023 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 442 transitions. Word has length 53 [2025-01-09 22:18:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:13,023 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 442 transitions. [2025-01-09 22:18:13,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.15) internal successors, (123), 21 states have internal predecessors, (123), 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:18:13,023 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 442 transitions. [2025-01-09 22:18:13,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 22:18:13,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:13,024 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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] [2025-01-09 22:18:13,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-09 22:18:13,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-01-09 22:18:13,225 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:18:13,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:13,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1573018980, now seen corresponding path program 1 times [2025-01-09 22:18:13,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:13,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257196656] [2025-01-09 22:18:13,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:13,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:13,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 22:18:13,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:18:13,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:13,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:13,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:13,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257196656] [2025-01-09 22:18:13,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257196656] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:18:13,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466701518] [2025-01-09 22:18:13,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:13,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:18:13,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:18:13,314 INFO L229 MonitoredProcess]: Starting monitored process 17 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:18:13,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-09 22:18:13,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 22:18:13,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:18:13,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:13,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:13,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:18:13,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:18:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:13,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:18:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:13,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466701518] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:18:13,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:18:13,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-01-09 22:18:13,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629117691] [2025-01-09 22:18:13,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:18:13,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:18:13,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:13,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:18:13,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:18:13,709 INFO L87 Difference]: Start difference. First operand 353 states and 442 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:13,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:13,739 INFO L93 Difference]: Finished difference Result 363 states and 444 transitions. [2025-01-09 22:18:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:18:13,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-01-09 22:18:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:13,740 INFO L225 Difference]: With dead ends: 363 [2025-01-09 22:18:13,740 INFO L226 Difference]: Without dead ends: 363 [2025-01-09 22:18:13,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:18:13,741 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 81 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:13,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 321 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:18:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-01-09 22:18:13,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2025-01-09 22:18:13,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 343 states have (on average 1.2944606413994169) internal successors, (444), 355 states have internal predecessors, (444), 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:18:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 444 transitions. [2025-01-09 22:18:13,746 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 444 transitions. Word has length 53 [2025-01-09 22:18:13,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:13,746 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 444 transitions. [2025-01-09 22:18:13,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 444 transitions. [2025-01-09 22:18:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 22:18:13,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:13,747 INFO L218 NwaCegarLoop]: trace histogram [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, 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:18:13,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-09 22:18:13,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:18:13,948 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-09 22:18:13,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:13,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1311193234, now seen corresponding path program 1 times [2025-01-09 22:18:13,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:13,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168080474] [2025-01-09 22:18:13,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:13,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:13,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 22:18:13,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:18:13,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:13,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 22:18:13,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1533654613] [2025-01-09 22:18:13,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:13,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:18:13,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:18:13,991 INFO L229 MonitoredProcess]: Starting monitored process 18 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:18:13,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-09 22:18:14,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 22:18:14,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:18:14,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:14,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:14,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 22:18:14,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:18:14,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 22:18:14,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:18:14,285 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 22:18:14,286 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2025-01-09 22:18:14,291 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 13 treesize of output 5 [2025-01-09 22:18:14,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:18:14,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:18:14,746 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 45 treesize of output 41 [2025-01-09 22:18:14,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:18:14,755 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 44 treesize of output 40 [2025-01-09 22:18:15,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:18:15,082 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 37 treesize of output 35 [2025-01-09 22:18:15,228 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:15,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:18:16,058 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 48 treesize of output 44 [2025-01-09 22:18:16,064 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 79 treesize of output 75 [2025-01-09 22:18:16,067 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 62 treesize of output 56 [2025-01-09 22:18:16,072 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 94 treesize of output 88 [2025-01-09 22:18:16,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:18:16,854 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 652 treesize of output 401 [2025-01-09 22:18:17,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:18:17,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 689 treesize of output 1156 [2025-01-09 22:18:17,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:18:17,878 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 408 treesize of output 409 [2025-01-09 22:18:18,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:18:18,004 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 400 treesize of output 401 [2025-01-09 22:18:18,104 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 392 treesize of output 388 [2025-01-09 22:18:18,178 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 388 treesize of output 384 [2025-01-09 22:18:18,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:18:18,288 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 384 treesize of output 385 [2025-01-09 22:18:18,365 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 376 treesize of output 372 [2025-01-09 22:18:18,472 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 372 treesize of output 368 [2025-01-09 22:18:18,582 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 368 treesize of output 364 [2025-01-09 22:18:18,677 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 364 treesize of output 360