./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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/forester-heap/sll-optional-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:33:57,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:33:57,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:33:57,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:33:57,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:33:57,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:33:57,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:33:57,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:33:57,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:33:57,128 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:33:57,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:33:57,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:33:57,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:33:57,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:33:57,132 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:33:57,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:33:57,132 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:33:57,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:33:57,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:33:57,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:33:57,132 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:33:57,132 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:33:57,132 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:33:57,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:33:57,132 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:33:57,132 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:33:57,132 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:33:57,132 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:33:57,132 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:33:57,132 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:33:57,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:33:57,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:33:57,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:33:57,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:33:57,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:33:57,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:33:57,133 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:33:57,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:33:57,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:33:57,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:33:57,133 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:33:57,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:33:57,133 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 [2025-02-06 10:33:57,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:33:57,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:33:57,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:33:57,371 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:33:57,371 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:33:57,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-optional-1.i [2025-02-06 10:33:58,526 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d97d086dc/aeaa7252bf49410caefaffa90969a2d4/FLAGec67b7766 [2025-02-06 10:33:58,769 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:33:58,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i [2025-02-06 10:33:58,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d97d086dc/aeaa7252bf49410caefaffa90969a2d4/FLAGec67b7766 [2025-02-06 10:33:59,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d97d086dc/aeaa7252bf49410caefaffa90969a2d4 [2025-02-06 10:33:59,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:33:59,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:33:59,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:33:59,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:33:59,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:33:59,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:33:59" (1/1) ... [2025-02-06 10:33:59,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c199b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:59, skipping insertion in model container [2025-02-06 10:33:59,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:33:59" (1/1) ... [2025-02-06 10:33:59,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:33:59,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:33:59,275 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:33:59,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:33:59,319 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:33:59,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:59 WrapperNode [2025-02-06 10:33:59,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:33:59,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:33:59,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:33:59,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:33:59,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:59" (1/1) ... [2025-02-06 10:33:59,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:59" (1/1) ... [2025-02-06 10:33:59,342 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 133 [2025-02-06 10:33:59,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:33:59,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:33:59,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:33:59,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:33:59,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:59" (1/1) ... [2025-02-06 10:33:59,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:59" (1/1) ... [2025-02-06 10:33:59,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:59" (1/1) ... [2025-02-06 10:33:59,363 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 17 writes are split as follows [0, 17]. [2025-02-06 10:33:59,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:59" (1/1) ... [2025-02-06 10:33:59,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:59" (1/1) ... [2025-02-06 10:33:59,367 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:59" (1/1) ... [2025-02-06 10:33:59,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:59" (1/1) ... [2025-02-06 10:33:59,368 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:59" (1/1) ... [2025-02-06 10:33:59,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:59" (1/1) ... [2025-02-06 10:33:59,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:33:59,373 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:33:59,373 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:33:59,373 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:33:59,374 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:59" (1/1) ... [2025-02-06 10:33:59,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:33:59,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:33:59,399 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-02-06 10:33:59,402 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-02-06 10:33:59,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:33:59,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:33:59,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:33:59,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:33:59,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:33:59,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:33:59,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:33:59,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:33:59,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:33:59,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:33:59,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:33:59,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:33:59,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:33:59,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:33:59,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:33:59,500 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:33:59,502 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:33:59,835 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2025-02-06 10:33:59,837 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:33:59,848 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:33:59,849 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:33:59,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:33:59 BoogieIcfgContainer [2025-02-06 10:33:59,850 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:33:59,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:33:59,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:33:59,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:33:59,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:33:59" (1/3) ... [2025-02-06 10:33:59,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660eb32c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:33:59, skipping insertion in model container [2025-02-06 10:33:59,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:59" (2/3) ... [2025-02-06 10:33:59,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660eb32c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:33:59, skipping insertion in model container [2025-02-06 10:33:59,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:33:59" (3/3) ... [2025-02-06 10:33:59,857 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2025-02-06 10:33:59,868 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:33:59,869 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-optional-1.i that has 1 procedures, 144 locations, 1 initial locations, 4 loop locations, and 66 error locations. [2025-02-06 10:33:59,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:33:59,936 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;@6e700ba1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:33:59,939 INFO L334 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2025-02-06 10:33:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 77 states have (on average 2.064935064935065) internal successors, (159), 143 states have internal predecessors, (159), 0 states have call successors, (0), 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-02-06 10:33:59,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:33:59,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:59,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:33:59,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:59,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:59,954 INFO L85 PathProgramCache]: Analyzing trace with hash 188637, now seen corresponding path program 1 times [2025-02-06 10:33:59,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:59,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217116932] [2025-02-06 10:33:59,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:59,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:00,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:34:00,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:34:00,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:00,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:00,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:00,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217116932] [2025-02-06 10:34:00,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217116932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:00,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:00,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:34:00,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099763284] [2025-02-06 10:34:00,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:00,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:34:00,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:00,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:34:00,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:34:00,161 INFO L87 Difference]: Start difference. First operand has 144 states, 77 states have (on average 2.064935064935065) internal successors, (159), 143 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 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-02-06 10:34:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:00,268 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2025-02-06 10:34:00,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:34:00,270 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-02-06 10:34:00,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:00,274 INFO L225 Difference]: With dead ends: 138 [2025-02-06 10:34:00,275 INFO L226 Difference]: Without dead ends: 136 [2025-02-06 10:34:00,276 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-02-06 10:34:00,277 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 113 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:00,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 85 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:34:00,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-06 10:34:00,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2025-02-06 10:34:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 78 states have (on average 1.8846153846153846) internal successors, (147), 134 states have internal predecessors, (147), 0 states have call successors, (0), 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-02-06 10:34:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2025-02-06 10:34:00,302 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 3 [2025-02-06 10:34:00,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:00,303 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2025-02-06 10:34:00,303 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-02-06 10:34:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2025-02-06 10:34:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:34:00,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:00,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:34:00,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:34:00,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:00,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:00,307 INFO L85 PathProgramCache]: Analyzing trace with hash 188638, now seen corresponding path program 1 times [2025-02-06 10:34:00,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:00,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074863733] [2025-02-06 10:34:00,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:00,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:00,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:34:00,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:34:00,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:00,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:00,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:00,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074863733] [2025-02-06 10:34:00,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074863733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:00,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:00,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:34:00,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829629880] [2025-02-06 10:34:00,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:00,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:34:00,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:00,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:34:00,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:34:00,398 INFO L87 Difference]: Start difference. First operand 135 states and 147 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-02-06 10:34:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:00,494 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2025-02-06 10:34:00,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:34:00,495 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-02-06 10:34:00,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:00,496 INFO L225 Difference]: With dead ends: 127 [2025-02-06 10:34:00,496 INFO L226 Difference]: Without dead ends: 127 [2025-02-06 10:34:00,496 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-02-06 10:34:00,497 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 102 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:00,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 96 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:34:00,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-06 10:34:00,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-06 10:34:00,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 78 states have (on average 1.7820512820512822) internal successors, (139), 126 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2025-02-06 10:34:00,509 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 3 [2025-02-06 10:34:00,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:00,509 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2025-02-06 10:34:00,509 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-02-06 10:34:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2025-02-06 10:34:00,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:34:00,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:00,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:00,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:34:00,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:00,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:00,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1207299480, now seen corresponding path program 1 times [2025-02-06 10:34:00,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:00,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112436318] [2025-02-06 10:34:00,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:00,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:00,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:34:00,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:34:00,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:00,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:00,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:00,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112436318] [2025-02-06 10:34:00,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112436318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:00,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:00,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:34:00,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006121309] [2025-02-06 10:34:00,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:00,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:34:00,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:00,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:34:00,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:34:00,697 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-02-06 10:34:00,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:00,868 INFO L93 Difference]: Finished difference Result 168 states and 185 transitions. [2025-02-06 10:34:00,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:34:00,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2025-02-06 10:34:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:00,869 INFO L225 Difference]: With dead ends: 168 [2025-02-06 10:34:00,869 INFO L226 Difference]: Without dead ends: 168 [2025-02-06 10:34:00,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:34:00,870 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 46 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:00,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 314 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:34:00,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-06 10:34:00,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 126. [2025-02-06 10:34:00,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 78 states have (on average 1.7692307692307692) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 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-02-06 10:34:00,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2025-02-06 10:34:00,878 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 11 [2025-02-06 10:34:00,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:00,878 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2025-02-06 10:34:00,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-02-06 10:34:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2025-02-06 10:34:00,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:34:00,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:00,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:00,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:34:00,879 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:00,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:00,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1207299479, now seen corresponding path program 1 times [2025-02-06 10:34:00,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:00,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984952284] [2025-02-06 10:34:00,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:00,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:00,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:34:00,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:34:00,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:00,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:01,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:01,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984952284] [2025-02-06 10:34:01,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984952284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:01,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:01,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:34:01,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798777952] [2025-02-06 10:34:01,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:01,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:34:01,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:01,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:34:01,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:34:01,082 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-02-06 10:34:01,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:01,219 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2025-02-06 10:34:01,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:34:01,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2025-02-06 10:34:01,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:01,220 INFO L225 Difference]: With dead ends: 125 [2025-02-06 10:34:01,220 INFO L226 Difference]: Without dead ends: 125 [2025-02-06 10:34:01,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:34:01,221 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:01,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 349 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:34:01,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-06 10:34:01,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-02-06 10:34:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 78 states have (on average 1.7564102564102564) internal successors, (137), 124 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2025-02-06 10:34:01,226 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 11 [2025-02-06 10:34:01,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:01,226 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2025-02-06 10:34:01,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-02-06 10:34:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2025-02-06 10:34:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:34:01,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:01,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:01,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:34:01,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:01,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:01,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2122051501, now seen corresponding path program 1 times [2025-02-06 10:34:01,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:01,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812101886] [2025-02-06 10:34:01,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:01,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:01,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:34:01,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:34:01,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:01,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:01,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:01,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:01,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812101886] [2025-02-06 10:34:01,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812101886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:01,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:01,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:34:01,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803562024] [2025-02-06 10:34:01,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:01,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:34:01,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:01,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:34:01,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:34:01,316 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-02-06 10:34:01,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:01,430 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2025-02-06 10:34:01,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:34:01,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-02-06 10:34:01,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:01,431 INFO L225 Difference]: With dead ends: 121 [2025-02-06 10:34:01,431 INFO L226 Difference]: Without dead ends: 121 [2025-02-06 10:34:01,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:34:01,432 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 147 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:01,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 73 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:34:01,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-06 10:34:01,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2025-02-06 10:34:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 85 states have (on average 1.6) internal successors, (136), 118 states have internal predecessors, (136), 0 states have call successors, (0), 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-02-06 10:34:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2025-02-06 10:34:01,438 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 12 [2025-02-06 10:34:01,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:01,438 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2025-02-06 10:34:01,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-02-06 10:34:01,438 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2025-02-06 10:34:01,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:34:01,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:01,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:01,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:34:01,438 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:01,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:01,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2122051502, now seen corresponding path program 1 times [2025-02-06 10:34:01,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:01,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120451130] [2025-02-06 10:34:01,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:01,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:01,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:34:01,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:34:01,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:01,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:01,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:01,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120451130] [2025-02-06 10:34:01,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120451130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:01,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:01,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:34:01,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889480201] [2025-02-06 10:34:01,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:01,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:34:01,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:01,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:34:01,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:34:01,548 INFO L87 Difference]: Start difference. First operand 119 states and 136 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-02-06 10:34:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:01,687 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2025-02-06 10:34:01,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:34:01,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-02-06 10:34:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:01,688 INFO L225 Difference]: With dead ends: 156 [2025-02-06 10:34:01,688 INFO L226 Difference]: Without dead ends: 156 [2025-02-06 10:34:01,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:34:01,689 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 156 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:01,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 122 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:34:01,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-06 10:34:01,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 147. [2025-02-06 10:34:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 113 states have (on average 1.5221238938053097) internal successors, (172), 146 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2025-02-06 10:34:01,696 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 12 [2025-02-06 10:34:01,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:01,696 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2025-02-06 10:34:01,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-02-06 10:34:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2025-02-06 10:34:01,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:34:01,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:01,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:01,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:34:01,697 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:01,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:01,697 INFO L85 PathProgramCache]: Analyzing trace with hash 410489687, now seen corresponding path program 1 times [2025-02-06 10:34:01,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:01,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977235876] [2025-02-06 10:34:01,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:01,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:01,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:34:01,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:34:01,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:01,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:01,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:01,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:01,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977235876] [2025-02-06 10:34:01,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977235876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:01,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:01,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:34:01,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578332747] [2025-02-06 10:34:01,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:01,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:34:01,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:01,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:34:01,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:34:01,739 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-02-06 10:34:01,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:01,820 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2025-02-06 10:34:01,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:34:01,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-02-06 10:34:01,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:01,821 INFO L225 Difference]: With dead ends: 160 [2025-02-06 10:34:01,821 INFO L226 Difference]: Without dead ends: 160 [2025-02-06 10:34:01,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:34:01,822 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 159 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:01,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 165 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:34:01,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-06 10:34:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 147. [2025-02-06 10:34:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 146 states have internal predecessors, (170), 0 states have call successors, (0), 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-02-06 10:34:01,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 170 transitions. [2025-02-06 10:34:01,825 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 170 transitions. Word has length 15 [2025-02-06 10:34:01,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:01,825 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 170 transitions. [2025-02-06 10:34:01,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-02-06 10:34:01,825 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2025-02-06 10:34:01,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:34:01,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:01,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:01,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:34:01,826 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:01,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:01,826 INFO L85 PathProgramCache]: Analyzing trace with hash -90619353, now seen corresponding path program 1 times [2025-02-06 10:34:01,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:01,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298574078] [2025-02-06 10:34:01,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:01,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:01,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:34:01,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:34:01,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:01,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:01,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:01,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298574078] [2025-02-06 10:34:01,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298574078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:01,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:01,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:34:01,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163692536] [2025-02-06 10:34:01,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:01,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:34:01,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:01,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:34:01,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:34:01,925 INFO L87 Difference]: Start difference. First operand 147 states and 170 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:02,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:02,077 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2025-02-06 10:34:02,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:34:02,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-06 10:34:02,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:02,080 INFO L225 Difference]: With dead ends: 147 [2025-02-06 10:34:02,080 INFO L226 Difference]: Without dead ends: 147 [2025-02-06 10:34:02,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:34:02,081 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 45 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:02,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 274 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:34:02,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-06 10:34:02,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2025-02-06 10:34:02,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 113 states have (on average 1.4955752212389382) internal successors, (169), 145 states have internal predecessors, (169), 0 states have call successors, (0), 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-02-06 10:34:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 169 transitions. [2025-02-06 10:34:02,085 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 169 transitions. Word has length 16 [2025-02-06 10:34:02,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:02,085 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 169 transitions. [2025-02-06 10:34:02,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:02,085 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 169 transitions. [2025-02-06 10:34:02,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:34:02,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:02,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:02,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:34:02,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:02,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:02,089 INFO L85 PathProgramCache]: Analyzing trace with hash -90619352, now seen corresponding path program 1 times [2025-02-06 10:34:02,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:02,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438235071] [2025-02-06 10:34:02,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:02,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:02,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:34:02,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:34:02,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:02,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:02,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:02,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438235071] [2025-02-06 10:34:02,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438235071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:02,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:02,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:34:02,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004239255] [2025-02-06 10:34:02,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:02,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:34:02,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:02,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:34:02,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:34:02,248 INFO L87 Difference]: Start difference. First operand 146 states and 169 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:02,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:02,405 INFO L93 Difference]: Finished difference Result 137 states and 160 transitions. [2025-02-06 10:34:02,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:34:02,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-06 10:34:02,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:02,406 INFO L225 Difference]: With dead ends: 137 [2025-02-06 10:34:02,406 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 10:34:02,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:34:02,406 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 22 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:02,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 325 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:34:02,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 10:34:02,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2025-02-06 10:34:02,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 130 states have internal predecessors, (153), 0 states have call successors, (0), 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-02-06 10:34:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2025-02-06 10:34:02,408 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 16 [2025-02-06 10:34:02,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:02,408 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2025-02-06 10:34:02,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:02,408 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2025-02-06 10:34:02,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:34:02,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:02,409 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-02-06 10:34:02,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:34:02,409 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:02,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash 9674684, now seen corresponding path program 1 times [2025-02-06 10:34:02,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:02,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7802703] [2025-02-06 10:34:02,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:02,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:02,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:34:02,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:34:02,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:02,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:02,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:02,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:02,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7802703] [2025-02-06 10:34:02,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7802703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:02,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:02,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:34:02,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608178899] [2025-02-06 10:34:02,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:02,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:34:02,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:02,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:34:02,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:34:02,441 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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-02-06 10:34:02,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:02,453 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2025-02-06 10:34:02,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:34:02,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-02-06 10:34:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:02,454 INFO L225 Difference]: With dead ends: 137 [2025-02-06 10:34:02,454 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 10:34:02,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:34:02,454 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:02,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 303 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:34:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 10:34:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2025-02-06 10:34:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 134 states have internal predecessors, (157), 0 states have call successors, (0), 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-02-06 10:34:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2025-02-06 10:34:02,457 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 21 [2025-02-06 10:34:02,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:02,457 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2025-02-06 10:34:02,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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-02-06 10:34:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2025-02-06 10:34:02,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:34:02,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:02,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:02,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:34:02,457 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:02,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:02,458 INFO L85 PathProgramCache]: Analyzing trace with hash -119882598, now seen corresponding path program 1 times [2025-02-06 10:34:02,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:02,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733163330] [2025-02-06 10:34:02,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:02,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:02,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:34:02,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:34:02,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:02,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:02,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:02,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733163330] [2025-02-06 10:34:02,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733163330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:02,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:02,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:34:02,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806027808] [2025-02-06 10:34:02,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:02,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:34:02,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:02,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:34:02,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:34:02,576 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:02,793 INFO L93 Difference]: Finished difference Result 218 states and 250 transitions. [2025-02-06 10:34:02,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:34:02,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-06 10:34:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:02,794 INFO L225 Difference]: With dead ends: 218 [2025-02-06 10:34:02,794 INFO L226 Difference]: Without dead ends: 218 [2025-02-06 10:34:02,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:34:02,795 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 117 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:02,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 340 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:34:02,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-06 10:34:02,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 150. [2025-02-06 10:34:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 127 states have (on average 1.3858267716535433) internal successors, (176), 149 states have internal predecessors, (176), 0 states have call successors, (0), 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-02-06 10:34:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 176 transitions. [2025-02-06 10:34:02,800 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 176 transitions. Word has length 23 [2025-02-06 10:34:02,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:02,800 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 176 transitions. [2025-02-06 10:34:02,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 176 transitions. [2025-02-06 10:34:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:34:02,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:02,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:02,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:34:02,802 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:02,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash -119882597, now seen corresponding path program 1 times [2025-02-06 10:34:02,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:02,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683317562] [2025-02-06 10:34:02,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:02,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:02,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:34:02,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:34:02,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:02,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:02,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:02,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:02,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683317562] [2025-02-06 10:34:02,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683317562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:02,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:02,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:34:02,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367235412] [2025-02-06 10:34:02,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:02,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:34:02,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:02,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:34:02,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:34:02,940 INFO L87 Difference]: Start difference. First operand 150 states and 176 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:03,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:03,178 INFO L93 Difference]: Finished difference Result 217 states and 248 transitions. [2025-02-06 10:34:03,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:34:03,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-06 10:34:03,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:03,179 INFO L225 Difference]: With dead ends: 217 [2025-02-06 10:34:03,179 INFO L226 Difference]: Without dead ends: 217 [2025-02-06 10:34:03,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:34:03,180 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 97 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:03,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 467 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:34:03,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-02-06 10:34:03,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 146. [2025-02-06 10:34:03,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 145 states have internal predecessors, (170), 0 states have call successors, (0), 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-02-06 10:34:03,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2025-02-06 10:34:03,184 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 23 [2025-02-06 10:34:03,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:03,185 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2025-02-06 10:34:03,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:03,185 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2025-02-06 10:34:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:34:03,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:03,186 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-02-06 10:34:03,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:34:03,186 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:03,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:03,187 INFO L85 PathProgramCache]: Analyzing trace with hash 479605482, now seen corresponding path program 1 times [2025-02-06 10:34:03,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:03,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711664376] [2025-02-06 10:34:03,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:03,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:03,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:34:03,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:34:03,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:03,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:03,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:03,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711664376] [2025-02-06 10:34:03,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711664376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:03,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:03,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:34:03,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605162295] [2025-02-06 10:34:03,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:03,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:34:03,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:03,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:34:03,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:34:03,210 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:03,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:03,219 INFO L93 Difference]: Finished difference Result 148 states and 172 transitions. [2025-02-06 10:34:03,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:34:03,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 10:34:03,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:03,220 INFO L225 Difference]: With dead ends: 148 [2025-02-06 10:34:03,221 INFO L226 Difference]: Without dead ends: 148 [2025-02-06 10:34:03,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:34:03,221 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:03,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:34:03,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-06 10:34:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-02-06 10:34:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 125 states have (on average 1.376) internal successors, (172), 147 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 172 transitions. [2025-02-06 10:34:03,223 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 172 transitions. Word has length 24 [2025-02-06 10:34:03,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:03,223 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 172 transitions. [2025-02-06 10:34:03,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 172 transitions. [2025-02-06 10:34:03,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:34:03,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:03,226 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-02-06 10:34:03,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:34:03,227 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:03,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:03,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1889873742, now seen corresponding path program 1 times [2025-02-06 10:34:03,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:03,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247230793] [2025-02-06 10:34:03,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:03,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:03,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:34:03,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:34:03,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:03,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:03,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:03,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247230793] [2025-02-06 10:34:03,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247230793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:03,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:03,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:34:03,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27969165] [2025-02-06 10:34:03,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:03,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:34:03,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:03,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:34:03,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:34:03,304 INFO L87 Difference]: Start difference. First operand 148 states and 172 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:03,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:03,455 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2025-02-06 10:34:03,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:34:03,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 10:34:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:03,457 INFO L225 Difference]: With dead ends: 153 [2025-02-06 10:34:03,457 INFO L226 Difference]: Without dead ends: 153 [2025-02-06 10:34:03,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:34:03,457 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 5 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:03,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 284 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:34:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-06 10:34:03,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 147. [2025-02-06 10:34:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 125 states have (on average 1.368) internal successors, (171), 146 states have internal predecessors, (171), 0 states have call successors, (0), 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-02-06 10:34:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 171 transitions. [2025-02-06 10:34:03,459 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 171 transitions. Word has length 24 [2025-02-06 10:34:03,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:03,461 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 171 transitions. [2025-02-06 10:34:03,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:03,461 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 171 transitions. [2025-02-06 10:34:03,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:34:03,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:03,462 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-02-06 10:34:03,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:34:03,462 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:03,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:03,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1889873741, now seen corresponding path program 1 times [2025-02-06 10:34:03,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:03,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167389866] [2025-02-06 10:34:03,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:03,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:03,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:34:03,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:34:03,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:03,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:03,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:03,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167389866] [2025-02-06 10:34:03,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167389866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:03,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:03,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:34:03,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725387449] [2025-02-06 10:34:03,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:03,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:34:03,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:03,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:34:03,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:34:03,608 INFO L87 Difference]: Start difference. First operand 147 states and 171 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:03,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:03,721 INFO L93 Difference]: Finished difference Result 146 states and 170 transitions. [2025-02-06 10:34:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:34:03,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 10:34:03,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:03,722 INFO L225 Difference]: With dead ends: 146 [2025-02-06 10:34:03,722 INFO L226 Difference]: Without dead ends: 146 [2025-02-06 10:34:03,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:34:03,724 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:03,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 276 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:34:03,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-06 10:34:03,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-02-06 10:34:03,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 125 states have (on average 1.36) internal successors, (170), 145 states have internal predecessors, (170), 0 states have call successors, (0), 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-02-06 10:34:03,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2025-02-06 10:34:03,726 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 24 [2025-02-06 10:34:03,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:03,726 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2025-02-06 10:34:03,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:03,726 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2025-02-06 10:34:03,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:34:03,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:03,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:03,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:34:03,726 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:03,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:03,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1370860778, now seen corresponding path program 1 times [2025-02-06 10:34:03,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:03,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122822815] [2025-02-06 10:34:03,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:03,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:03,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:34:03,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:34:03,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:03,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:03,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:03,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:03,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122822815] [2025-02-06 10:34:03,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122822815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:03,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:03,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:34:03,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326931813] [2025-02-06 10:34:03,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:03,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:34:03,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:03,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:34:03,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:34:03,865 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:04,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:04,063 INFO L93 Difference]: Finished difference Result 209 states and 239 transitions. [2025-02-06 10:34:04,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:34:04,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-06 10:34:04,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:04,065 INFO L225 Difference]: With dead ends: 209 [2025-02-06 10:34:04,065 INFO L226 Difference]: Without dead ends: 209 [2025-02-06 10:34:04,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:34:04,066 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 155 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:04,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 384 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:34:04,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-06 10:34:04,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 152. [2025-02-06 10:34:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 131 states have (on average 1.3511450381679388) internal successors, (177), 151 states have internal predecessors, (177), 0 states have call successors, (0), 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-02-06 10:34:04,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2025-02-06 10:34:04,071 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 177 transitions. Word has length 26 [2025-02-06 10:34:04,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:04,071 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 177 transitions. [2025-02-06 10:34:04,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2025-02-06 10:34:04,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:34:04,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:04,071 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] [2025-02-06 10:34:04,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:34:04,071 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:04,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:04,072 INFO L85 PathProgramCache]: Analyzing trace with hash -219949479, now seen corresponding path program 1 times [2025-02-06 10:34:04,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:04,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230524562] [2025-02-06 10:34:04,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:04,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:04,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:34:04,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:34:04,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:04,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:04,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:04,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230524562] [2025-02-06 10:34:04,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230524562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:04,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:04,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:34:04,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421448230] [2025-02-06 10:34:04,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:04,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:34:04,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:04,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:34:04,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:34:04,206 INFO L87 Difference]: Start difference. First operand 152 states and 177 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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-02-06 10:34:04,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:04,562 INFO L93 Difference]: Finished difference Result 274 states and 312 transitions. [2025-02-06 10:34:04,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:34:04,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-02-06 10:34:04,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:04,564 INFO L225 Difference]: With dead ends: 274 [2025-02-06 10:34:04,564 INFO L226 Difference]: Without dead ends: 274 [2025-02-06 10:34:04,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:34:04,565 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 285 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:04,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 464 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:34:04,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-02-06 10:34:04,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 166. [2025-02-06 10:34:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 145 states have (on average 1.3448275862068966) internal successors, (195), 165 states have internal predecessors, (195), 0 states have call successors, (0), 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-02-06 10:34:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 195 transitions. [2025-02-06 10:34:04,569 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 195 transitions. Word has length 27 [2025-02-06 10:34:04,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:04,570 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 195 transitions. [2025-02-06 10:34:04,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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-02-06 10:34:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 195 transitions. [2025-02-06 10:34:04,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:34:04,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:04,570 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] [2025-02-06 10:34:04,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:34:04,571 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:04,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:04,571 INFO L85 PathProgramCache]: Analyzing trace with hash -219949478, now seen corresponding path program 1 times [2025-02-06 10:34:04,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:04,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348110543] [2025-02-06 10:34:04,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:04,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:04,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:34:04,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:34:04,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:04,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:04,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:04,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348110543] [2025-02-06 10:34:04,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348110543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:04,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:04,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:34:04,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879119106] [2025-02-06 10:34:04,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:04,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:34:04,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:04,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:34:04,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:34:04,830 INFO L87 Difference]: Start difference. First operand 166 states and 195 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 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-02-06 10:34:05,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:05,183 INFO L93 Difference]: Finished difference Result 233 states and 267 transitions. [2025-02-06 10:34:05,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:34:05,183 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-02-06 10:34:05,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:05,184 INFO L225 Difference]: With dead ends: 233 [2025-02-06 10:34:05,184 INFO L226 Difference]: Without dead ends: 233 [2025-02-06 10:34:05,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:34:05,184 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 187 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:05,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 454 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:34:05,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-06 10:34:05,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 166. [2025-02-06 10:34:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 165 states have internal predecessors, (194), 0 states have call successors, (0), 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-02-06 10:34:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 194 transitions. [2025-02-06 10:34:05,193 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 194 transitions. Word has length 27 [2025-02-06 10:34:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:05,193 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 194 transitions. [2025-02-06 10:34:05,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 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-02-06 10:34:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 194 transitions. [2025-02-06 10:34:05,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:34:05,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:05,194 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:05,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:34:05,194 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:05,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:05,194 INFO L85 PathProgramCache]: Analyzing trace with hash -619134031, now seen corresponding path program 1 times [2025-02-06 10:34:05,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:05,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973810644] [2025-02-06 10:34:05,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:05,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:05,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:34:05,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:34:05,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:05,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:05,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:05,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973810644] [2025-02-06 10:34:05,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973810644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:05,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:05,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:34:05,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980183451] [2025-02-06 10:34:05,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:05,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:34:05,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:05,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:34:05,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:34:05,220 INFO L87 Difference]: Start difference. First operand 166 states and 194 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-02-06 10:34:05,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:05,233 INFO L93 Difference]: Finished difference Result 170 states and 197 transitions. [2025-02-06 10:34:05,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:34:05,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-02-06 10:34:05,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:05,234 INFO L225 Difference]: With dead ends: 170 [2025-02-06 10:34:05,234 INFO L226 Difference]: Without dead ends: 170 [2025-02-06 10:34:05,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:34:05,234 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 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-02-06 10:34:05,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:34:05,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-06 10:34:05,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-02-06 10:34:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 149 states have (on average 1.3221476510067114) internal successors, (197), 169 states have internal predecessors, (197), 0 states have call successors, (0), 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-02-06 10:34:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 197 transitions. [2025-02-06 10:34:05,237 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 197 transitions. Word has length 28 [2025-02-06 10:34:05,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:05,237 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 197 transitions. [2025-02-06 10:34:05,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-02-06 10:34:05,237 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 197 transitions. [2025-02-06 10:34:05,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:34:05,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:05,238 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:05,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:34:05,238 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:05,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:05,238 INFO L85 PathProgramCache]: Analyzing trace with hash 535510449, now seen corresponding path program 1 times [2025-02-06 10:34:05,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:05,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046626591] [2025-02-06 10:34:05,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:05,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:05,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:34:05,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:34:05,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:05,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:05,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:05,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:05,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046626591] [2025-02-06 10:34:05,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046626591] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:34:05,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233847462] [2025-02-06 10:34:05,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:05,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:34:05,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:34:05,394 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-02-06 10:34:05,396 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-02-06 10:34:05,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:34:05,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:34:05,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:05,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:05,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 10:34:05,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:34:05,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:34:05,508 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-02-06 10:34:05,544 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-02-06 10:34:05,553 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-02-06 10:34:05,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-06 10:34:05,573 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-02-06 10:34:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:05,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:34:06,130 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 10 treesize of output 8 [2025-02-06 10:34:06,134 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-02-06 10:34:06,144 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 10 treesize of output 8 [2025-02-06 10:34:06,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:06,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233847462] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:34:06,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:34:06,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 13 [2025-02-06 10:34:06,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559068497] [2025-02-06 10:34:06,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:34:06,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 10:34:06,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:06,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 10:34:06,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:34:06,160 INFO L87 Difference]: Start difference. First operand 170 states and 197 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 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-02-06 10:34:06,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:06,524 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2025-02-06 10:34:06,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 10:34:06,524 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-06 10:34:06,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:06,525 INFO L225 Difference]: With dead ends: 223 [2025-02-06 10:34:06,525 INFO L226 Difference]: Without dead ends: 223 [2025-02-06 10:34:06,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:34:06,525 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 418 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:06,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 452 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:34:06,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-06 10:34:06,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 185. [2025-02-06 10:34:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 184 states have internal predecessors, (214), 0 states have call successors, (0), 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-02-06 10:34:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 214 transitions. [2025-02-06 10:34:06,528 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 214 transitions. Word has length 30 [2025-02-06 10:34:06,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:06,528 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 214 transitions. [2025-02-06 10:34:06,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 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-02-06 10:34:06,528 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 214 transitions. [2025-02-06 10:34:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:34:06,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:06,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:06,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 10:34:06,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:34:06,729 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:06,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:06,729 INFO L85 PathProgramCache]: Analyzing trace with hash 985712331, now seen corresponding path program 1 times [2025-02-06 10:34:06,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:06,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288594647] [2025-02-06 10:34:06,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:06,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:06,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:34:06,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:34:06,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:06,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:06,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:06,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288594647] [2025-02-06 10:34:06,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288594647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:06,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:06,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 10:34:06,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383933097] [2025-02-06 10:34:06,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:06,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:34:06,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:06,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:34:06,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:34:06,900 INFO L87 Difference]: Start difference. First operand 185 states and 214 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:07,196 INFO L93 Difference]: Finished difference Result 209 states and 236 transitions. [2025-02-06 10:34:07,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:34:07,196 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-06 10:34:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:07,197 INFO L225 Difference]: With dead ends: 209 [2025-02-06 10:34:07,197 INFO L226 Difference]: Without dead ends: 209 [2025-02-06 10:34:07,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:34:07,197 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 229 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:07,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 453 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:34:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-06 10:34:07,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 183. [2025-02-06 10:34:07,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 162 states have (on average 1.3024691358024691) internal successors, (211), 182 states have internal predecessors, (211), 0 states have call successors, (0), 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-02-06 10:34:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 211 transitions. [2025-02-06 10:34:07,200 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 211 transitions. Word has length 30 [2025-02-06 10:34:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:07,200 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 211 transitions. [2025-02-06 10:34:07,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 211 transitions. [2025-02-06 10:34:07,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 10:34:07,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:07,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:07,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 10:34:07,200 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:07,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:07,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2097147795, now seen corresponding path program 1 times [2025-02-06 10:34:07,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:07,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137768564] [2025-02-06 10:34:07,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:07,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:07,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:34:07,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:34:07,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:07,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:07,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:07,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137768564] [2025-02-06 10:34:07,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137768564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:07,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:07,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:34:07,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672025782] [2025-02-06 10:34:07,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:07,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:34:07,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:07,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:34:07,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:34:07,293 INFO L87 Difference]: Start difference. First operand 183 states and 211 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 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-02-06 10:34:07,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:07,455 INFO L93 Difference]: Finished difference Result 216 states and 247 transitions. [2025-02-06 10:34:07,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:34:07,456 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2025-02-06 10:34:07,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:07,456 INFO L225 Difference]: With dead ends: 216 [2025-02-06 10:34:07,456 INFO L226 Difference]: Without dead ends: 216 [2025-02-06 10:34:07,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:34:07,458 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 15 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:07,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 453 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:34:07,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-06 10:34:07,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 189. [2025-02-06 10:34:07,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 168 states have (on average 1.2976190476190477) internal successors, (218), 188 states have internal predecessors, (218), 0 states have call successors, (0), 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-02-06 10:34:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 218 transitions. [2025-02-06 10:34:07,460 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 218 transitions. Word has length 32 [2025-02-06 10:34:07,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:07,460 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 218 transitions. [2025-02-06 10:34:07,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 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-02-06 10:34:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 218 transitions. [2025-02-06 10:34:07,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:34:07,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:07,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:07,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 10:34:07,461 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:07,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:07,461 INFO L85 PathProgramCache]: Analyzing trace with hash -134214320, now seen corresponding path program 1 times [2025-02-06 10:34:07,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:07,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263071501] [2025-02-06 10:34:07,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:07,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:07,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:34:07,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:34:07,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:07,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:07,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:07,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263071501] [2025-02-06 10:34:07,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263071501] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:34:07,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304766623] [2025-02-06 10:34:07,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:07,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:34:07,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:34:07,647 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-02-06 10:34:07,650 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-02-06 10:34:07,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:34:07,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:34:07,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:07,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:07,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 10:34:07,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:34:07,728 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-02-06 10:34:07,739 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-02-06 10:34:07,743 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-02-06 10:34:07,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:34:07,874 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-02-06 10:34:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:07,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:34:08,375 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-02-06 10:34:08,378 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 17 treesize of output 13 [2025-02-06 10:34:08,406 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 20 treesize of output 18 [2025-02-06 10:34:08,414 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 100 treesize of output 92 [2025-02-06 10:34:08,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:08,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304766623] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 10:34:08,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:34:08,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11, 11] total 29 [2025-02-06 10:34:08,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325488260] [2025-02-06 10:34:08,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:08,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 10:34:08,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:08,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 10:34:08,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2025-02-06 10:34:08,439 INFO L87 Difference]: Start difference. First operand 189 states and 218 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 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-02-06 10:34:08,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:08,753 INFO L93 Difference]: Finished difference Result 211 states and 241 transitions. [2025-02-06 10:34:08,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:34:08,753 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-02-06 10:34:08,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:08,754 INFO L225 Difference]: With dead ends: 211 [2025-02-06 10:34:08,754 INFO L226 Difference]: Without dead ends: 211 [2025-02-06 10:34:08,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=877, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 10:34:08,755 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 232 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:08,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 497 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:34:08,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-06 10:34:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 203. [2025-02-06 10:34:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 182 states have (on average 1.2747252747252746) internal successors, (232), 202 states have internal predecessors, (232), 0 states have call successors, (0), 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-02-06 10:34:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 232 transitions. [2025-02-06 10:34:08,758 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 232 transitions. Word has length 35 [2025-02-06 10:34:08,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:08,758 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 232 transitions. [2025-02-06 10:34:08,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 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-02-06 10:34:08,758 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 232 transitions. [2025-02-06 10:34:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:34:08,758 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:08,758 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:08,764 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-02-06 10:34:08,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:34:08,959 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:08,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:08,959 INFO L85 PathProgramCache]: Analyzing trace with hash -134213615, now seen corresponding path program 1 times [2025-02-06 10:34:08,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:08,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775391210] [2025-02-06 10:34:08,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:08,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:08,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:34:08,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:34:08,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:08,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:34:08,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:08,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775391210] [2025-02-06 10:34:08,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775391210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:08,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:08,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:34:08,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491000964] [2025-02-06 10:34:08,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:08,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:34:08,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:08,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:34:08,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:34:09,000 INFO L87 Difference]: Start difference. First operand 203 states and 232 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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-02-06 10:34:09,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:09,076 INFO L93 Difference]: Finished difference Result 216 states and 239 transitions. [2025-02-06 10:34:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:34:09,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-02-06 10:34:09,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:09,077 INFO L225 Difference]: With dead ends: 216 [2025-02-06 10:34:09,077 INFO L226 Difference]: Without dead ends: 216 [2025-02-06 10:34:09,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:34:09,077 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 110 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:09,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 137 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:34:09,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-06 10:34:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 205. [2025-02-06 10:34:09,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 184 states have (on average 1.2717391304347827) internal successors, (234), 204 states have internal predecessors, (234), 0 states have call successors, (0), 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-02-06 10:34:09,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 234 transitions. [2025-02-06 10:34:09,081 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 234 transitions. Word has length 35 [2025-02-06 10:34:09,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:09,081 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 234 transitions. [2025-02-06 10:34:09,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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-02-06 10:34:09,081 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 234 transitions. [2025-02-06 10:34:09,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:34:09,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:09,082 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:09,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 10:34:09,082 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:09,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:09,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1193449781, now seen corresponding path program 1 times [2025-02-06 10:34:09,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:09,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838936418] [2025-02-06 10:34:09,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:09,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:09,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:34:09,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:34:09,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:09,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:09,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:09,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:09,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838936418] [2025-02-06 10:34:09,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838936418] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:34:09,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085349321] [2025-02-06 10:34:09,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:09,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:34:09,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:34:09,440 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-02-06 10:34:09,443 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-02-06 10:34:09,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:34:09,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:34:09,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:09,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:09,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 10:34:09,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:34:09,526 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-02-06 10:34:09,543 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-02-06 10:34:09,565 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-02-06 10:34:09,610 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:34:09,610 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-02-06 10:34:09,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:09,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:34:09,646 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-02-06 10:34:09,681 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 16 treesize of output 8 [2025-02-06 10:34:09,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:34:09,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:34:09,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:34:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:09,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:34:09,885 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_709 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_709) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2025-02-06 10:34:09,901 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_709 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_709) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2025-02-06 10:34:09,937 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (or (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_704 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_704)) (not (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_709) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 2)))) is different from false [2025-02-06 10:34:09,998 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_704 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_10| Int) (v_ArrVal_709 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_63| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_10|) 0)) (not (= v_ArrVal_704 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_63| (select v_ArrVal_704 |v_ULTIMATE.start_main_~x~0#1.offset_63|)))) (not (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_704) |v_ULTIMATE.start_main_#t~malloc7#1.base_10| v_ArrVal_709) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_63|))) is different from false [2025-02-06 10:34:10,013 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_704 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_10| Int) (v_ArrVal_709 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_63| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_10|) 0)) (not (= v_ArrVal_704 (store (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0 (select v_ArrVal_704 .cse0))) |v_ULTIMATE.start_main_~x~0#1.offset_63| (select v_ArrVal_704 |v_ULTIMATE.start_main_~x~0#1.offset_63|)))) (not (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_704) |v_ULTIMATE.start_main_#t~malloc7#1.base_10| v_ArrVal_709) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_63|))) is different from false [2025-02-06 10:34:10,018 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 52 treesize of output 50 [2025-02-06 10:34:10,023 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:34:10,024 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:34:10,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-06 10:34:10,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:10,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085349321] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:34:10,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:34:10,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 36 [2025-02-06 10:34:10,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885712925] [2025-02-06 10:34:10,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:34:10,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 10:34:10,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:10,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 10:34:10,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=825, Unknown=9, NotChecked=310, Total=1260 [2025-02-06 10:34:10,049 INFO L87 Difference]: Start difference. First operand 205 states and 234 transitions. Second operand has 36 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 36 states have internal predecessors, (93), 0 states have call successors, (0), 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-02-06 10:34:12,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:12,121 INFO L93 Difference]: Finished difference Result 425 states and 472 transitions. [2025-02-06 10:34:12,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-06 10:34:12,122 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 36 states have internal predecessors, (93), 0 states have call successors, (0), 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 35 [2025-02-06 10:34:12,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:12,123 INFO L225 Difference]: With dead ends: 425 [2025-02-06 10:34:12,123 INFO L226 Difference]: Without dead ends: 425 [2025-02-06 10:34:12,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=741, Invalid=3428, Unknown=11, NotChecked=650, Total=4830 [2025-02-06 10:34:12,125 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 1078 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 198 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 3185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 1556 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:12,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 1257 Invalid, 3185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1429 Invalid, 2 Unknown, 1556 Unchecked, 0.8s Time] [2025-02-06 10:34:12,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-02-06 10:34:12,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 223. [2025-02-06 10:34:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 202 states have (on average 1.2574257425742574) internal successors, (254), 222 states have internal predecessors, (254), 0 states have call successors, (0), 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-02-06 10:34:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 254 transitions. [2025-02-06 10:34:12,136 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 254 transitions. Word has length 35 [2025-02-06 10:34:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:12,136 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 254 transitions. [2025-02-06 10:34:12,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 36 states have internal predecessors, (93), 0 states have call successors, (0), 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-02-06 10:34:12,137 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 254 transitions. [2025-02-06 10:34:12,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:34:12,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:12,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:12,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 10:34:12,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:34:12,338 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:12,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:12,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1252584495, now seen corresponding path program 1 times [2025-02-06 10:34:12,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:12,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916309551] [2025-02-06 10:34:12,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:12,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:12,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:34:12,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:34:12,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:12,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:12,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:12,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916309551] [2025-02-06 10:34:12,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916309551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:12,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:12,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 10:34:12,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523127072] [2025-02-06 10:34:12,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:12,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:34:12,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:12,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:34:12,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:34:12,637 INFO L87 Difference]: Start difference. First operand 223 states and 254 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 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-02-06 10:34:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:13,118 INFO L93 Difference]: Finished difference Result 239 states and 268 transitions. [2025-02-06 10:34:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 10:34:13,118 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-02-06 10:34:13,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:13,119 INFO L225 Difference]: With dead ends: 239 [2025-02-06 10:34:13,119 INFO L226 Difference]: Without dead ends: 239 [2025-02-06 10:34:13,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:34:13,120 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 176 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:13,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 643 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:34:13,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-02-06 10:34:13,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 220. [2025-02-06 10:34:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 199 states have (on average 1.2512562814070352) internal successors, (249), 219 states have internal predecessors, (249), 0 states have call successors, (0), 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-02-06 10:34:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 249 transitions. [2025-02-06 10:34:13,123 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 249 transitions. Word has length 35 [2025-02-06 10:34:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:13,123 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 249 transitions. [2025-02-06 10:34:13,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 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-02-06 10:34:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 249 transitions. [2025-02-06 10:34:13,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 10:34:13,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:13,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:13,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 10:34:13,123 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:13,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:13,124 INFO L85 PathProgramCache]: Analyzing trace with hash 256722258, now seen corresponding path program 1 times [2025-02-06 10:34:13,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:13,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356294496] [2025-02-06 10:34:13,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:13,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:13,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:34:13,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:34:13,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:13,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:34:13,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:13,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356294496] [2025-02-06 10:34:13,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356294496] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:34:13,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207137433] [2025-02-06 10:34:13,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:13,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:34:13,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:34:13,179 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-02-06 10:34:13,184 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-02-06 10:34:13,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:34:13,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:34:13,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:13,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:13,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 10:34:13,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:34:13,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:34:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:34:13,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:34:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:34:13,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207137433] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:34:13,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:34:13,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-02-06 10:34:13,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209851165] [2025-02-06 10:34:13,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:34:13,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:34:13,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:13,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:34:13,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:34:13,353 INFO L87 Difference]: Start difference. First operand 220 states and 249 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:13,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:13,510 INFO L93 Difference]: Finished difference Result 246 states and 276 transitions. [2025-02-06 10:34:13,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:34:13,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-06 10:34:13,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:13,511 INFO L225 Difference]: With dead ends: 246 [2025-02-06 10:34:13,511 INFO L226 Difference]: Without dead ends: 245 [2025-02-06 10:34:13,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:34:13,511 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 42 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:13,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 316 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:34:13,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-02-06 10:34:13,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 224. [2025-02-06 10:34:13,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 203 states have (on average 1.2463054187192117) internal successors, (253), 223 states have internal predecessors, (253), 0 states have call successors, (0), 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-02-06 10:34:13,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 253 transitions. [2025-02-06 10:34:13,514 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 253 transitions. Word has length 38 [2025-02-06 10:34:13,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:13,514 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 253 transitions. [2025-02-06 10:34:13,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:13,514 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 253 transitions. [2025-02-06 10:34:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 10:34:13,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:13,514 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:13,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 10:34:13,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-06 10:34:13,715 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:13,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:13,715 INFO L85 PathProgramCache]: Analyzing trace with hash 256723058, now seen corresponding path program 1 times [2025-02-06 10:34:13,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:13,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462832735] [2025-02-06 10:34:13,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:13,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:13,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:34:13,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:34:13,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:13,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:13,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:13,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462832735] [2025-02-06 10:34:13,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462832735] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:34:13,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685323952] [2025-02-06 10:34:13,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:13,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:34:13,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:34:13,812 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-02-06 10:34:13,818 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-02-06 10:34:13,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:34:13,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:34:13,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:13,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:13,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 10:34:13,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:34:13,905 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-02-06 10:34:13,923 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-02-06 10:34:13,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-06 10:34:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:14,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:34:14,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:34:14,282 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 38 treesize of output 41 [2025-02-06 10:34:14,625 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 10 treesize of output 8 [2025-02-06 10:34:14,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:14,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685323952] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:34:14,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:34:14,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 10] total 21 [2025-02-06 10:34:14,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698438605] [2025-02-06 10:34:14,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:34:14,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 10:34:14,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:14,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 10:34:14,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-02-06 10:34:14,640 INFO L87 Difference]: Start difference. First operand 224 states and 253 transitions. Second operand has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 21 states have internal predecessors, (96), 0 states have call successors, (0), 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-02-06 10:34:15,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:15,396 INFO L93 Difference]: Finished difference Result 289 states and 326 transitions. [2025-02-06 10:34:15,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 10:34:15,396 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 21 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-06 10:34:15,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:15,397 INFO L225 Difference]: With dead ends: 289 [2025-02-06 10:34:15,397 INFO L226 Difference]: Without dead ends: 263 [2025-02-06 10:34:15,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=217, Invalid=1189, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 10:34:15,397 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 323 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:15,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1024 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:34:15,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-06 10:34:15,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 216. [2025-02-06 10:34:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 195 states have (on average 1.2820512820512822) internal successors, (250), 215 states have internal predecessors, (250), 0 states have call successors, (0), 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-02-06 10:34:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 250 transitions. [2025-02-06 10:34:15,400 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 250 transitions. Word has length 38 [2025-02-06 10:34:15,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:15,400 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 250 transitions. [2025-02-06 10:34:15,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 21 states have internal predecessors, (96), 0 states have call successors, (0), 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-02-06 10:34:15,400 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 250 transitions. [2025-02-06 10:34:15,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 10:34:15,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:15,401 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:15,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 10:34:15,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-06 10:34:15,608 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:15,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:15,608 INFO L85 PathProgramCache]: Analyzing trace with hash -942601959, now seen corresponding path program 1 times [2025-02-06 10:34:15,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:15,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196924727] [2025-02-06 10:34:15,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:15,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:15,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:34:15,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:34:15,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:15,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:16,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:16,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196924727] [2025-02-06 10:34:16,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196924727] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:34:16,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822752836] [2025-02-06 10:34:16,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:16,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:34:16,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:34:16,020 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-02-06 10:34:16,021 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-02-06 10:34:16,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:34:16,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:34:16,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:16,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:16,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 10:34:16,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:34:16,112 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-02-06 10:34:16,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:34:16,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:16,174 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-02-06 10:34:16,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:16,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-06 10:34:16,283 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:34:16,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-06 10:34:16,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:34:16,300 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:34:16,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2025-02-06 10:34:16,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:16,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:34:16,407 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:34:16,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 28 [2025-02-06 10:34:16,430 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:34:16,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2025-02-06 10:34:16,476 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2025-02-06 10:34:16,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2025-02-06 10:34:16,489 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-02-06 10:34:16,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2025-02-06 10:34:16,578 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 7 [2025-02-06 10:34:16,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:34:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:16,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:34:16,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:34:16,695 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 10:34:16,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:34:16,701 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 10:34:16,768 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~x~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|) (not (= |c_ULTIMATE.start_main_~x~0#1.offset| (select v_arrayElimArr_1 .cse1))))) (forall ((v_arrayElimArr_2 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| (select v_arrayElimArr_2 .cse1) v_arrayElimArr_2) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2025-02-06 10:34:16,776 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~x~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_#t~mem8#1.offset| (select v_arrayElimArr_1 .cse0))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimArr_2 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| (select v_arrayElimArr_2 .cse0) v_arrayElimArr_2) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2025-02-06 10:34:16,786 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse1 (+ .cse2 4)) (.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_1 Int)) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| v_subst_1 v_arrayElimArr_1) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) (not (= (select v_arrayElimArr_1 .cse1) .cse2)))) (forall ((v_arrayElimArr_2 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| (select v_arrayElimArr_2 .cse1) v_arrayElimArr_2) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) is different from false [2025-02-06 10:34:16,804 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~malloc7#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_1 Int)) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) v_subst_1 v_arrayElimArr_1) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) (not (= (select v_arrayElimArr_1 .cse1) |c_ULTIMATE.start_main_#t~malloc7#1.offset|)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_923 Int)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_923)) (select v_arrayElimArr_2 .cse1) v_arrayElimArr_2) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2025-02-06 10:34:16,812 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_1 Int)) (or (not (= (select v_arrayElimArr_1 4) 0)) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0)) v_subst_1 v_arrayElimArr_1) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_923 Int)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_923)) (select v_arrayElimArr_2 4) v_arrayElimArr_2) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2025-02-06 10:34:16,831 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_83| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_83|) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_1 Int)) (or (not (= (select v_arrayElimArr_1 4) 0)) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_83| 0)) v_subst_1 v_arrayElimArr_1) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_83| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_83|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_923 Int)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_83| v_ArrVal_923)) (select v_arrayElimArr_2 4) v_arrayElimArr_2) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))))) is different from false [2025-02-06 10:34:16,837 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:34:16,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:34:16,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2025-02-06 10:34:16,842 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 40 treesize of output 28 [2025-02-06 10:34:16,846 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 10:34:16,846 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 9 treesize of output 7 [2025-02-06 10:34:16,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-06 10:34:16,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822752836] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:34:16,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:34:16,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 31 [2025-02-06 10:34:16,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853261682] [2025-02-06 10:34:16,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:34:16,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 10:34:16,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:16,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 10:34:16,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=491, Unknown=9, NotChecked=306, Total=930 [2025-02-06 10:34:16,853 INFO L87 Difference]: Start difference. First operand 216 states and 250 transitions. Second operand has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 31 states have internal predecessors, (85), 0 states have call successors, (0), 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-02-06 10:34:17,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:17,796 INFO L93 Difference]: Finished difference Result 429 states and 487 transitions. [2025-02-06 10:34:17,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 10:34:17,797 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 31 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-06 10:34:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:17,798 INFO L225 Difference]: With dead ends: 429 [2025-02-06 10:34:17,798 INFO L226 Difference]: Without dead ends: 429 [2025-02-06 10:34:17,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=338, Invalid=1317, Unknown=9, NotChecked=498, Total=2162 [2025-02-06 10:34:17,798 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 685 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 104 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 1866 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:17,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 999 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 889 Invalid, 19 Unknown, 1866 Unchecked, 0.5s Time] [2025-02-06 10:34:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-02-06 10:34:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 238. [2025-02-06 10:34:17,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 217 states have (on average 1.2672811059907834) internal successors, (275), 237 states have internal predecessors, (275), 0 states have call successors, (0), 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-02-06 10:34:17,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 275 transitions. [2025-02-06 10:34:17,813 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 275 transitions. Word has length 38 [2025-02-06 10:34:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:17,814 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 275 transitions. [2025-02-06 10:34:17,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 31 states have internal predecessors, (85), 0 states have call successors, (0), 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-02-06 10:34:17,814 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 275 transitions. [2025-02-06 10:34:17,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:34:17,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:17,814 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:17,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 10:34:18,014 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,SelfDestructingSolverStorable28 [2025-02-06 10:34:18,015 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:18,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:18,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1094436180, now seen corresponding path program 1 times [2025-02-06 10:34:18,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:18,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762766960] [2025-02-06 10:34:18,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:18,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:18,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:34:18,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:34:18,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:18,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:18,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:18,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:18,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762766960] [2025-02-06 10:34:18,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762766960] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:34:18,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893643004] [2025-02-06 10:34:18,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:18,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:34:18,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:34:18,387 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-02-06 10:34:18,389 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-02-06 10:34:18,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:34:18,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:34:18,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:18,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:18,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-06 10:34:18,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:34:18,487 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-02-06 10:34:18,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:34:18,545 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:34:18,545 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-02-06 10:34:18,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:18,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:34:18,710 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-06 10:34:18,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2025-02-06 10:34:18,744 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-06 10:34:18,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2025-02-06 10:34:18,759 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:34:18,760 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-02-06 10:34:18,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:18,813 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2025-02-06 10:34:18,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 25 [2025-02-06 10:34:18,915 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2025-02-06 10:34:18,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 57 [2025-02-06 10:34:18,920 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 12 [2025-02-06 10:34:19,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:19,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:34:19,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:19,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:34:19,120 INFO L349 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2025-02-06 10:34:19,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-02-06 10:34:19,159 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) v_ArrVal_1049) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) is different from false [2025-02-06 10:34:19,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:34:19,244 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-02-06 10:34:19,374 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2025-02-06 10:34:19,375 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 16 [2025-02-06 10:34:19,383 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_88| Int)) (let ((.cse0 (select v_arrayElimArr_4 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_88|)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_arrayElimArr_4) .cse0 v_ArrVal_1049) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|)))) is different from false [2025-02-06 10:34:30,012 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:34:30,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:34:30,016 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2025-02-06 10:34:30,019 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:34:30,020 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:34:30,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2025-02-06 10:34:30,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:34:30,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-06 10:34:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:34,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893643004] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:34:34,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:34:34,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 40 [2025-02-06 10:34:34,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041373865] [2025-02-06 10:34:34,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:34:34,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-06 10:34:34,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:34,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-06 10:34:34,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1265, Unknown=44, NotChecked=150, Total=1640 [2025-02-06 10:34:34,779 INFO L87 Difference]: Start difference. First operand 238 states and 275 transitions. Second operand has 41 states, 40 states have (on average 2.55) internal successors, (102), 41 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:38,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:34:42,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:34:46,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:34:52,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:52,001 INFO L93 Difference]: Finished difference Result 364 states and 416 transitions. [2025-02-06 10:34:52,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:34:52,001 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.55) internal successors, (102), 41 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-02-06 10:34:52,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:52,002 INFO L225 Difference]: With dead ends: 364 [2025-02-06 10:34:52,002 INFO L226 Difference]: Without dead ends: 364 [2025-02-06 10:34:52,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=396, Invalid=2117, Unknown=45, NotChecked=198, Total=2756 [2025-02-06 10:34:52,004 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 518 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 95 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 1903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 461 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:52,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1156 Invalid, 1903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1344 Invalid, 3 Unknown, 461 Unchecked, 12.8s Time] [2025-02-06 10:34:52,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-02-06 10:34:52,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 259. [2025-02-06 10:34:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 238 states have (on average 1.2605042016806722) internal successors, (300), 258 states have internal predecessors, (300), 0 states have call successors, (0), 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-02-06 10:34:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 300 transitions. [2025-02-06 10:34:52,007 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 300 transitions. Word has length 39 [2025-02-06 10:34:52,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:52,007 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 300 transitions. [2025-02-06 10:34:52,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.55) internal successors, (102), 41 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 300 transitions. [2025-02-06 10:34:52,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:34:52,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:52,008 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:52,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 10:34:52,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:34:52,212 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:52,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1094436179, now seen corresponding path program 1 times [2025-02-06 10:34:52,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:52,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099629488] [2025-02-06 10:34:52,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:52,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:52,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:34:52,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:34:52,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:52,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:52,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:52,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099629488] [2025-02-06 10:34:52,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099629488] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:34:52,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107781269] [2025-02-06 10:34:52,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:52,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:34:52,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:34:52,815 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-02-06 10:34:52,816 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-02-06 10:34:52,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:34:52,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:34:52,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:52,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:52,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-06 10:34:52,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:34:52,922 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-02-06 10:34:52,953 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-02-06 10:34:52,979 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-02-06 10:34:53,031 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:34:53,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:34:53,064 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-02-06 10:34:53,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:53,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:34:53,117 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 16 treesize of output 8 [2025-02-06 10:34:53,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:34:53,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:34:53,210 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:34:53,210 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-02-06 10:34:53,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:34:53,262 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 19 treesize of output 1 [2025-02-06 10:34:53,299 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 20 treesize of output 8 [2025-02-06 10:34:53,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:34:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:53,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:34:53,484 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1169 (Array Int Int))) (not (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1169) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 2))) is different from false [2025-02-06 10:34:53,534 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1168 (Array Int Int))) (not (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1168) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1169) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2025-02-06 10:34:53,722 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 10:34:53,722 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 13 treesize of output 12 [2025-02-06 10:34:53,890 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_23| Int) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1168 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_94| Int) (|v_ULTIMATE.start_main_#t~malloc10#1.base_18| Int) (v_ArrVal_1161 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_94|) (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_94| (select v_ArrVal_1161 |v_ULTIMATE.start_main_~x~0#1.offset_94|)) v_ArrVal_1161)) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_18| |c_ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1161) |v_ULTIMATE.start_main_#t~malloc7#1.base_23| v_ArrVal_1168) |v_ULTIMATE.start_main_#t~malloc10#1.base_18| v_ArrVal_1169) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 2)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_23|) 0)))) is different from false [2025-02-06 10:34:53,909 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_23| Int) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1168 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_94| Int) (|v_ULTIMATE.start_main_#t~malloc10#1.base_18| Int) (v_ArrVal_1161 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_94|) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_18| |c_ULTIMATE.start_main_~head~0#1.base|) (not (= v_ArrVal_1161 (store (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0 (select v_ArrVal_1161 .cse0))) |v_ULTIMATE.start_main_~x~0#1.offset_94| (select v_ArrVal_1161 |v_ULTIMATE.start_main_~x~0#1.offset_94|)))) (not (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1161) |v_ULTIMATE.start_main_#t~malloc7#1.base_23| v_ArrVal_1168) |v_ULTIMATE.start_main_#t~malloc10#1.base_18| v_ArrVal_1169) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 2)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_23|) 0)))) is different from false [2025-02-06 10:34:53,914 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:34:53,916 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 52 treesize of output 50 [2025-02-06 10:34:53,920 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:34:53,921 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:34:53,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-06 10:34:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:53,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107781269] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:34:53,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:34:53,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 46 [2025-02-06 10:34:53,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968299459] [2025-02-06 10:34:53,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:34:53,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-06 10:34:53,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:53,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-06 10:34:53,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1510, Unknown=47, NotChecked=332, Total=2070 [2025-02-06 10:34:53,954 INFO L87 Difference]: Start difference. First operand 259 states and 300 transitions. Second operand has 46 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 46 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:56,996 INFO L93 Difference]: Finished difference Result 489 states and 553 transitions. [2025-02-06 10:34:56,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-02-06 10:34:56,996 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 46 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-02-06 10:34:56,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:56,997 INFO L225 Difference]: With dead ends: 489 [2025-02-06 10:34:56,997 INFO L226 Difference]: Without dead ends: 489 [2025-02-06 10:34:56,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1694 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=920, Invalid=6312, Unknown=94, NotChecked=684, Total=8010 [2025-02-06 10:34:56,999 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 841 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 4082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1431 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:56,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 1900 Invalid, 4082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2493 Invalid, 0 Unknown, 1431 Unchecked, 1.3s Time] [2025-02-06 10:34:57,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-02-06 10:34:57,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 247. [2025-02-06 10:34:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 226 states have (on average 1.261061946902655) internal successors, (285), 246 states have internal predecessors, (285), 0 states have call successors, (0), 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-02-06 10:34:57,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 285 transitions. [2025-02-06 10:34:57,002 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 285 transitions. Word has length 39 [2025-02-06 10:34:57,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:57,002 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 285 transitions. [2025-02-06 10:34:57,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 46 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:57,003 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 285 transitions. [2025-02-06 10:34:57,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:34:57,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:57,003 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:57,015 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-02-06 10:34:57,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:34:57,203 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:57,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:57,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1395992054, now seen corresponding path program 1 times [2025-02-06 10:34:57,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:57,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235247854] [2025-02-06 10:34:57,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:57,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:57,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:34:57,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:34:57,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:57,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:57,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:57,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:57,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235247854] [2025-02-06 10:34:57,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235247854] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:34:57,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090734080] [2025-02-06 10:34:57,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:57,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:34:57,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:34:57,600 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-02-06 10:34:57,601 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-02-06 10:34:57,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:34:57,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:34:57,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:57,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:57,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 10:34:57,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:34:57,715 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-02-06 10:34:57,738 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:34:57,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 10:34:57,769 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-02-06 10:34:57,818 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:34:57,818 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-02-06 10:34:57,896 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2025-02-06 10:34:57,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2025-02-06 10:34:57,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:57,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2025-02-06 10:34:58,114 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-06 10:34:58,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 45 [2025-02-06 10:34:58,181 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-06 10:34:58,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 45 [2025-02-06 10:34:58,206 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:34:58,206 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 63 treesize of output 54 [2025-02-06 10:34:58,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:58,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 26 [2025-02-06 10:34:58,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:58,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:34:58,514 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1287 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1287) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1)) is different from false [2025-02-06 10:34:58,552 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1287 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1287) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1)) is different from false [2025-02-06 10:34:58,557 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1287 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1287) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1)) is different from false [2025-02-06 10:34:58,600 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1287 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_27| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_99| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_99|) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_27| 1) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_99| |v_ULTIMATE.start_main_#t~malloc7#1.base_27|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_27| v_ArrVal_1287) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_27|) 0)))) is different from false [2025-02-06 10:34:58,617 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1287 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_27| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_99| Int) (v_ArrVal_1281 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_27| 1) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1281))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_99| |v_ULTIMATE.start_main_#t~malloc7#1.base_27|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_27| v_ArrVal_1287) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_99|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_27|) 0)))) is different from false [2025-02-06 10:34:58,678 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:34:58,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:34:58,681 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 30 treesize of output 31 [2025-02-06 10:34:58,683 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 52 treesize of output 48 [2025-02-06 10:34:58,685 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:34:58,687 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 16 treesize of output 12 [2025-02-06 10:34:58,688 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:34:58,690 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 26 treesize of output 18 [2025-02-06 10:35:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:06,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090734080] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:35:06,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:35:06,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 36 [2025-02-06 10:35:06,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058904230] [2025-02-06 10:35:06,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:35:06,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-06 10:35:06,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:06,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-06 10:35:06,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=820, Unknown=16, NotChecked=320, Total=1332 [2025-02-06 10:35:06,836 INFO L87 Difference]: Start difference. First operand 247 states and 285 transitions. Second operand has 37 states, 36 states have (on average 2.6944444444444446) internal successors, (97), 37 states have internal predecessors, (97), 0 states have call successors, (0), 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-02-06 10:35:11,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 10:35:15,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 10:35:20,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 10:35:32,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]