./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-shared-before.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-shared-before.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 332869ec37f6f5fc1ff0b6d6275b635675d9112e392919be0a978cd693d61f8f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:34:07,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:34:07,543 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:34:07,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:34:07,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:34:07,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:34:07,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:34:07,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:34:07,582 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:34:07,582 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:34:07,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:34:07,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:34:07,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:34:07,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:34:07,584 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:34:07,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:34:07,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:34:07,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:34:07,585 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:34:07,585 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:34:07,585 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:34:07,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:34:07,586 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:34:07,586 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:34:07,586 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:34:07,586 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:34:07,586 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:34:07,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:34:07,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:34:07,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:34:07,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:34:07,587 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:34:07,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:34:07,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:34:07,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:34:07,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:34:07,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:34:07,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:34:07,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:34:07,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:34:07,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:34:07,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:34:07,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:34:07,588 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:34:07,589 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 -> 332869ec37f6f5fc1ff0b6d6275b635675d9112e392919be0a978cd693d61f8f [2025-01-09 22:34:07,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:34:07,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:34:07,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:34:07,904 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:34:07,906 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:34:07,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-shared-before.i [2025-01-09 22:34:09,287 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cadae7daa/92c0bac03a0e45c0b8987b3b6aa9229b/FLAG0d2d7c897 [2025-01-09 22:34:09,693 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:34:09,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-shared-before.i [2025-01-09 22:34:09,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cadae7daa/92c0bac03a0e45c0b8987b3b6aa9229b/FLAG0d2d7c897 [2025-01-09 22:34:09,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cadae7daa/92c0bac03a0e45c0b8987b3b6aa9229b [2025-01-09 22:34:09,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:34:09,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:34:09,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:34:09,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:34:09,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:34:09,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:34:09" (1/1) ... [2025-01-09 22:34:09,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd28bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:09, skipping insertion in model container [2025-01-09 22:34:09,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:34:09" (1/1) ... [2025-01-09 22:34:09,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:34:10,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:34:10,032 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:34:10,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:34:10,102 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:34:10,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:10 WrapperNode [2025-01-09 22:34:10,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:34:10,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:34:10,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:34:10,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:34:10,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:10" (1/1) ... [2025-01-09 22:34:10,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:10" (1/1) ... [2025-01-09 22:34:10,142 INFO L138 Inliner]: procedures = 120, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2025-01-09 22:34:10,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:34:10,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:34:10,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:34:10,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:34:10,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:10" (1/1) ... [2025-01-09 22:34:10,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:10" (1/1) ... [2025-01-09 22:34:10,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:10" (1/1) ... [2025-01-09 22:34:10,174 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 5 writes are split as follows [5]. [2025-01-09 22:34:10,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:10" (1/1) ... [2025-01-09 22:34:10,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:10" (1/1) ... [2025-01-09 22:34:10,180 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:10" (1/1) ... [2025-01-09 22:34:10,184 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:10" (1/1) ... [2025-01-09 22:34:10,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:10" (1/1) ... [2025-01-09 22:34:10,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:10" (1/1) ... [2025-01-09 22:34:10,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:10" (1/1) ... [2025-01-09 22:34:10,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:34:10,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:34:10,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:34:10,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:34:10,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:10" (1/1) ... [2025-01-09 22:34:10,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:34:10,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:10,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:34:10,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:34:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:34:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-01-09 22:34:10,263 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-01-09 22:34:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:34:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:34:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:34:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:34:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:34:10,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:34:10,371 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:34:10,374 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:34:10,644 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2025-01-09 22:34:10,644 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:34:10,654 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:34:10,655 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 22:34:10,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:34:10 BoogieIcfgContainer [2025-01-09 22:34:10,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:34:10,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:34:10,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:34:10,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:34:10,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:34:09" (1/3) ... [2025-01-09 22:34:10,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f77e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:34:10, skipping insertion in model container [2025-01-09 22:34:10,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:10" (2/3) ... [2025-01-09 22:34:10,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f77e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:34:10, skipping insertion in model container [2025-01-09 22:34:10,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:34:10" (3/3) ... [2025-01-09 22:34:10,665 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-shared-before.i [2025-01-09 22:34:10,679 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:34:10,681 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-shared-before.i that has 2 procedures, 60 locations, 1 initial locations, 2 loop locations, and 23 error locations. [2025-01-09 22:34:10,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:34:10,730 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;@edc8e3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:34:10,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-09 22:34:10,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 56 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:34:10,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-09 22:34:10,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:10,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-09 22:34:10,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:10,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:10,745 INFO L85 PathProgramCache]: Analyzing trace with hash 35815, now seen corresponding path program 1 times [2025-01-09 22:34:10,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:10,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721968175] [2025-01-09 22:34:10,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:10,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:10,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 22:34:10,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 22:34:10,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:10,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:10,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:10,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:10,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721968175] [2025-01-09 22:34:10,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721968175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:10,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:10,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:10,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730622643] [2025-01-09 22:34:10,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:10,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:10,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:10,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:10,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:10,940 INFO L87 Difference]: Start difference. First operand has 60 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 56 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 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:11,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:11,032 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2025-01-09 22:34:11,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:11,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-09 22:34:11,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:11,040 INFO L225 Difference]: With dead ends: 59 [2025-01-09 22:34:11,041 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 22:34:11,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:11,045 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:11,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 89 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:11,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 22:34:11,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-09 22:34:11,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.71875) internal successors, (55), 53 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:34:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2025-01-09 22:34:11,078 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 3 [2025-01-09 22:34:11,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:11,079 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2025-01-09 22:34:11,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:11,079 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2025-01-09 22:34:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-09 22:34:11,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:11,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-09 22:34:11,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:34:11,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:11,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:11,081 INFO L85 PathProgramCache]: Analyzing trace with hash 35816, now seen corresponding path program 1 times [2025-01-09 22:34:11,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:11,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857818939] [2025-01-09 22:34:11,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:11,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:11,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 22:34:11,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 22:34:11,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:11,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:11,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:11,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857818939] [2025-01-09 22:34:11,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857818939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:11,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:11,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:11,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549490945] [2025-01-09 22:34:11,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:11,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:11,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:11,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:11,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:11,204 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:11,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:11,275 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2025-01-09 22:34:11,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:11,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-09 22:34:11,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:11,276 INFO L225 Difference]: With dead ends: 56 [2025-01-09 22:34:11,276 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 22:34:11,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:11,277 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 88 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:11,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 88 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:11,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 22:34:11,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-09 22:34:11,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.6875) internal successors, (54), 52 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:34:11,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2025-01-09 22:34:11,287 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 3 [2025-01-09 22:34:11,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:11,287 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2025-01-09 22:34:11,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:11,287 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2025-01-09 22:34:11,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:34:11,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:11,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:11,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:34:11,289 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:11,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:11,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1284324822, now seen corresponding path program 1 times [2025-01-09 22:34:11,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:11,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212595881] [2025-01-09 22:34:11,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:11,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:11,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:34:11,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:34:11,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:11,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:11,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:11,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212595881] [2025-01-09 22:34:11,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212595881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:11,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:11,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:11,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815177747] [2025-01-09 22:34:11,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:11,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:11,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:11,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:11,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:11,415 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:11,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:11,471 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2025-01-09 22:34:11,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:11,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-01-09 22:34:11,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:11,473 INFO L225 Difference]: With dead ends: 55 [2025-01-09 22:34:11,473 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 22:34:11,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:11,474 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 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:34:11,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:11,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 22:34:11,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-09 22:34:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.65625) internal successors, (53), 51 states have internal predecessors, (53), 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:34:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2025-01-09 22:34:11,480 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 7 [2025-01-09 22:34:11,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:11,480 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2025-01-09 22:34:11,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:11,481 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2025-01-09 22:34:11,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:34:11,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:11,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:11,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:34:11,482 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:11,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:11,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1284324821, now seen corresponding path program 1 times [2025-01-09 22:34:11,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:11,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506321187] [2025-01-09 22:34:11,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:11,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:11,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:34:11,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:34:11,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:11,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:11,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:11,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:11,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506321187] [2025-01-09 22:34:11,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506321187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:11,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:11,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:11,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199391489] [2025-01-09 22:34:11,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:11,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:11,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:11,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:11,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:11,584 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:11,638 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2025-01-09 22:34:11,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:11,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-01-09 22:34:11,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:11,640 INFO L225 Difference]: With dead ends: 54 [2025-01-09 22:34:11,640 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 22:34:11,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:11,642 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 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:34:11,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 22:34:11,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-01-09 22:34:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.625) internal successors, (52), 50 states have internal predecessors, (52), 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:34:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2025-01-09 22:34:11,651 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 7 [2025-01-09 22:34:11,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:11,652 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2025-01-09 22:34:11,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:11,652 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2025-01-09 22:34:11,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:34:11,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:11,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:11,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:34:11,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:11,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:11,653 INFO L85 PathProgramCache]: Analyzing trace with hash -165085785, now seen corresponding path program 1 times [2025-01-09 22:34:11,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:11,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942454719] [2025-01-09 22:34:11,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:11,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:11,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:34:11,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:34:11,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:11,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:11,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:11,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942454719] [2025-01-09 22:34:11,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942454719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:11,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:11,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:34:11,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225114586] [2025-01-09 22:34:11,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:11,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:34:11,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:11,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:34:11,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:34:11,790 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:34:11,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:11,921 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2025-01-09 22:34:11,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:34:11,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2025-01-09 22:34:11,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:11,923 INFO L225 Difference]: With dead ends: 56 [2025-01-09 22:34:11,923 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 22:34:11,923 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:34:11,924 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:11,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 136 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:11,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 22:34:11,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2025-01-09 22:34:11,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.53125) internal successors, (49), 47 states have internal predecessors, (49), 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:34:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2025-01-09 22:34:11,929 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 12 [2025-01-09 22:34:11,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:11,930 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2025-01-09 22:34:11,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:34:11,930 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2025-01-09 22:34:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:34:11,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:11,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:11,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:34:11,931 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:11,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:11,932 INFO L85 PathProgramCache]: Analyzing trace with hash -165085784, now seen corresponding path program 1 times [2025-01-09 22:34:11,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:11,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657802514] [2025-01-09 22:34:11,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:11,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:11,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:34:11,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:34:11,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:11,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:12,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:12,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657802514] [2025-01-09 22:34:12,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657802514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:12,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:12,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:34:12,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967039731] [2025-01-09 22:34:12,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:12,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:34:12,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:12,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:34:12,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:34:12,144 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:34:12,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:12,220 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2025-01-09 22:34:12,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:34:12,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2025-01-09 22:34:12,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:12,221 INFO L225 Difference]: With dead ends: 55 [2025-01-09 22:34:12,221 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 22:34:12,221 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:34:12,222 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 5 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:12,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 169 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:12,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 22:34:12,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2025-01-09 22:34:12,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.5) internal successors, (48), 46 states have internal predecessors, (48), 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:34:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2025-01-09 22:34:12,226 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 12 [2025-01-09 22:34:12,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:12,226 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-01-09 22:34:12,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:34:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2025-01-09 22:34:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:34:12,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:12,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:12,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:34:12,227 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:12,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:12,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2036731877, now seen corresponding path program 1 times [2025-01-09 22:34:12,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:12,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371803463] [2025-01-09 22:34:12,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:12,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:12,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:34:12,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:34:12,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:12,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:12,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:12,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:12,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371803463] [2025-01-09 22:34:12,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371803463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:12,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:12,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:12,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428772396] [2025-01-09 22:34:12,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:12,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:12,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:12,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:12,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:12,293 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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:34:12,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:12,301 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2025-01-09 22:34:12,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:12,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2025-01-09 22:34:12,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:12,304 INFO L225 Difference]: With dead ends: 49 [2025-01-09 22:34:12,304 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 22:34:12,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:12,305 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 14 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:12,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 73 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:12,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 22:34:12,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 22:34:12,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.46875) internal successors, (47), 45 states have internal predecessors, (47), 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:34:12,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2025-01-09 22:34:12,312 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 17 [2025-01-09 22:34:12,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:12,312 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2025-01-09 22:34:12,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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:34:12,312 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2025-01-09 22:34:12,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:34:12,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:12,313 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:34:12,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:34:12,313 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:12,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:12,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1285821170, now seen corresponding path program 1 times [2025-01-09 22:34:12,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:12,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818545584] [2025-01-09 22:34:12,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:12,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:12,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:34:12,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:34:12,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:12,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:12,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:12,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818545584] [2025-01-09 22:34:12,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818545584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:12,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:12,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:12,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103491172] [2025-01-09 22:34:12,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:12,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:12,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:12,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:12,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:12,370 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:34:12,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:12,391 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2025-01-09 22:34:12,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:12,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:34:12,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:12,393 INFO L225 Difference]: With dead ends: 48 [2025-01-09 22:34:12,393 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 22:34:12,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:12,393 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:12,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 60 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:12,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 22:34:12,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-09 22:34:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.4375) internal successors, (46), 44 states have internal predecessors, (46), 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:34:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2025-01-09 22:34:12,399 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 18 [2025-01-09 22:34:12,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:12,399 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2025-01-09 22:34:12,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:34:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2025-01-09 22:34:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:34:12,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:12,400 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:34:12,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:34:12,400 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:12,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:12,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1205750521, now seen corresponding path program 1 times [2025-01-09 22:34:12,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:12,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865959318] [2025-01-09 22:34:12,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:12,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:12,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:34:12,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:34:12,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:12,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:12,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:12,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865959318] [2025-01-09 22:34:12,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865959318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:12,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:12,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:34:12,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314506553] [2025-01-09 22:34:12,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:12,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:34:12,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:12,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:34:12,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:34:12,567 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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:34:12,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:12,659 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2025-01-09 22:34:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:34:12,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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:34:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:12,660 INFO L225 Difference]: With dead ends: 47 [2025-01-09 22:34:12,660 INFO L226 Difference]: Without dead ends: 47 [2025-01-09 22:34:12,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:34:12,661 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:12,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 90 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:12,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-09 22:34:12,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-01-09 22:34:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.40625) internal successors, (45), 43 states have internal predecessors, (45), 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:34:12,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2025-01-09 22:34:12,664 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 19 [2025-01-09 22:34:12,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:12,664 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2025-01-09 22:34:12,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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:34:12,665 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2025-01-09 22:34:12,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:34:12,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:12,665 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:12,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:34:12,666 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:12,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:12,666 INFO L85 PathProgramCache]: Analyzing trace with hash -503392490, now seen corresponding path program 1 times [2025-01-09 22:34:12,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:12,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125606838] [2025-01-09 22:34:12,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:12,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:12,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:34:12,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:34:12,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:12,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:12,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:12,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125606838] [2025-01-09 22:34:12,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125606838] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:12,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886721621] [2025-01-09 22:34:12,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:12,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:12,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:12,921 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:12,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:34:12,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:34:13,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:34:13,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:13,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:13,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 22:34:13,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:13,078 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:34:13,151 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:34:13,152 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:34:13,162 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:34:13,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:34:13,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886721621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:13,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:34:13,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2025-01-09 22:34:13,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088200416] [2025-01-09 22:34:13,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:13,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:34:13,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:13,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:34:13,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-01-09 22:34:13,164 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:34:13,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:13,225 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2025-01-09 22:34:13,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:34:13,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 21 [2025-01-09 22:34:13,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:13,226 INFO L225 Difference]: With dead ends: 53 [2025-01-09 22:34:13,226 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 22:34:13,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 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:34:13,227 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 9 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:13,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 77 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 67 Unchecked, 0.1s Time] [2025-01-09 22:34:13,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 22:34:13,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-01-09 22:34:13,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-01-09 22:34:13,231 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 21 [2025-01-09 22:34:13,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:13,231 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-01-09 22:34:13,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:34:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-01-09 22:34:13,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:34:13,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:13,232 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:13,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 22:34:13,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 22:34:13,433 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:13,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:13,434 INFO L85 PathProgramCache]: Analyzing trace with hash -503392489, now seen corresponding path program 1 times [2025-01-09 22:34:13,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:13,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314425075] [2025-01-09 22:34:13,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:13,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:13,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:34:13,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:34:13,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:13,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:13,806 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:34:13,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:13,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314425075] [2025-01-09 22:34:13,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314425075] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:13,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267841998] [2025-01-09 22:34:13,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:13,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:13,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:13,810 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:13,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:34:13,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:34:13,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:34:13,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:13,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:13,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 22:34:13,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:13,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:34:14,121 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:34:14,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:14,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:34:14,175 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:14,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:34:14,182 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:34:14,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:14,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267841998] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:14,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:14,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-01-09 22:34:14,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952762194] [2025-01-09 22:34:14,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:14,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:34:14,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:14,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:34:14,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=260, Unknown=1, NotChecked=32, Total=342 [2025-01-09 22:34:14,321 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:34:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:14,570 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2025-01-09 22:34:14,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:34:14,571 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2025-01-09 22:34:14,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:14,571 INFO L225 Difference]: With dead ends: 60 [2025-01-09 22:34:14,571 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 22:34:14,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=322, Unknown=1, NotChecked=36, Total=420 [2025-01-09 22:34:14,572 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 26 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:14,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 306 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 213 Invalid, 0 Unknown, 60 Unchecked, 0.2s Time] [2025-01-09 22:34:14,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 22:34:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2025-01-09 22:34:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.4) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2025-01-09 22:34:14,576 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 21 [2025-01-09 22:34:14,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:14,576 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2025-01-09 22:34:14,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:34:14,577 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2025-01-09 22:34:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:34:14,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:14,577 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] [2025-01-09 22:34:14,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:34:14,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:14,782 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:14,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:14,783 INFO L85 PathProgramCache]: Analyzing trace with hash 914922090, now seen corresponding path program 1 times [2025-01-09 22:34:14,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:14,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744560700] [2025-01-09 22:34:14,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:14,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:14,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:34:14,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:34:14,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:14,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:15,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:15,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:15,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744560700] [2025-01-09 22:34:15,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744560700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:15,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:15,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 22:34:15,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2814990] [2025-01-09 22:34:15,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:15,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:34:15,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:15,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:34:15,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:34:15,071 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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:34:15,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:15,275 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2025-01-09 22:34:15,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:34:15,275 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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 21 [2025-01-09 22:34:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:15,277 INFO L225 Difference]: With dead ends: 62 [2025-01-09 22:34:15,277 INFO L226 Difference]: Without dead ends: 62 [2025-01-09 22:34:15,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:34:15,278 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:15,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 193 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:34:15,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-09 22:34:15,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-09 22:34:15,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 57 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2025-01-09 22:34:15,282 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 21 [2025-01-09 22:34:15,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:15,282 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2025-01-09 22:34:15,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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:34:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2025-01-09 22:34:15,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:34:15,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:15,283 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] [2025-01-09 22:34:15,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:34:15,283 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:15,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:15,284 INFO L85 PathProgramCache]: Analyzing trace with hash 914922091, now seen corresponding path program 1 times [2025-01-09 22:34:15,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:15,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844221790] [2025-01-09 22:34:15,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:15,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:15,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:34:15,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:34:15,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:15,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:15,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:15,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844221790] [2025-01-09 22:34:15,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844221790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:15,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:15,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:34:15,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112436318] [2025-01-09 22:34:15,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:15,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:34:15,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:15,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:34:15,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:15,542 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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:34:15,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:15,680 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2025-01-09 22:34:15,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:34:15,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 21 [2025-01-09 22:34:15,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:15,681 INFO L225 Difference]: With dead ends: 64 [2025-01-09 22:34:15,681 INFO L226 Difference]: Without dead ends: 64 [2025-01-09 22:34:15,682 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:34:15,682 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:15,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 181 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-09 22:34:15,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-01-09 22:34:15,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 59 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:15,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2025-01-09 22:34:15,686 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 21 [2025-01-09 22:34:15,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:15,686 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2025-01-09 22:34:15,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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:34:15,686 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2025-01-09 22:34:15,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:34:15,686 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:15,687 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] [2025-01-09 22:34:15,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:34:15,687 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:15,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:15,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1702174303, now seen corresponding path program 1 times [2025-01-09 22:34:15,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:15,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830137228] [2025-01-09 22:34:15,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:15,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:15,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:34:15,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:34:15,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:15,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:15,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:15,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830137228] [2025-01-09 22:34:15,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830137228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:15,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:15,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:34:15,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680567785] [2025-01-09 22:34:15,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:15,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:34:15,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:15,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:34:15,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:15,796 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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:34:15,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:15,859 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2025-01-09 22:34:15,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:34:15,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 22 [2025-01-09 22:34:15,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:15,860 INFO L225 Difference]: With dead ends: 71 [2025-01-09 22:34:15,860 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 22:34:15,860 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:34:15,861 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 20 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 272 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:34:15,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 272 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:15,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 22:34:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2025-01-09 22:34:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.3) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2025-01-09 22:34:15,864 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 22 [2025-01-09 22:34:15,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:15,865 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2025-01-09 22:34:15,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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:34:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2025-01-09 22:34:15,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:34:15,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:15,866 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:34:15,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:34:15,866 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:15,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:15,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1460130063, now seen corresponding path program 1 times [2025-01-09 22:34:15,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:15,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146524335] [2025-01-09 22:34:15,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:15,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:15,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:34:15,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:34:15,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:15,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:15,974 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:34:15,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:15,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146524335] [2025-01-09 22:34:15,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146524335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:15,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:15,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:34:15,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453194503] [2025-01-09 22:34:15,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:15,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:34:15,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:15,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:34:15,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:34:15,976 INFO L87 Difference]: Start difference. First operand 65 states and 71 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:34:16,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:16,063 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2025-01-09 22:34:16,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:34:16,063 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:34:16,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:16,064 INFO L225 Difference]: With dead ends: 64 [2025-01-09 22:34:16,064 INFO L226 Difference]: Without dead ends: 64 [2025-01-09 22:34:16,064 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:34:16,064 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:16,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 154 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:16,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-09 22:34:16,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-01-09 22:34:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.26) internal successors, (63), 59 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2025-01-09 22:34:16,071 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 24 [2025-01-09 22:34:16,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:16,071 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2025-01-09 22:34:16,072 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:34:16,072 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2025-01-09 22:34:16,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:34:16,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:16,072 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:34:16,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:34:16,073 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:16,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:16,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1460130064, now seen corresponding path program 1 times [2025-01-09 22:34:16,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:16,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061541121] [2025-01-09 22:34:16,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:16,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:16,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:34:16,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:34:16,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:16,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:16,309 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:34:16,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:16,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061541121] [2025-01-09 22:34:16,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061541121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:16,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:16,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:34:16,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221803913] [2025-01-09 22:34:16,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:16,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:34:16,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:16,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:34:16,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:34:16,312 INFO L87 Difference]: Start difference. First operand 64 states and 69 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:34:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:16,414 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2025-01-09 22:34:16,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:34:16,414 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:34:16,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:16,415 INFO L225 Difference]: With dead ends: 63 [2025-01-09 22:34:16,415 INFO L226 Difference]: Without dead ends: 63 [2025-01-09 22:34:16,415 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:34:16,416 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 170 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:34:16,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 170 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-09 22:34:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-01-09 22:34:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.22) internal successors, (61), 58 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:34:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2025-01-09 22:34:16,419 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 24 [2025-01-09 22:34:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:16,419 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2025-01-09 22:34:16,419 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:34:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2025-01-09 22:34:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:34:16,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:16,424 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:34:16,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:34:16,424 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:16,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:16,425 INFO L85 PathProgramCache]: Analyzing trace with hash 581555607, now seen corresponding path program 1 times [2025-01-09 22:34:16,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:16,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571207836] [2025-01-09 22:34:16,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:16,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:16,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:34:16,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:34:16,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:16,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:16,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:16,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571207836] [2025-01-09 22:34:16,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571207836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:16,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:16,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:34:16,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151460879] [2025-01-09 22:34:16,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:16,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:34:16,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:16,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:34:16,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:16,572 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 9 states, 8 states have (on average 2.75) 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:34:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:16,672 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2025-01-09 22:34:16,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:34:16,673 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) 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:34:16,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:16,673 INFO L225 Difference]: With dead ends: 68 [2025-01-09 22:34:16,673 INFO L226 Difference]: Without dead ends: 68 [2025-01-09 22:34:16,674 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:34:16,674 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:16,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 213 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:16,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-09 22:34:16,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2025-01-09 22:34:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.2592592592592593) 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:34:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2025-01-09 22:34:16,680 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 24 [2025-01-09 22:34:16,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:16,680 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2025-01-09 22:34:16,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) 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:34:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2025-01-09 22:34:16,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:34:16,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:16,683 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] [2025-01-09 22:34:16,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:34:16,683 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:16,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:16,683 INFO L85 PathProgramCache]: Analyzing trace with hash -774885937, now seen corresponding path program 1 times [2025-01-09 22:34:16,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:16,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36089725] [2025-01-09 22:34:16,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:16,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:16,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:34:16,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:34:16,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:16,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:17,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:17,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:17,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36089725] [2025-01-09 22:34:17,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36089725] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:17,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608178899] [2025-01-09 22:34:17,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:17,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:17,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:17,294 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:17,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:34:17,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:34:17,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:34:17,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:17,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:17,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 22:34:17,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:17,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 11 treesize of output 7 [2025-01-09 22:34:17,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:34:17,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:17,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 22:34:17,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:17,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 22:34:17,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:17,741 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:34:17,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:17,749 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:34:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:17,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:18,429 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:34:18,437 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:34:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:18,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608178899] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:18,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:18,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2025-01-09 22:34:18,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703680746] [2025-01-09 22:34:18,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:18,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 22:34:18,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:18,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 22:34:18,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2025-01-09 22:34:18,457 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 25 states have internal predecessors, (45), 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:34:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:18,858 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2025-01-09 22:34:18,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:34:18,858 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 25 states have internal predecessors, (45), 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 27 [2025-01-09 22:34:18,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:18,859 INFO L225 Difference]: With dead ends: 70 [2025-01-09 22:34:18,859 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 22:34:18,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2025-01-09 22:34:18,860 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:18,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 499 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:34:18,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 22:34:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-09 22:34:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 65 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:34:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2025-01-09 22:34:18,863 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 27 [2025-01-09 22:34:18,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:18,863 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2025-01-09 22:34:18,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 25 states have internal predecessors, (45), 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:34:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2025-01-09 22:34:18,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:34:18,864 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:18,864 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] [2025-01-09 22:34:18,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:34:19,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:19,069 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:19,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:19,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1748351708, now seen corresponding path program 1 times [2025-01-09 22:34:19,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:19,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523531740] [2025-01-09 22:34:19,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:19,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:19,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:34:19,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:34:19,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:19,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:19,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:19,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523531740] [2025-01-09 22:34:19,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523531740] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:19,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123795164] [2025-01-09 22:34:19,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:19,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:19,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:19,387 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:19,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 22:34:19,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:34:19,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:34:19,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:19,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:19,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 22:34:19,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:19,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2025-01-09 22:34:19,755 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:34:19,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 35 [2025-01-09 22:34:19,769 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_~l#1.base_16| Int) (|v_ULTIMATE.start_main_~data~0#1.base_12| Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~data~0#1.base_12| 1) |v_ULTIMATE.start_destroy_~l#1.base_16|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~data~0#1.base_12| 0) |v_ULTIMATE.start_destroy_~l#1.base_16| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~data~0#1.base_12|) 0))) is different from true [2025-01-09 22:34:19,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-01-09 22:34:19,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:19,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123795164] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:19,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:19,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2025-01-09 22:34:19,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601722686] [2025-01-09 22:34:19,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:19,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 22:34:19,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:19,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 22:34:19,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=533, Unknown=1, NotChecked=46, Total=650 [2025-01-09 22:34:19,948 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 21 states, 20 states have (on average 2.35) internal successors, (47), 18 states have internal predecessors, (47), 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:34:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:20,352 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2025-01-09 22:34:20,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:34:20,353 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 18 states have internal predecessors, (47), 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 28 [2025-01-09 22:34:20,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:20,353 INFO L225 Difference]: With dead ends: 72 [2025-01-09 22:34:20,353 INFO L226 Difference]: Without dead ends: 58 [2025-01-09 22:34:20,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=580, Unknown=1, NotChecked=48, Total=702 [2025-01-09 22:34:20,354 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:20,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 304 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 459 Invalid, 1 Unknown, 61 Unchecked, 0.4s Time] [2025-01-09 22:34:20,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-09 22:34:20,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-01-09 22:34:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.288888888888889) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:20,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2025-01-09 22:34:20,357 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 28 [2025-01-09 22:34:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:20,358 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2025-01-09 22:34:20,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 18 states have internal predecessors, (47), 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:34:20,358 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2025-01-09 22:34:20,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:34:20,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:20,359 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:34:20,367 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:34:20,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:20,563 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:20,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:20,564 INFO L85 PathProgramCache]: Analyzing trace with hash -287398432, now seen corresponding path program 1 times [2025-01-09 22:34:20,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:20,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496200865] [2025-01-09 22:34:20,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:20,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:20,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:34:20,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:34:20,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:20,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:20,983 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:34:20,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:20,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496200865] [2025-01-09 22:34:20,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496200865] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:20,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896149968] [2025-01-09 22:34:20,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:20,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:20,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:20,986 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:20,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:34:21,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:34:21,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:34:21,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:21,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:21,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:34:21,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:21,139 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:21,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:34:21,161 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:34:21,217 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:34:21,217 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:34:21,229 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:34:21,243 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:34:21,274 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:34:21,274 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:34:21,276 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:34:21,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:21,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896149968] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:21,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:21,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 22 [2025-01-09 22:34:21,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920102699] [2025-01-09 22:34:21,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:21,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 22:34:21,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:21,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 22:34:21,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=449, Unknown=1, NotChecked=42, Total=552 [2025-01-09 22:34:21,336 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 19 states have internal predecessors, (46), 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:34:21,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:21,637 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2025-01-09 22:34:21,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:34:21,639 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 19 states have internal predecessors, (46), 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:34:21,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:21,640 INFO L225 Difference]: With dead ends: 57 [2025-01-09 22:34:21,640 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 22:34:21,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=662, Unknown=1, NotChecked=52, Total=812 [2025-01-09 22:34:21,641 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:21,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 353 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 41 Unchecked, 0.2s Time] [2025-01-09 22:34:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 22:34:21,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-09 22:34:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 52 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:21,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2025-01-09 22:34:21,644 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 36 [2025-01-09 22:34:21,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:21,644 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2025-01-09 22:34:21,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 19 states have internal predecessors, (46), 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:34:21,644 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2025-01-09 22:34:21,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:34:21,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:21,645 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:34:21,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 22:34:21,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:21,845 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:21,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:21,846 INFO L85 PathProgramCache]: Analyzing trace with hash -287398431, now seen corresponding path program 1 times [2025-01-09 22:34:21,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:21,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727485933] [2025-01-09 22:34:21,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:21,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:21,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:34:21,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:34:21,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:21,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:22,444 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:34:22,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:22,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727485933] [2025-01-09 22:34:22,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727485933] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:22,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642797614] [2025-01-09 22:34:22,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:22,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:22,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:22,447 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:22,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:34:22,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:34:22,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:34:22,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:22,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:22,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 22:34:22,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:22,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:34:22,698 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:22,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:34:22,737 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:34:22,741 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:34:22,837 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:34:22,837 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:34:22,849 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:34:22,910 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:34:22,918 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:34:23,060 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alloc_and_zero_#res.base| Int)) (and (= (store |c_old(#length)| |alloc_and_zero_#res.base| (select |c_#length| |alloc_and_zero_#res.base|)) |c_#length|) (= (select |c_old(#valid)| |alloc_and_zero_#res.base|) 0))) is different from true [2025-01-09 22:34:23,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:23,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:34:23,114 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:23,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:34:23,145 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-01-09 22:34:23,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:23,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642797614] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:23,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:23,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2025-01-09 22:34:23,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348194247] [2025-01-09 22:34:23,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:23,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 22:34:23,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:23,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 22:34:23,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=971, Unknown=1, NotChecked=62, Total=1122 [2025-01-09 22:34:23,280 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 25 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:34:23,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:23,939 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2025-01-09 22:34:23,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:34:23,939 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 25 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2025-01-09 22:34:23,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:23,940 INFO L225 Difference]: With dead ends: 54 [2025-01-09 22:34:23,940 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 22:34:23,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=197, Invalid=1698, Unknown=1, NotChecked=84, Total=1980 [2025-01-09 22:34:23,941 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 27 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:23,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 570 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 548 Invalid, 0 Unknown, 50 Unchecked, 0.3s Time] [2025-01-09 22:34:23,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 22:34:23,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2025-01-09 22:34:23,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 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:34:23,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-01-09 22:34:23,945 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 36 [2025-01-09 22:34:23,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:23,945 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-01-09 22:34:23,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 25 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:34:23,945 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-01-09 22:34:23,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:34:23,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:23,946 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] [2025-01-09 22:34:23,954 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:34:24,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-09 22:34:24,150 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:24,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:24,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1130916148, now seen corresponding path program 1 times [2025-01-09 22:34:24,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:24,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488859146] [2025-01-09 22:34:24,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:24,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:24,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:34:24,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:34:24,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:24,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:24,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:24,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488859146] [2025-01-09 22:34:24,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488859146] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:24,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263028662] [2025-01-09 22:34:24,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:24,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:24,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:24,374 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:24,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 22:34:24,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:34:24,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:34:24,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:24,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:24,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 22:34:24,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:24,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:34:24,524 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:24,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:34:24,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:34:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:24,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:24,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:24,656 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 17 treesize of output 21 [2025-01-09 22:34:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:24,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263028662] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:24,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:24,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 14 [2025-01-09 22:34:24,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794694622] [2025-01-09 22:34:24,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:24,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:34:24,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:24,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:34:24,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:34:24,736 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:25,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:25,028 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2025-01-09 22:34:25,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:34:25,028 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2025-01-09 22:34:25,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:25,029 INFO L225 Difference]: With dead ends: 65 [2025-01-09 22:34:25,029 INFO L226 Difference]: Without dead ends: 65 [2025-01-09 22:34:25,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:34:25,030 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 44 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:25,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 166 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:34:25,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-09 22:34:25,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2025-01-09 22:34:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2) internal successors, (66), 59 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:34:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2025-01-09 22:34:25,033 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 36 [2025-01-09 22:34:25,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:25,034 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2025-01-09 22:34:25,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2025-01-09 22:34:25,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:34:25,034 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:25,034 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] [2025-01-09 22:34:25,043 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:34:25,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:25,235 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:25,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:25,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1130916149, now seen corresponding path program 1 times [2025-01-09 22:34:25,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:25,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561271069] [2025-01-09 22:34:25,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:25,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:25,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:34:25,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:34:25,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:25,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:25,465 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:34:25,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:25,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561271069] [2025-01-09 22:34:25,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561271069] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:25,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808085399] [2025-01-09 22:34:25,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:25,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:25,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:25,468 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:25,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 22:34:25,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:34:25,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:34:25,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:25,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:25,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 22:34:25,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:25,790 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:34:25,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:25,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:25,927 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 21 treesize of output 25 [2025-01-09 22:34:26,065 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:34:26,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808085399] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:26,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:26,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2025-01-09 22:34:26,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954689060] [2025-01-09 22:34:26,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:26,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 22:34:26,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:26,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 22:34:26,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2025-01-09 22:34:26,068 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 24 states have internal predecessors, (80), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:34:26,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:26,229 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2025-01-09 22:34:26,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:34:26,229 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 24 states have internal predecessors, (80), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2025-01-09 22:34:26,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:26,230 INFO L225 Difference]: With dead ends: 67 [2025-01-09 22:34:26,230 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 22:34:26,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2025-01-09 22:34:26,231 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:26,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 389 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:34:26,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 22:34:26,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2025-01-09 22:34:26,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 61 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2025-01-09 22:34:26,236 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 36 [2025-01-09 22:34:26,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:26,237 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2025-01-09 22:34:26,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 24 states have internal predecessors, (80), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:34:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2025-01-09 22:34:26,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:34:26,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:26,238 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:26,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 22:34:26,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:26,441 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:26,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:26,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2093497625, now seen corresponding path program 1 times [2025-01-09 22:34:26,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:26,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122929172] [2025-01-09 22:34:26,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:26,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:26,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:34:26,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:34:26,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:26,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:27,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:27,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:27,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122929172] [2025-01-09 22:34:27,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122929172] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:27,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104775278] [2025-01-09 22:34:27,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:27,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:27,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:27,297 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:34:27,298 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:34:27,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:34:27,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:34:27,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:27,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:27,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-01-09 22:34:27,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:27,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:34:27,487 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:34:27,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-09 22:34:27,699 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2025-01-09 22:34:27,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2025-01-09 22:34:27,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:34:27,891 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:34:27,891 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 39 [2025-01-09 22:34:28,100 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-01-09 22:34:28,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 28 [2025-01-09 22:34:28,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:28,139 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 27 treesize of output 21 [2025-01-09 22:34:28,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:34:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:28,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:28,525 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1007 Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base| v_ArrVal_1007) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1006) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)) 1)) (forall ((v_ArrVal_1006 (Array Int Int))) (not (= |c_ULTIMATE.start_create_~sll~0#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1006) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))))) is different from false [2025-01-09 22:34:28,535 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (and (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1007 Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base| v_ArrVal_1007) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1006) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)) 1)) (forall ((v_ArrVal_1006 (Array Int Int))) (not (= |c_ULTIMATE.start_create_~sll~0#1.base| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1006) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)))))) is different from false [2025-01-09 22:34:28,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:28,549 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 25 treesize of output 26 [2025-01-09 22:34:28,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:28,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2025-01-09 22:34:28,557 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 14 treesize of output 12 [2025-01-09 22:34:28,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:28,610 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 21 treesize of output 22 [2025-01-09 22:34:28,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:28,617 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 35 treesize of output 36 [2025-01-09 22:34:28,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-01-09 22:34:28,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104775278] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:28,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:28,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 37 [2025-01-09 22:34:28,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020043284] [2025-01-09 22:34:28,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:28,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 22:34:28,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:28,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 22:34:28,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1841, Unknown=2, NotChecked=174, Total=2162 [2025-01-09 22:34:28,842 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 38 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 33 states have internal predecessors, (67), 3 states have call successors, (3), 1 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:34:29,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:29,660 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2025-01-09 22:34:29,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:34:29,661 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 33 states have internal predecessors, (67), 3 states have call successors, (3), 1 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 42 [2025-01-09 22:34:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:29,661 INFO L225 Difference]: With dead ends: 71 [2025-01-09 22:34:29,661 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 22:34:29,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=240, Invalid=2846, Unknown=2, NotChecked=218, Total=3306 [2025-01-09 22:34:29,662 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:29,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 307 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:34:29,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 22:34:29,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-01-09 22:34:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 65 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:29,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2025-01-09 22:34:29,665 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 42 [2025-01-09 22:34:29,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:29,666 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2025-01-09 22:34:29,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 33 states have internal predecessors, (67), 3 states have call successors, (3), 1 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:34:29,666 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2025-01-09 22:34:29,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:34:29,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:29,667 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:29,674 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:34:29,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:29,867 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:29,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:29,868 INFO L85 PathProgramCache]: Analyzing trace with hash 2093497626, now seen corresponding path program 1 times [2025-01-09 22:34:29,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:29,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575438365] [2025-01-09 22:34:29,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:29,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:29,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:34:29,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:34:29,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:29,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:30,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:30,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575438365] [2025-01-09 22:34:30,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575438365] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:30,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067110765] [2025-01-09 22:34:30,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:30,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:30,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:30,754 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:34:30,755 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:34:30,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:34:30,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:34:30,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:30,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:30,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-01-09 22:34:30,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:30,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:34:31,055 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:31,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:34:31,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:34:31,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:34:31,173 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:34:31,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-09 22:34:31,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-09 22:34:31,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:31,324 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 27 treesize of output 21 [2025-01-09 22:34:31,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:31,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-01-09 22:34:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:31,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:31,797 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1102 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1102) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 8))) (forall ((v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int))) (<= (+ 16 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1102) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1103) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))))) is different from false [2025-01-09 22:34:31,803 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (and (forall ((v_ArrVal_1102 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1102) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)))) (forall ((v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int))) (<= (+ 16 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1102) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1103) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)))))) is different from false [2025-01-09 22:34:31,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:31,818 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 41 treesize of output 42 [2025-01-09 22:34:31,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:31,823 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 31 treesize of output 32 [2025-01-09 22:34:31,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:31,834 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 54 treesize of output 55 [2025-01-09 22:34:31,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:31,846 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 84 treesize of output 81 [2025-01-09 22:34:31,850 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 9 [2025-01-09 22:34:31,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-01-09 22:34:31,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:31,878 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 20 treesize of output 21 [2025-01-09 22:34:31,880 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:31,881 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 18 treesize of output 10 [2025-01-09 22:34:32,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067110765] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:32,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:32,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2025-01-09 22:34:32,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379341504] [2025-01-09 22:34:32,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:32,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-09 22:34:32,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:32,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-09 22:34:32,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2290, Unknown=2, NotChecked=194, Total=2652 [2025-01-09 22:34:32,003 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 40 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 35 states have internal predecessors, (73), 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:34:32,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:32,685 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2025-01-09 22:34:32,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:34:32,685 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 35 states have internal predecessors, (73), 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 42 [2025-01-09 22:34:32,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:32,686 INFO L225 Difference]: With dead ends: 73 [2025-01-09 22:34:32,686 INFO L226 Difference]: Without dead ends: 73 [2025-01-09 22:34:32,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=271, Invalid=3517, Unknown=2, NotChecked=242, Total=4032 [2025-01-09 22:34:32,688 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:32,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 492 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:34:32,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-09 22:34:32,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2025-01-09 22:34:32,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 67 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:32,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2025-01-09 22:34:32,691 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 42 [2025-01-09 22:34:32,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:32,692 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2025-01-09 22:34:32,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 35 states have internal predecessors, (73), 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:34:32,692 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2025-01-09 22:34:32,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:34:32,692 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:32,692 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:32,701 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:34:32,893 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,SelfDestructingSolverStorable24 [2025-01-09 22:34:32,893 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:32,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:32,894 INFO L85 PathProgramCache]: Analyzing trace with hash 473928914, now seen corresponding path program 1 times [2025-01-09 22:34:32,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:32,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309618367] [2025-01-09 22:34:32,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:32,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:32,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:34:32,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:34:32,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:32,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:33,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:33,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309618367] [2025-01-09 22:34:33,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309618367] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:33,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051809259] [2025-01-09 22:34:33,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:33,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:33,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:33,512 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:34:33,515 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:34:33,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:34:33,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:34:33,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:33,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:33,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-09 22:34:33,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:33,772 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:33,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:34:33,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:34:33,885 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:34:33,885 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 33 treesize of output 32 [2025-01-09 22:34:34,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:34,006 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 26 treesize of output 20 [2025-01-09 22:34:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:34,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:34,186 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1197 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1197) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 0))) is different from false [2025-01-09 22:34:34,191 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1197 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_1197) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 0))) is different from false [2025-01-09 22:34:34,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:34,199 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 21 treesize of output 22 [2025-01-09 22:34:34,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:34,206 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 35 treesize of output 36 [2025-01-09 22:34:34,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-01-09 22:34:34,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051809259] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:34,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:34,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 35 [2025-01-09 22:34:34,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969988712] [2025-01-09 22:34:34,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:34,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 22:34:34,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:34,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 22:34:34,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1444, Unknown=2, NotChecked=154, Total=1722 [2025-01-09 22:34:34,316 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 35 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 30 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:34:34,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:34,828 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2025-01-09 22:34:34,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:34:34,828 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 30 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2025-01-09 22:34:34,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:34,829 INFO L225 Difference]: With dead ends: 75 [2025-01-09 22:34:34,829 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 22:34:34,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=218, Invalid=2440, Unknown=2, NotChecked=202, Total=2862 [2025-01-09 22:34:34,830 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 27 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:34,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 510 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:34:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 22:34:34,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2025-01-09 22:34:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 67 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:34,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2025-01-09 22:34:34,833 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 43 [2025-01-09 22:34:34,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:34,833 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2025-01-09 22:34:34,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 30 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:34:34,834 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2025-01-09 22:34:34,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:34:34,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:34,834 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:34,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:35,035 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,SelfDestructingSolverStorable25 [2025-01-09 22:34:35,035 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:35,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:35,037 INFO L85 PathProgramCache]: Analyzing trace with hash 167673992, now seen corresponding path program 1 times [2025-01-09 22:34:35,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:35,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962860120] [2025-01-09 22:34:35,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:35,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:35,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:34:35,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:34:35,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:35,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:35,657 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:35,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:35,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962860120] [2025-01-09 22:34:35,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962860120] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:35,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564347624] [2025-01-09 22:34:35,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:35,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:35,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:35,659 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:34:35,659 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:34:35,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:34:35,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:34:35,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:35,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:35,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-09 22:34:35,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:35,917 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:35,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:34:35,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:34:36,007 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:34:36,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:34:36,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:36,135 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 27 treesize of output 21 [2025-01-09 22:34:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:36,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:36,338 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1288) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) |c_#StackHeapBarrier|)) is different from false [2025-01-09 22:34:36,342 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_1288) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) |c_#StackHeapBarrier|)) is different from false [2025-01-09 22:34:36,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:36,347 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 20 treesize of output 21 [2025-01-09 22:34:36,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:36,354 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 32 treesize of output 33 [2025-01-09 22:34:36,366 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 7 treesize of output 5 [2025-01-09 22:34:36,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564347624] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:36,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:36,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 34 [2025-01-09 22:34:36,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995064668] [2025-01-09 22:34:36,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:36,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 22:34:36,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:36,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 22:34:36,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1444, Unknown=2, NotChecked=154, Total=1722 [2025-01-09 22:34:36,443 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 35 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 30 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:34:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:37,067 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2025-01-09 22:34:37,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:34:37,067 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 30 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2025-01-09 22:34:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:37,068 INFO L225 Difference]: With dead ends: 74 [2025-01-09 22:34:37,068 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 22:34:37,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=214, Invalid=2444, Unknown=2, NotChecked=202, Total=2862 [2025-01-09 22:34:37,069 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:37,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 537 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:34:37,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 22:34:37,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2025-01-09 22:34:37,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 67 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2025-01-09 22:34:37,074 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 45 [2025-01-09 22:34:37,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:37,074 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2025-01-09 22:34:37,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 30 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:34:37,074 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2025-01-09 22:34:37,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 22:34:37,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:37,075 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:37,083 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:34:37,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:37,276 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-09 22:34:37,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:37,276 INFO L85 PathProgramCache]: Analyzing trace with hash 129028414, now seen corresponding path program 2 times [2025-01-09 22:34:37,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:37,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304766623] [2025-01-09 22:34:37,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:34:37,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:37,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-09 22:34:37,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:34:37,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:34:37,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:38,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:38,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304766623] [2025-01-09 22:34:38,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304766623] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:38,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230212157] [2025-01-09 22:34:38,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:34:38,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:38,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:38,457 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:34:38,459 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:34:38,569 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-09 22:34:38,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:34:38,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:34:38,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:38,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-01-09 22:34:38,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:38,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:34:38,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:34:38,756 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:38,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:34:38,815 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:34:38,821 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:34:38,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:38,972 INFO L349 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2025-01-09 22:34:38,972 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 2 case distinctions, treesize of input 103 treesize of output 60 [2025-01-09 22:34:38,988 INFO L349 Elim1Store]: treesize reduction 33, result has 28.3 percent of original size [2025-01-09 22:34:38,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 32 [2025-01-09 22:34:39,490 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2025-01-09 22:34:39,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 38 [2025-01-09 22:34:39,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:39,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2025-01-09 22:34:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:39,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:40,235 INFO L349 Elim1Store]: treesize reduction 516, result has 36.1 percent of original size [2025-01-09 22:34:40,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1287 treesize of output 1352 [2025-01-09 22:34:40,554 INFO L349 Elim1Store]: treesize reduction 243, result has 43.8 percent of original size [2025-01-09 22:34:40,555 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 2448 treesize of output 1491 [2025-01-09 22:34:40,816 INFO L349 Elim1Store]: treesize reduction 204, result has 39.5 percent of original size [2025-01-09 22:34:40,817 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 2605 treesize of output 2151 [2025-01-09 22:34:41,060 INFO L349 Elim1Store]: treesize reduction 8, result has 95.2 percent of original size [2025-01-09 22:34:41,060 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 2004 treesize of output 2068 [2025-01-09 22:34:41,405 INFO L349 Elim1Store]: treesize reduction 276, result has 43.2 percent of original size [2025-01-09 22:34:41,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 1442 treesize of output 1574 [2025-01-09 22:34:41,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:41,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1482 treesize of output 1583 [2025-01-09 22:34:47,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:34:47,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:34:49,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:34:49,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:34:49,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:34:49,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:34:51,519 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-09 22:35:07,166 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 3670 treesize of output 3666 [2025-01-09 22:35:13,075 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 3797 treesize of output 3793 [2025-01-09 22:35:15,188 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 170 treesize of output 166 [2025-01-09 22:35:15,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:35:15,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2025-01-09 22:35:15,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:35:16,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:35:17,025 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 135 treesize of output 131 [2025-01-09 22:35:17,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:35:17,273 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 30 treesize of output 26 [2025-01-09 22:35:17,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:35:17,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:35:17,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:35:17,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:35:17,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:35:17,973 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 30 treesize of output 26 [2025-01-09 22:35:18,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 368 treesize of output 364 [2025-01-09 22:35:18,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:35:19,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:35:19,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:35:19,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:35:19,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:35:20,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:35:21,307 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 272 treesize of output 266 [2025-01-09 22:35:24,425 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 65 treesize of output 61 [2025-01-09 22:35:24,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:35:24,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:35:24,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:35:24,790 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 116 treesize of output 112 [2025-01-09 22:35:24,913 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 48 treesize of output 44 [2025-01-09 22:35:25,027 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-09 22:35:25,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 112 [2025-01-09 22:35:25,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2025-01-09 22:35:25,746 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 5888 treesize of output 5840