./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-lst-data.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/memsafety-broom/sll-lst-data.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 31f7a9efc2cb78d8789da558d79970717791666cb2a6a53f6727ed996af2c74a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:32:34,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:32:34,723 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-09 22:32:34,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:32:34,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:32:34,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:32:34,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:32:34,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:32:34,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:32:34,762 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:32:34,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:32:34,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:32:34,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:32:34,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:32:34,764 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:32:34,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:32:34,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:32:34,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:32:34,765 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:32:34,765 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:32:34,765 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:32:34,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:32:34,765 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:32:34,765 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:32:34,765 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:32:34,765 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:32:34,766 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:32:34,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:32:34,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:32:34,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:32:34,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:32:34,766 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:32:34,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:32:34,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:32:34,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:32:34,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:32:34,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:32:34,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:32:34,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:32:34,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:32:34,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:32:34,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:32:34,768 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:32:34,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:32:34,768 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31f7a9efc2cb78d8789da558d79970717791666cb2a6a53f6727ed996af2c74a [2025-01-09 22:32:35,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:32:35,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:32:35,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:32:35,041 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:32:35,042 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:32:35,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-lst-data.i [2025-01-09 22:32:36,397 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b73ee1d0b/ee25bdf9522c4966bb374095717dc985/FLAG39652da5e [2025-01-09 22:32:36,747 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:32:36,747 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-lst-data.i [2025-01-09 22:32:36,776 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b73ee1d0b/ee25bdf9522c4966bb374095717dc985/FLAG39652da5e [2025-01-09 22:32:36,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b73ee1d0b/ee25bdf9522c4966bb374095717dc985 [2025-01-09 22:32:36,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:32:36,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:32:36,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:32:36,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:32:36,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:32:36,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:32:36" (1/1) ... [2025-01-09 22:32:36,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3867afc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:36, skipping insertion in model container [2025-01-09 22:32:36,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:32:36" (1/1) ... [2025-01-09 22:32:36,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:32:37,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:32:37,129 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:32:37,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:32:37,202 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:32:37,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:37 WrapperNode [2025-01-09 22:32:37,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:32:37,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:32:37,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:32:37,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:32:37,211 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:32:37" (1/1) ... [2025-01-09 22:32:37,227 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:32:37" (1/1) ... [2025-01-09 22:32:37,247 INFO L138 Inliner]: procedures = 121, calls = 18, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 58 [2025-01-09 22:32:37,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:32:37,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:32:37,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:32:37,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:32:37,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:37" (1/1) ... [2025-01-09 22:32:37,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:37" (1/1) ... [2025-01-09 22:32:37,260 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:37" (1/1) ... [2025-01-09 22:32:37,290 INFO L175 MemorySlicer]: Split 8 memory accesses to 1 slices as follows [8]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 4 writes are split as follows [4]. [2025-01-09 22:32:37,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:37" (1/1) ... [2025-01-09 22:32:37,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:37" (1/1) ... [2025-01-09 22:32:37,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:37" (1/1) ... [2025-01-09 22:32:37,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:37" (1/1) ... [2025-01-09 22:32:37,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:37" (1/1) ... [2025-01-09 22:32:37,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:37" (1/1) ... [2025-01-09 22:32:37,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:37" (1/1) ... [2025-01-09 22:32:37,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:32:37,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:32:37,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:32:37,316 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:32:37,317 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:37" (1/1) ... [2025-01-09 22:32:37,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:32:37,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:37,349 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:32:37,351 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:32:37,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:32:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-01-09 22:32:37,370 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-01-09 22:32:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:32:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:32:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:32:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:32:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:32:37,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:32:37,487 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:32:37,490 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:32:37,731 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-01-09 22:32:37,731 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:32:37,745 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:32:37,745 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 22:32:37,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:32:37 BoogieIcfgContainer [2025-01-09 22:32:37,746 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:32:37,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:32:37,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:32:37,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:32:37,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:32:36" (1/3) ... [2025-01-09 22:32:37,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156ce0d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:32:37, skipping insertion in model container [2025-01-09 22:32:37,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:37" (2/3) ... [2025-01-09 22:32:37,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156ce0d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:32:37, skipping insertion in model container [2025-01-09 22:32:37,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:32:37" (3/3) ... [2025-01-09 22:32:37,756 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-lst-data.i [2025-01-09 22:32:37,767 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:32:37,768 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-lst-data.i that has 2 procedures, 59 locations, 1 initial locations, 3 loop locations, and 20 error locations. [2025-01-09 22:32:37,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:32:37,818 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;@43145e64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:32:37,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-01-09 22:32:37,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:32:37,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:32:37,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:37,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:32:37,830 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:37,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:37,834 INFO L85 PathProgramCache]: Analyzing trace with hash 34489331, now seen corresponding path program 1 times [2025-01-09 22:32:37,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:37,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769531017] [2025-01-09 22:32:37,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:37,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:37,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:32:37,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:32:37,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:37,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:37,996 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:32:37,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:37,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769531017] [2025-01-09 22:32:37,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769531017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:37,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:37,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:32:37,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794331924] [2025-01-09 22:32:37,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:38,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:32:38,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:38,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:32:38,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:32:38,029 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:32:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:38,086 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2025-01-09 22:32:38,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:32:38,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 22:32:38,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:38,093 INFO L225 Difference]: With dead ends: 58 [2025-01-09 22:32:38,093 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 22:32:38,094 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:32:38,097 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:38,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 95 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:32:38,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 22:32:38,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-09 22:32:38,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 52 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:32:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2025-01-09 22:32:38,127 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 5 [2025-01-09 22:32:38,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:38,128 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2025-01-09 22:32:38,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:32:38,128 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2025-01-09 22:32:38,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:32:38,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:38,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:32:38,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:32:38,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:38,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:38,131 INFO L85 PathProgramCache]: Analyzing trace with hash 34489332, now seen corresponding path program 1 times [2025-01-09 22:32:38,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:38,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933114644] [2025-01-09 22:32:38,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:38,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:38,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:32:38,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:32:38,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:38,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:38,236 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:32:38,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:38,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933114644] [2025-01-09 22:32:38,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933114644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:38,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:38,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:32:38,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852165855] [2025-01-09 22:32:38,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:38,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:32:38,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:38,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:32:38,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:32:38,238 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:32:38,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:38,271 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2025-01-09 22:32:38,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:32:38,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 22:32:38,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:38,272 INFO L225 Difference]: With dead ends: 55 [2025-01-09 22:32:38,272 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 22:32:38,272 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:32:38,273 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:38,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:32:38,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 22:32:38,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-09 22:32:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:32:38,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2025-01-09 22:32:38,279 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 5 [2025-01-09 22:32:38,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:38,279 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2025-01-09 22:32:38,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:32:38,279 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2025-01-09 22:32:38,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:32:38,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:38,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:38,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:32:38,280 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:38,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash 143935364, now seen corresponding path program 1 times [2025-01-09 22:32:38,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:38,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859435569] [2025-01-09 22:32:38,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:38,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:38,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:32:38,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:32:38,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:38,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:38,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:38,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859435569] [2025-01-09 22:32:38,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859435569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:38,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:38,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:32:38,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778307090] [2025-01-09 22:32:38,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:38,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:32:38,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:38,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:32:38,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:32:38,430 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:38,554 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2025-01-09 22:32:38,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:32:38,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-01-09 22:32:38,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:38,558 INFO L225 Difference]: With dead ends: 57 [2025-01-09 22:32:38,558 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 22:32:38,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:32:38,559 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 13 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:38,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 150 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:38,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 22:32:38,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2025-01-09 22:32:38,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.5) internal successors, (51), 48 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:32:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2025-01-09 22:32:38,576 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 10 [2025-01-09 22:32:38,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:38,577 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2025-01-09 22:32:38,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:38,577 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2025-01-09 22:32:38,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:32:38,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:38,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:38,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:32:38,579 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:38,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:38,583 INFO L85 PathProgramCache]: Analyzing trace with hash 143935365, now seen corresponding path program 1 times [2025-01-09 22:32:38,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:38,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038874841] [2025-01-09 22:32:38,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:38,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:38,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:32:38,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:32:38,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:38,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:38,798 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:32:38,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:38,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038874841] [2025-01-09 22:32:38,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038874841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:38,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:38,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:32:38,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355533672] [2025-01-09 22:32:38,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:38,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:32:38,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:38,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:32:38,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:32:38,801 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:38,879 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2025-01-09 22:32:38,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:32:38,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-01-09 22:32:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:38,881 INFO L225 Difference]: With dead ends: 56 [2025-01-09 22:32:38,881 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 22:32:38,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:32:38,882 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:38,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 193 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:38,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 22:32:38,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2025-01-09 22:32:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 47 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:32:38,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2025-01-09 22:32:38,887 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 10 [2025-01-09 22:32:38,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:38,887 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2025-01-09 22:32:38,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2025-01-09 22:32:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:32:38,888 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:38,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:38,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:32:38,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:38,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:38,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1632473405, now seen corresponding path program 1 times [2025-01-09 22:32:38,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:38,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036072472] [2025-01-09 22:32:38,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:38,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:38,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:32:38,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:32:38,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:38,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:39,047 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:32:39,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:39,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036072472] [2025-01-09 22:32:39,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036072472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:39,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:39,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:32:39,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105886697] [2025-01-09 22:32:39,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:39,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:32:39,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:39,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:32:39,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:32:39,049 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:39,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:39,177 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2025-01-09 22:32:39,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:32:39,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-01-09 22:32:39,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:39,178 INFO L225 Difference]: With dead ends: 59 [2025-01-09 22:32:39,178 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 22:32:39,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:32:39,179 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:39,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 196 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 22:32:39,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2025-01-09 22:32:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:32:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2025-01-09 22:32:39,187 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 18 [2025-01-09 22:32:39,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:39,188 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2025-01-09 22:32:39,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2025-01-09 22:32:39,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:32:39,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:39,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:39,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:32:39,189 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:39,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:39,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1632473404, now seen corresponding path program 1 times [2025-01-09 22:32:39,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:39,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202983473] [2025-01-09 22:32:39,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:39,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:39,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:32:39,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:32:39,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:39,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:39,456 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:32:39,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:39,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202983473] [2025-01-09 22:32:39,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202983473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:39,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:39,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:32:39,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908212762] [2025-01-09 22:32:39,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:39,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:32:39,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:39,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:32:39,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:32:39,462 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:39,580 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2025-01-09 22:32:39,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:32:39,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-01-09 22:32:39,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:39,582 INFO L225 Difference]: With dead ends: 59 [2025-01-09 22:32:39,583 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 22:32:39,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:32:39,583 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:39,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 217 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:39,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 22:32:39,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2025-01-09 22:32:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:32:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2025-01-09 22:32:39,593 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 18 [2025-01-09 22:32:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:39,594 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2025-01-09 22:32:39,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2025-01-09 22:32:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:32:39,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:39,595 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:39,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:32:39,595 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:39,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:39,595 INFO L85 PathProgramCache]: Analyzing trace with hash 300128782, now seen corresponding path program 1 times [2025-01-09 22:32:39,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:39,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900194178] [2025-01-09 22:32:39,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:39,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:39,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:32:39,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:32:39,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:39,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:39,820 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:32:39,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:39,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900194178] [2025-01-09 22:32:39,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900194178] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:39,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695737345] [2025-01-09 22:32:39,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:39,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:39,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:39,825 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:32:39,827 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:32:39,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:32:39,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:32:39,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:39,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:39,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 22:32:39,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:39,970 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2025-01-09 22:32:40,028 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:32:40,029 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:32:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:40,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:32:40,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695737345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:40,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:32:40,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2025-01-09 22:32:40,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941564708] [2025-01-09 22:32:40,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:40,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:32:40,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:40,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:32:40,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-01-09 22:32:40,038 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:32:40,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:40,089 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2025-01-09 22:32:40,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:32:40,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2025-01-09 22:32:40,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:40,091 INFO L225 Difference]: With dead ends: 60 [2025-01-09 22:32:40,091 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 22:32:40,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-01-09 22:32:40,092 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:40,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 72 Unchecked, 0.0s Time] [2025-01-09 22:32:40,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 22:32:40,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-09 22:32:40,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 55 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:32:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2025-01-09 22:32:40,096 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 20 [2025-01-09 22:32:40,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:40,096 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2025-01-09 22:32:40,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:32:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2025-01-09 22:32:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:32:40,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:40,097 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:40,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 22:32:40,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:40,297 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:40,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash 300128783, now seen corresponding path program 1 times [2025-01-09 22:32:40,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:40,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513737799] [2025-01-09 22:32:40,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:40,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:40,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:32:40,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:32:40,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:40,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:40,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:40,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513737799] [2025-01-09 22:32:40,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513737799] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:40,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508326789] [2025-01-09 22:32:40,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:40,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:40,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:40,709 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:32:40,714 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:32:40,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:32:40,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:32:40,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:40,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:40,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 22:32:40,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:40,810 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:32:40,985 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-01-09 22:32:41,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:32:41,033 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:32:41,042 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:32:41,042 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:32:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-01-09 22:32:41,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:32:41,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508326789] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:41,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:32:41,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-01-09 22:32:41,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214458404] [2025-01-09 22:32:41,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:32:41,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 22:32:41,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:41,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 22:32:41,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=286, Unknown=1, NotChecked=34, Total=380 [2025-01-09 22:32:41,195 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 13 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:32:41,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:41,456 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2025-01-09 22:32:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:32:41,457 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 13 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2025-01-09 22:32:41,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:41,457 INFO L225 Difference]: With dead ends: 68 [2025-01-09 22:32:41,457 INFO L226 Difference]: Without dead ends: 68 [2025-01-09 22:32:41,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=352, Unknown=1, NotChecked=38, Total=462 [2025-01-09 22:32:41,458 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 9 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:41,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 328 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 244 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2025-01-09 22:32:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-09 22:32:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2025-01-09 22:32:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 61 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:32:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2025-01-09 22:32:41,466 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 20 [2025-01-09 22:32:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:41,466 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2025-01-09 22:32:41,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 13 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:32:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2025-01-09 22:32:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:32:41,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:41,468 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:32:41,476 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:32:41,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:41,669 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:41,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:41,670 INFO L85 PathProgramCache]: Analyzing trace with hash 933178390, now seen corresponding path program 1 times [2025-01-09 22:32:41,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:41,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073072882] [2025-01-09 22:32:41,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:41,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:41,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:32:41,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:32:41,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:41,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:41,778 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:32:41,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:41,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073072882] [2025-01-09 22:32:41,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073072882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:41,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:41,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:32:41,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570511439] [2025-01-09 22:32:41,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:41,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:32:41,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:41,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:32:41,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:32:41,780 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:41,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:41,821 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2025-01-09 22:32:41,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:32:41,821 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-01-09 22:32:41,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:41,822 INFO L225 Difference]: With dead ends: 69 [2025-01-09 22:32:41,822 INFO L226 Difference]: Without dead ends: 69 [2025-01-09 22:32:41,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:32:41,822 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:41,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 298 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:32:41,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-09 22:32:41,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-01-09 22:32:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 62 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:32:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2025-01-09 22:32:41,827 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 19 [2025-01-09 22:32:41,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:41,828 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2025-01-09 22:32:41,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:41,828 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2025-01-09 22:32:41,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:32:41,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:41,828 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] [2025-01-09 22:32:41,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:32:41,828 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:41,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:41,829 INFO L85 PathProgramCache]: Analyzing trace with hash 244575486, now seen corresponding path program 1 times [2025-01-09 22:32:41,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:41,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408619316] [2025-01-09 22:32:41,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:41,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:41,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:32:41,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:32:41,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:41,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:42,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:42,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:42,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408619316] [2025-01-09 22:32:42,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408619316] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:42,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427080969] [2025-01-09 22:32:42,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:42,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:42,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:42,321 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:32:42,324 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:32:42,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:32:42,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:32:42,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:42,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:42,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-09 22:32:42,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:42,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:32:42,426 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 13 treesize of output 9 [2025-01-09 22:32:42,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:32:42,543 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 25 treesize of output 13 [2025-01-09 22:32:42,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:32:42,554 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 25 treesize of output 13 [2025-01-09 22:32:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:42,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:32:42,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:42,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427080969] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:32:42,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:32:42,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 20 [2025-01-09 22:32:42,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104880519] [2025-01-09 22:32:42,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:32:42,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:32:42,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:42,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:32:42,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=314, Unknown=16, NotChecked=0, Total=380 [2025-01-09 22:32:42,945 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 20 states, 20 states have (on average 1.8) internal successors, (36), 18 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:32:43,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:43,156 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2025-01-09 22:32:43,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:32:43,157 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 18 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-01-09 22:32:43,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:43,157 INFO L225 Difference]: With dead ends: 69 [2025-01-09 22:32:43,158 INFO L226 Difference]: Without dead ends: 69 [2025-01-09 22:32:43,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=346, Unknown=17, NotChecked=0, Total=420 [2025-01-09 22:32:43,159 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:43,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 540 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:32:43,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-09 22:32:43,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-01-09 22:32:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 64 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:32:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2025-01-09 22:32:43,162 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 22 [2025-01-09 22:32:43,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:43,163 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2025-01-09 22:32:43,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 18 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:32:43,163 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2025-01-09 22:32:43,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:32:43,163 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:43,164 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] [2025-01-09 22:32:43,171 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:32:43,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:43,368 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:43,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:43,369 INFO L85 PathProgramCache]: Analyzing trace with hash -481595632, now seen corresponding path program 1 times [2025-01-09 22:32:43,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:43,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051212678] [2025-01-09 22:32:43,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:43,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:43,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:32:43,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:32:43,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:43,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:43,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:32:43,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:43,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051212678] [2025-01-09 22:32:43,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051212678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:43,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:43,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:32:43,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999483817] [2025-01-09 22:32:43,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:43,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:32:43,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:43,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:32:43,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:32:43,482 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:32:43,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:43,579 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2025-01-09 22:32:43,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:32:43,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-01-09 22:32:43,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:43,580 INFO L225 Difference]: With dead ends: 68 [2025-01-09 22:32:43,580 INFO L226 Difference]: Without dead ends: 68 [2025-01-09 22:32:43,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:32:43,581 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:43,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 186 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-09 22:32:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-01-09 22:32:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:32:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2025-01-09 22:32:43,585 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 24 [2025-01-09 22:32:43,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:43,585 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2025-01-09 22:32:43,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:32:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2025-01-09 22:32:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:32:43,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:43,586 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] [2025-01-09 22:32:43,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:32:43,586 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:43,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:43,587 INFO L85 PathProgramCache]: Analyzing trace with hash -481595631, now seen corresponding path program 1 times [2025-01-09 22:32:43,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:43,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759737967] [2025-01-09 22:32:43,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:43,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:43,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:32:43,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:32:43,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:43,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:32:43,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:43,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759737967] [2025-01-09 22:32:43,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759737967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:43,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:43,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:32:43,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427249928] [2025-01-09 22:32:43,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:43,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:32:43,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:43,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:32:43,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:32:43,803 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:32:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:43,889 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2025-01-09 22:32:43,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:32:43,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-01-09 22:32:43,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:43,891 INFO L225 Difference]: With dead ends: 67 [2025-01-09 22:32:43,891 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 22:32:43,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:32:43,891 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:43,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 204 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:43,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 22:32:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 22:32:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:32:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2025-01-09 22:32:43,895 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 24 [2025-01-09 22:32:43,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:43,895 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2025-01-09 22:32:43,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:32:43,896 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2025-01-09 22:32:43,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:32:43,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:43,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, 1, 1, 1] [2025-01-09 22:32:43,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:32:43,897 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:43,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:43,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1007848133, now seen corresponding path program 1 times [2025-01-09 22:32:43,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:43,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860809661] [2025-01-09 22:32:43,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:43,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:43,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:32:43,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:32:43,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:43,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:32:44,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:44,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860809661] [2025-01-09 22:32:44,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860809661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:44,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:44,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:32:44,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400878363] [2025-01-09 22:32:44,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:44,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:32:44,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:44,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:32:44,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:32:44,004 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:44,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:44,134 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2025-01-09 22:32:44,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:32:44,135 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-01-09 22:32:44,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:44,136 INFO L225 Difference]: With dead ends: 69 [2025-01-09 22:32:44,136 INFO L226 Difference]: Without dead ends: 69 [2025-01-09 22:32:44,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:32:44,137 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:44,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 184 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:44,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-09 22:32:44,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-01-09 22:32:44,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 64 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:32:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2025-01-09 22:32:44,141 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 23 [2025-01-09 22:32:44,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:44,141 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2025-01-09 22:32:44,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2025-01-09 22:32:44,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:32:44,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:44,142 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:32:44,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:32:44,142 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:44,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:44,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1007848132, now seen corresponding path program 1 times [2025-01-09 22:32:44,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:44,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395525240] [2025-01-09 22:32:44,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:44,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:44,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:32:44,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:32:44,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:44,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:32:44,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:44,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395525240] [2025-01-09 22:32:44,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395525240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:44,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:44,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:32:44,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889480201] [2025-01-09 22:32:44,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:44,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:32:44,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:44,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:32:44,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:32:44,332 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:44,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:44,477 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2025-01-09 22:32:44,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:32:44,478 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-01-09 22:32:44,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:44,479 INFO L225 Difference]: With dead ends: 71 [2025-01-09 22:32:44,479 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 22:32:44,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:32:44,479 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:44,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 209 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 22:32:44,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-01-09 22:32:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:32:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2025-01-09 22:32:44,483 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 23 [2025-01-09 22:32:44,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:44,483 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2025-01-09 22:32:44,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2025-01-09 22:32:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:32:44,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:44,484 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, 1] [2025-01-09 22:32:44,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:32:44,484 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:44,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:44,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1178509066, now seen corresponding path program 1 times [2025-01-09 22:32:44,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:44,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708350996] [2025-01-09 22:32:44,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:44,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:44,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:32:44,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:32:44,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:44,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:32:44,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:44,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708350996] [2025-01-09 22:32:44,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708350996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:44,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:44,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:32:44,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589323574] [2025-01-09 22:32:44,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:44,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:32:44,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:44,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:32:44,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:32:44,575 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:44,639 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2025-01-09 22:32:44,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:32:44,639 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-01-09 22:32:44,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:44,640 INFO L225 Difference]: With dead ends: 78 [2025-01-09 22:32:44,640 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 22:32:44,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:32:44,641 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 21 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:44,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 291 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:44,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 22:32:44,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2025-01-09 22:32:44,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:32:44,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2025-01-09 22:32:44,644 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 24 [2025-01-09 22:32:44,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:44,645 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2025-01-09 22:32:44,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:44,645 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2025-01-09 22:32:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:32:44,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:44,645 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, 1, 1, 1] [2025-01-09 22:32:44,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:32:44,646 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:44,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:44,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1312674924, now seen corresponding path program 1 times [2025-01-09 22:32:44,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:44,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193086714] [2025-01-09 22:32:44,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:44,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:44,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:32:44,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:32:44,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:44,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:44,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:32:44,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:44,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193086714] [2025-01-09 22:32:44,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193086714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:44,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:44,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:32:44,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737804021] [2025-01-09 22:32:44,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:44,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:32:44,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:44,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:32:44,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:32:44,776 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:44,863 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2025-01-09 22:32:44,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:32:44,863 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-01-09 22:32:44,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:44,864 INFO L225 Difference]: With dead ends: 77 [2025-01-09 22:32:44,864 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 22:32:44,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:32:44,865 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:44,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 259 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:44,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 22:32:44,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2025-01-09 22:32:44,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.278688524590164) internal successors, (78), 71 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:32:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2025-01-09 22:32:44,868 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 26 [2025-01-09 22:32:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:44,870 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2025-01-09 22:32:44,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:44,870 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2025-01-09 22:32:44,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:32:44,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:44,871 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:44,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:32:44,872 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:44,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:44,873 INFO L85 PathProgramCache]: Analyzing trace with hash 221534752, now seen corresponding path program 1 times [2025-01-09 22:32:44,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:44,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7802703] [2025-01-09 22:32:44,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:44,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:44,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:32:44,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:32:44,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:44,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:45,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:45,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7802703] [2025-01-09 22:32:45,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7802703] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:45,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525214937] [2025-01-09 22:32:45,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:45,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:45,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:45,294 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:32:45,296 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:32:45,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:32:45,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:32:45,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:45,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:45,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-01-09 22:32:45,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:45,401 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:32:45,406 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:32:45,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:32:45,546 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:32:45,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:32:45,551 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:32:45,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:32:45,702 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 17 treesize of output 15 [2025-01-09 22:32:45,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:32:45,711 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 17 treesize of output 15 [2025-01-09 22:32:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:32:45,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:32:46,514 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 15 treesize of output 13 [2025-01-09 22:32:46,523 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 90 treesize of output 86 [2025-01-09 22:32:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:32:46,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525214937] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:32:46,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:32:46,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2025-01-09 22:32:46,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247472673] [2025-01-09 22:32:46,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:32:46,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 22:32:46,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:46,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 22:32:46,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=777, Unknown=23, NotChecked=0, Total=870 [2025-01-09 22:32:46,542 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 27 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:32:47,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:47,216 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2025-01-09 22:32:47,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 22:32:47,216 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 27 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2025-01-09 22:32:47,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:47,217 INFO L225 Difference]: With dead ends: 90 [2025-01-09 22:32:47,217 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 22:32:47,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=124, Invalid=1403, Unknown=33, NotChecked=0, Total=1560 [2025-01-09 22:32:47,218 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 34 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:47,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 533 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:32:47,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 22:32:47,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2025-01-09 22:32:47,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 81 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:32:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2025-01-09 22:32:47,223 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 29 [2025-01-09 22:32:47,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:47,224 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2025-01-09 22:32:47,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 27 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:32:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2025-01-09 22:32:47,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:32:47,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:47,224 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:47,237 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:32:47,424 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,SelfDestructingSolverStorable16 [2025-01-09 22:32:47,425 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:47,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:47,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1722345295, now seen corresponding path program 1 times [2025-01-09 22:32:47,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:47,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457934272] [2025-01-09 22:32:47,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:47,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:47,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:32:47,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:32:47,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:47,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:32:47,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:47,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457934272] [2025-01-09 22:32:47,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457934272] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:47,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655446722] [2025-01-09 22:32:47,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:47,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:47,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:47,573 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:32:47,575 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:32:47,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:32:47,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:32:47,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:47,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:47,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 22:32:47,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:47,706 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:32:47,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:32:47,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:32:47,792 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret4#1.base_19| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_19|) 0)) (= (store |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_19| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2025-01-09 22:32:47,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655446722] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:47,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:32:47,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2025-01-09 22:32:47,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496200865] [2025-01-09 22:32:47,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:32:47,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:32:47,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:47,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:32:47,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=111, Unknown=1, NotChecked=20, Total=156 [2025-01-09 22:32:47,795 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:47,972 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2025-01-09 22:32:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:32:47,972 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-01-09 22:32:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:47,973 INFO L225 Difference]: With dead ends: 93 [2025-01-09 22:32:47,973 INFO L226 Difference]: Without dead ends: 76 [2025-01-09 22:32:47,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=111, Unknown=1, NotChecked=20, Total=156 [2025-01-09 22:32:47,973 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:47,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 270 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:32:47,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-09 22:32:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-01-09 22:32:47,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 71 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:32:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2025-01-09 22:32:47,978 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 30 [2025-01-09 22:32:47,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:47,978 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2025-01-09 22:32:47,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2025-01-09 22:32:47,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:32:47,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:47,980 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] [2025-01-09 22:32:47,988 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:32:48,184 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,SelfDestructingSolverStorable17 [2025-01-09 22:32:48,184 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:48,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:48,184 INFO L85 PathProgramCache]: Analyzing trace with hash 977867189, now seen corresponding path program 1 times [2025-01-09 22:32:48,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:48,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249872760] [2025-01-09 22:32:48,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:48,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:48,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:32:48,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:32:48,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:48,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:32:48,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:48,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249872760] [2025-01-09 22:32:48,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249872760] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:48,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351345417] [2025-01-09 22:32:48,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:48,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:48,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:48,271 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:32:48,273 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:32:48,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:32:48,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:32:48,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:48,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:48,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 22:32:48,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:48,401 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:32:48,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:32:48,435 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:32:48,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-01-09 22:32:48,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:32:48,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351345417] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:32:48,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:32:48,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2025-01-09 22:32:48,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892372393] [2025-01-09 22:32:48,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:32:48,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:32:48,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:48,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:32:48,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:32:48,453 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:32:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:48,537 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2025-01-09 22:32:48,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:32:48,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2025-01-09 22:32:48,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:48,538 INFO L225 Difference]: With dead ends: 85 [2025-01-09 22:32:48,538 INFO L226 Difference]: Without dead ends: 85 [2025-01-09 22:32:48,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:32:48,538 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:48,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 181 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:48,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-09 22:32:48,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-01-09 22:32:48,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 79 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:32:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2025-01-09 22:32:48,542 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 34 [2025-01-09 22:32:48,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:48,542 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2025-01-09 22:32:48,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:32:48,542 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2025-01-09 22:32:48,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:32:48,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:48,543 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] [2025-01-09 22:32:48,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 22:32:48,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:48,747 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:48,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:48,748 INFO L85 PathProgramCache]: Analyzing trace with hash 977867190, now seen corresponding path program 1 times [2025-01-09 22:32:48,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:48,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914422179] [2025-01-09 22:32:48,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:48,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:48,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:32:48,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:32:48,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:48,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:48,939 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:32:48,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:48,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914422179] [2025-01-09 22:32:48,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914422179] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:48,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725387449] [2025-01-09 22:32:48,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:48,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:48,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:48,943 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:32:48,945 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:32:49,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:32:49,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:32:49,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:49,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:49,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-09 22:32:49,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:49,054 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:32:49,179 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-01-09 22:32:49,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:32:49,199 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:32:49,209 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:32:49,210 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:32:49,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-01-09 22:32:49,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:32:49,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725387449] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:49,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:32:49,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2025-01-09 22:32:49,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534511035] [2025-01-09 22:32:49,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:32:49,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:32:49,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:49,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:32:49,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=329, Unknown=1, NotChecked=36, Total=420 [2025-01-09 22:32:49,426 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 17 states, 16 states have (on average 3.125) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:32:49,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:49,625 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2025-01-09 22:32:49,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:32:49,626 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2025-01-09 22:32:49,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:49,626 INFO L225 Difference]: With dead ends: 105 [2025-01-09 22:32:49,626 INFO L226 Difference]: Without dead ends: 105 [2025-01-09 22:32:49,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=438, Unknown=1, NotChecked=42, Total=552 [2025-01-09 22:32:49,627 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:49,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 277 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 211 Invalid, 0 Unknown, 88 Unchecked, 0.1s Time] [2025-01-09 22:32:49,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-09 22:32:49,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2025-01-09 22:32:49,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 94 states have internal predecessors, (112), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:32:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2025-01-09 22:32:49,631 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 34 [2025-01-09 22:32:49,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:49,631 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2025-01-09 22:32:49,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:32:49,631 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2025-01-09 22:32:49,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:32:49,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:49,632 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:49,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 22:32:49,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:49,833 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:49,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:49,833 INFO L85 PathProgramCache]: Analyzing trace with hash 576538752, now seen corresponding path program 1 times [2025-01-09 22:32:49,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:49,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797517885] [2025-01-09 22:32:49,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:49,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:49,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:32:49,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:32:49,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:49,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:32:50,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:50,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797517885] [2025-01-09 22:32:50,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797517885] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:50,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836553759] [2025-01-09 22:32:50,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:50,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:50,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:50,229 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:32:50,231 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:32:50,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:32:50,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:32:50,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:50,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:50,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 22:32:50,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:50,375 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:32:50,376 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:32:50,397 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 19 treesize of output 1 [2025-01-09 22:32:50,460 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:32:50,460 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 42 treesize of output 41 [2025-01-09 22:32:50,470 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 31 treesize of output 13 [2025-01-09 22:32:50,484 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2025-01-09 22:32:50,516 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:32:50,516 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:32:50,519 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2025-01-09 22:32:50,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:32:50,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836553759] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:50,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:32:50,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 22 [2025-01-09 22:32:50,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702355791] [2025-01-09 22:32:50,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:32:50,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 22:32:50,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:50,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 22:32:50,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=449, Unknown=1, NotChecked=42, Total=552 [2025-01-09 22:32:50,578 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 19 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:32:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:50,870 INFO L93 Difference]: Finished difference Result 99 states and 118 transitions. [2025-01-09 22:32:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:32:50,871 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 19 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2025-01-09 22:32:50,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:50,871 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:32:50,871 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:32:50,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=662, Unknown=1, NotChecked=52, Total=812 [2025-01-09 22:32:50,872 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:50,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 452 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 347 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2025-01-09 22:32:50,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:32:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 22:32:50,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 93 states have internal predecessors, (110), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:32:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2025-01-09 22:32:50,876 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 36 [2025-01-09 22:32:50,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:50,876 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2025-01-09 22:32:50,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 19 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:32:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2025-01-09 22:32:50,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:32:50,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:50,877 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:50,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 22:32:51,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:51,078 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:51,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:51,078 INFO L85 PathProgramCache]: Analyzing trace with hash 576538753, now seen corresponding path program 1 times [2025-01-09 22:32:51,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:51,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329211153] [2025-01-09 22:32:51,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:51,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:51,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:32:51,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:32:51,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:51,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:51,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:51,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329211153] [2025-01-09 22:32:51,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329211153] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:51,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101989819] [2025-01-09 22:32:51,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:51,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:51,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:51,593 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:32:51,595 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:32:51,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:32:51,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:32:51,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:51,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:51,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-09 22:32:51,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:51,721 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:32:51,765 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:32:51,765 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:32:51,775 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 13 treesize of output 9 [2025-01-09 22:32:51,780 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 19 treesize of output 1 [2025-01-09 22:32:51,840 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:32:51,840 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 73 treesize of output 66 [2025-01-09 22:32:51,845 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 30 treesize of output 13 [2025-01-09 22:32:51,894 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 42 treesize of output 18 [2025-01-09 22:32:51,899 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 9 treesize of output 3 [2025-01-09 22:32:51,994 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-01-09 22:32:52,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:32:52,023 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:32:52,031 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:32:52,031 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:32:52,032 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-01-09 22:32:52,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:32:52,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101989819] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:52,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:32:52,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 24 [2025-01-09 22:32:52,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103065869] [2025-01-09 22:32:52,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:32:52,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 22:32:52,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:52,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 22:32:52,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=583, Unknown=1, NotChecked=48, Total=702 [2025-01-09 22:32:52,152 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:32:52,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:52,650 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2025-01-09 22:32:52,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:32:52,651 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2025-01-09 22:32:52,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:52,651 INFO L225 Difference]: With dead ends: 96 [2025-01-09 22:32:52,652 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 22:32:52,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=1049, Unknown=1, NotChecked=66, Total=1260 [2025-01-09 22:32:52,654 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 22 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:52,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 615 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 447 Invalid, 0 Unknown, 54 Unchecked, 0.3s Time] [2025-01-09 22:32:52,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 22:32:52,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-01-09 22:32:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.2380952380952381) internal successors, (104), 90 states have internal predecessors, (104), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:32:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2025-01-09 22:32:52,660 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 36 [2025-01-09 22:32:52,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:52,660 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2025-01-09 22:32:52,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:32:52,661 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2025-01-09 22:32:52,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 22:32:52,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:52,662 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:52,670 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:32:52,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:52,866 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:52,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:52,866 INFO L85 PathProgramCache]: Analyzing trace with hash -413415696, now seen corresponding path program 1 times [2025-01-09 22:32:52,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:52,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243487637] [2025-01-09 22:32:52,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:52,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:52,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:32:52,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:32:52,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:52,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:53,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:53,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:53,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243487637] [2025-01-09 22:32:53,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243487637] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:53,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768695099] [2025-01-09 22:32:53,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:53,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:53,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:53,444 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:32:53,447 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:32:53,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:32:53,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:32:53,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:53,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:53,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-01-09 22:32:53,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:53,765 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:32:53,766 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:32:53,799 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 19 treesize of output 1 [2025-01-09 22:32:53,809 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 19 treesize of output 1 [2025-01-09 22:32:53,856 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 19 treesize of output 7 [2025-01-09 22:32:53,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:32:53,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 33 [2025-01-09 22:32:54,032 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 31 treesize of output 13 [2025-01-09 22:32:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:54,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:32:54,144 INFO L349 Elim1Store]: treesize reduction 5, result has 77.3 percent of original size [2025-01-09 22:32:54,144 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 26 treesize of output 25 [2025-01-09 22:32:54,284 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 75 treesize of output 69 [2025-01-09 22:32:54,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768695099] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:54,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:32:54,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 32 [2025-01-09 22:32:54,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141278135] [2025-01-09 22:32:54,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:32:54,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 22:32:54,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:54,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 22:32:54,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1438, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 22:32:54,476 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand has 33 states, 32 states have (on average 1.9375) internal successors, (62), 28 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:32:55,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:55,002 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2025-01-09 22:32:55,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:32:55,002 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.9375) internal successors, (62), 28 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2025-01-09 22:32:55,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:55,003 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:32:55,003 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:32:55,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=191, Invalid=2065, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 22:32:55,004 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 18 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:55,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 612 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:32:55,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:32:55,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-01-09 22:32:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 88 states have (on average 1.25) internal successors, (110), 94 states have internal predecessors, (110), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:32:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2025-01-09 22:32:55,007 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 38 [2025-01-09 22:32:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:55,007 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2025-01-09 22:32:55,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.9375) internal successors, (62), 28 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:32:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2025-01-09 22:32:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 22:32:55,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:55,008 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:55,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 22:32:55,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-09 22:32:55,208 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:55,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash -413415695, now seen corresponding path program 1 times [2025-01-09 22:32:55,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:55,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713783281] [2025-01-09 22:32:55,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:55,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:55,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:32:55,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:32:55,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:55,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:55,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:55,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:55,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713783281] [2025-01-09 22:32:55,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713783281] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:55,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94942434] [2025-01-09 22:32:55,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:55,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:55,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:55,824 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:32:55,825 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:32:55,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:32:55,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:32:55,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:55,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:55,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-01-09 22:32:55,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:55,982 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:32:56,037 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:32:56,037 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:32:56,070 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 19 treesize of output 1 [2025-01-09 22:32:56,075 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 13 treesize of output 9 [2025-01-09 22:32:56,163 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:32:56,163 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 62 treesize of output 57 [2025-01-09 22:32:56,173 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 30 treesize of output 13 [2025-01-09 22:32:56,307 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 31 treesize of output 13 [2025-01-09 22:32:56,311 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 9 treesize of output 3 [2025-01-09 22:32:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:56,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:32:56,535 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_845 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_845) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_845) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_846) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0)))))) is different from false [2025-01-09 22:32:56,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:32:56,622 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:32:56,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:32:56,629 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 35 treesize of output 36 [2025-01-09 22:32:56,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:32:56,640 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 62 treesize of output 61 [2025-01-09 22:32:56,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:32:56,652 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 96 treesize of output 89 [2025-01-09 22:32:56,676 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 15 treesize of output 11 [2025-01-09 22:32:56,679 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 11 treesize of output 7 [2025-01-09 22:32:56,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:32:56,686 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:32:56,689 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:32:56,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:32:56,692 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:32:56,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94942434] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:56,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:32:56,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 30 [2025-01-09 22:32:56,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920229731] [2025-01-09 22:32:56,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:32:56,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 22:32:56,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:56,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 22:32:56,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1340, Unknown=21, NotChecked=74, Total=1560 [2025-01-09 22:32:56,814 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 27 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:32:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:57,262 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2025-01-09 22:32:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:32:57,263 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 27 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2025-01-09 22:32:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:57,264 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:32:57,264 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:32:57,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=183, Invalid=1869, Unknown=22, NotChecked=88, Total=2162 [2025-01-09 22:32:57,265 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:57,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 647 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:32:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:32:57,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-01-09 22:32:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 94 states have internal predecessors, (109), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:32:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2025-01-09 22:32:57,271 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 38 [2025-01-09 22:32:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:57,271 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2025-01-09 22:32:57,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 27 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:32:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2025-01-09 22:32:57,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:32:57,272 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:57,272 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] [2025-01-09 22:32:57,282 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:32:57,478 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,SelfDestructingSolverStorable23 [2025-01-09 22:32:57,478 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:57,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:57,478 INFO L85 PathProgramCache]: Analyzing trace with hash 69261705, now seen corresponding path program 1 times [2025-01-09 22:32:57,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:57,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6250364] [2025-01-09 22:32:57,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:57,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:57,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:32:57,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:32:57,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:57,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:57,560 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:32:57,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:57,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6250364] [2025-01-09 22:32:57,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6250364] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:57,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43995505] [2025-01-09 22:32:57,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:57,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:57,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:57,563 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:32:57,565 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:32:57,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:32:57,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:32:57,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:57,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:57,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:32:57,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:32:57,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:32:57,754 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:32:57,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-01-09 22:32:57,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:32:57,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43995505] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:32:57,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:32:57,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2025-01-09 22:32:57,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463504457] [2025-01-09 22:32:57,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:32:57,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:32:57,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:57,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:32:57,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:32:57,772 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:32:57,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:57,864 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2025-01-09 22:32:57,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:32:57,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2025-01-09 22:32:57,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:57,866 INFO L225 Difference]: With dead ends: 112 [2025-01-09 22:32:57,866 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 22:32:57,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:32:57,866 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 11 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:57,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 166 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:57,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 22:32:57,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2025-01-09 22:32:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 98 states have (on average 1.2653061224489797) internal successors, (124), 104 states have internal predecessors, (124), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:32:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 132 transitions. [2025-01-09 22:32:57,870 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 132 transitions. Word has length 39 [2025-01-09 22:32:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:57,870 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 132 transitions. [2025-01-09 22:32:57,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:32:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 132 transitions. [2025-01-09 22:32:57,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:32:57,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:57,871 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] [2025-01-09 22:32:57,884 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:32:58,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:58,072 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:58,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:58,072 INFO L85 PathProgramCache]: Analyzing trace with hash 69261706, now seen corresponding path program 1 times [2025-01-09 22:32:58,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:58,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129006] [2025-01-09 22:32:58,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:58,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:58,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:32:58,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:32:58,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:58,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:32:58,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:58,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129006] [2025-01-09 22:32:58,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129006] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:58,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998402529] [2025-01-09 22:32:58,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:58,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:58,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:58,235 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:32:58,255 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:32:58,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:32:58,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:32:58,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:58,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:58,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 22:32:58,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:58,399 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:32:58,531 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-01-09 22:32:58,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:32:58,545 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:32:58,551 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:32:58,551 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:32:58,691 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-01-09 22:32:58,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:32:58,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998402529] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:58,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:32:58,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 21 [2025-01-09 22:32:58,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464512880] [2025-01-09 22:32:58,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:32:58,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 22:32:58,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:58,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 22:32:58,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=635, Unknown=1, NotChecked=50, Total=756 [2025-01-09 22:32:58,917 INFO L87 Difference]: Start difference. First operand 110 states and 132 transitions. Second operand has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 19 states have internal predecessors, (67), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:32:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:59,288 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2025-01-09 22:32:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:32:59,289 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 19 states have internal predecessors, (67), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 39 [2025-01-09 22:32:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:59,290 INFO L225 Difference]: With dead ends: 114 [2025-01-09 22:32:59,290 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 22:32:59,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=1201, Unknown=1, NotChecked=70, Total=1406 [2025-01-09 22:32:59,291 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 38 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:59,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 419 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 440 Invalid, 0 Unknown, 90 Unchecked, 0.2s Time] [2025-01-09 22:32:59,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 22:32:59,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2025-01-09 22:32:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 98 states have (on average 1.2142857142857142) internal successors, (119), 104 states have internal predecessors, (119), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:32:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 127 transitions. [2025-01-09 22:32:59,294 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 127 transitions. Word has length 39 [2025-01-09 22:32:59,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:59,295 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 127 transitions. [2025-01-09 22:32:59,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 19 states have internal predecessors, (67), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:32:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 127 transitions. [2025-01-09 22:32:59,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:32:59,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:59,295 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:59,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-09 22:32:59,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:59,496 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:32:59,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:59,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1253349717, now seen corresponding path program 2 times [2025-01-09 22:32:59,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:59,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470396107] [2025-01-09 22:32:59,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:32:59,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:59,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 22:32:59,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:32:59,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:32:59,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:00,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:00,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470396107] [2025-01-09 22:33:00,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470396107] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:00,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961421627] [2025-01-09 22:33:00,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:33:00,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:00,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:00,700 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:33:00,701 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:33:00,791 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 22:33:00,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:33:00,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:33:00,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:00,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-01-09 22:33:00,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:00,834 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:33:01,043 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:33:01,046 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:33:01,116 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:33:01,116 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:33:01,170 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 27 treesize of output 26 [2025-01-09 22:33:01,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-01-09 22:33:01,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:01,306 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:33:01,306 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 58 [2025-01-09 22:33:01,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:01,314 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 46 treesize of output 25 [2025-01-09 22:33:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:01,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:35,799 INFO L349 Elim1Store]: treesize reduction 1473, result has 47.5 percent of original size [2025-01-09 22:33:35,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 4021 treesize of output 3715 [2025-01-09 22:33:36,734 INFO L349 Elim1Store]: treesize reduction 204, result has 39.5 percent of original size [2025-01-09 22:33:36,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 23 case distinctions, treesize of input 4650 treesize of output 3982 [2025-01-09 22:33:37,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:37,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 3105 treesize of output 3195 [2025-01-09 22:33:40,806 INFO L349 Elim1Store]: treesize reduction 1557, result has 46.0 percent of original size [2025-01-09 22:33:40,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 15 new quantified variables, introduced 68 case distinctions, treesize of input 14978 treesize of output 8673 [2025-01-09 22:33:41,582 INFO L224 Elim1Store]: Index analysis took 108 ms [2025-01-09 22:33:42,440 INFO L349 Elim1Store]: treesize reduction 388, result has 40.9 percent of original size [2025-01-09 22:33:42,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 4922 treesize of output 4600 [2025-01-09 22:33:42,750 INFO L224 Elim1Store]: Index analysis took 112 ms [2025-01-09 22:33:42,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:43,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 4438 treesize of output 4460