./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-shared-after.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/sll-shared-after.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5faf2b9991f99879bc04c4df6a221302164ff0866019f72f7b8508bf5bf7cdcb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:01:17,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:01:17,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-08 23:01:18,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:01:18,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:01:18,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:01:18,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:01:18,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:01:18,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:01:18,026 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:01:18,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:01:18,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:01:18,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:01:18,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:01:18,026 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:01:18,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:01:18,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:01:18,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:01:18,026 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:01:18,026 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:01:18,026 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:01:18,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:01:18,027 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:01:18,027 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:01:18,027 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:01:18,027 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:01:18,027 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:01:18,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:01:18,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:01:18,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:01:18,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:01:18,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:01:18,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:01:18,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 23:01:18,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 23:01:18,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:01:18,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:01:18,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:01:18,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:01:18,028 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5faf2b9991f99879bc04c4df6a221302164ff0866019f72f7b8508bf5bf7cdcb [2025-03-08 23:01:18,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:01:18,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:01:18,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:01:18,274 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:01:18,274 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:01:18,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-shared-after.i [2025-03-08 23:01:19,432 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b58b0e2e/6c16c58bc20147c3b8208e9af74f4043/FLAG91a065451 [2025-03-08 23:01:19,674 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:01:19,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-shared-after.i [2025-03-08 23:01:19,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b58b0e2e/6c16c58bc20147c3b8208e9af74f4043/FLAG91a065451 [2025-03-08 23:01:19,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b58b0e2e/6c16c58bc20147c3b8208e9af74f4043 [2025-03-08 23:01:19,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:01:19,704 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:01:19,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:01:19,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:01:19,707 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:01:19,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:01:19" (1/1) ... [2025-03-08 23:01:19,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f152dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:19, skipping insertion in model container [2025-03-08 23:01:19,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:01:19" (1/1) ... [2025-03-08 23:01:19,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:01:19,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:01:19,960 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:01:19,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:01:20,016 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:01:20,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:20 WrapperNode [2025-03-08 23:01:20,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:01:20,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:01:20,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:01:20,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:01:20,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:20" (1/1) ... [2025-03-08 23:01:20,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:20" (1/1) ... [2025-03-08 23:01:20,039 INFO L138 Inliner]: procedures = 121, calls = 18, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 59 [2025-03-08 23:01:20,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:01:20,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:01:20,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:01:20,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:01:20,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:20" (1/1) ... [2025-03-08 23:01:20,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:20" (1/1) ... [2025-03-08 23:01:20,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:20" (1/1) ... [2025-03-08 23:01:20,059 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 4 writes are split as follows [4]. [2025-03-08 23:01:20,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:20" (1/1) ... [2025-03-08 23:01:20,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:20" (1/1) ... [2025-03-08 23:01:20,064 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:20" (1/1) ... [2025-03-08 23:01:20,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:20" (1/1) ... [2025-03-08 23:01:20,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:20" (1/1) ... [2025-03-08 23:01:20,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:20" (1/1) ... [2025-03-08 23:01:20,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:01:20,071 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:01:20,071 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:01:20,071 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:01:20,072 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:20" (1/1) ... [2025-03-08 23:01:20,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:01:20,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:01:20,094 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 23:01:20,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 23:01:20,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 23:01:20,109 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-03-08 23:01:20,110 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-03-08 23:01:20,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 23:01:20,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 23:01:20,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 23:01:20,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 23:01:20,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:01:20,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:01:20,186 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:01:20,187 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:01:20,335 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2025-03-08 23:01:20,335 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:01:20,345 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:01:20,345 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:01:20,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:01:20 BoogieIcfgContainer [2025-03-08 23:01:20,346 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:01:20,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:01:20,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:01:20,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:01:20,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:01:19" (1/3) ... [2025-03-08 23:01:20,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca2ca3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:01:20, skipping insertion in model container [2025-03-08 23:01:20,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:20" (2/3) ... [2025-03-08 23:01:20,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca2ca3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:01:20, skipping insertion in model container [2025-03-08 23:01:20,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:01:20" (3/3) ... [2025-03-08 23:01:20,352 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-shared-after.i [2025-03-08 23:01:20,362 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:01:20,363 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-shared-after.i that has 2 procedures, 59 locations, 1 initial locations, 3 loop locations, and 21 error locations. [2025-03-08 23:01:20,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:01:20,396 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;@7df9be73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:01:20,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-08 23:01:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 23:01:20,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 23:01:20,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:20,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 23:01:20,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:20,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:20,406 INFO L85 PathProgramCache]: Analyzing trace with hash 86813983, now seen corresponding path program 1 times [2025-03-08 23:01:20,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:20,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237765409] [2025-03-08 23:01:20,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:20,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:20,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 23:01:20,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 23:01:20,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:20,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:20,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:20,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237765409] [2025-03-08 23:01:20,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237765409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:01:20,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:01:20,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:01:20,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979110057] [2025-03-08 23:01:20,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:01:20,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:01:20,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:20,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:01:20,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:01:20,610 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:01:20,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:20,661 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2025-03-08 23:01:20,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:01:20,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 23:01:20,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:20,667 INFO L225 Difference]: With dead ends: 58 [2025-03-08 23:01:20,667 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 23:01:20,668 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-03-08 23:01:20,670 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:20,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 94 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:01:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 23:01:20,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-08 23:01:20,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 52 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 23:01:20,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2025-03-08 23:01:20,695 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 5 [2025-03-08 23:01:20,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:20,695 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2025-03-08 23:01:20,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:01:20,695 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2025-03-08 23:01:20,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 23:01:20,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:20,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 23:01:20,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 23:01:20,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:20,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:20,696 INFO L85 PathProgramCache]: Analyzing trace with hash 86813984, now seen corresponding path program 1 times [2025-03-08 23:01:20,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:20,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913962677] [2025-03-08 23:01:20,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:20,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:20,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 23:01:20,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 23:01:20,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:20,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:20,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:20,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913962677] [2025-03-08 23:01:20,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913962677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:01:20,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:01:20,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:01:20,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146576292] [2025-03-08 23:01:20,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:01:20,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:01:20,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:20,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:01:20,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:01:20,805 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:01:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:20,858 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2025-03-08 23:01:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:01:20,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 23:01:20,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:20,859 INFO L225 Difference]: With dead ends: 55 [2025-03-08 23:01:20,860 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 23:01:20,860 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-03-08 23:01:20,860 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:20,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:01:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 23:01:20,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-08 23:01:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 23:01:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2025-03-08 23:01:20,867 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 5 [2025-03-08 23:01:20,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:20,867 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2025-03-08 23:01:20,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:01:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2025-03-08 23:01:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 23:01:20,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:20,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:01:20,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 23:01:20,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:20,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:20,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1598701264, now seen corresponding path program 1 times [2025-03-08 23:01:20,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:20,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012577550] [2025-03-08 23:01:20,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:20,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:20,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 23:01:20,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 23:01:20,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:20,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:20,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:20,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012577550] [2025-03-08 23:01:20,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012577550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:01:20,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:01:20,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:01:20,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114241393] [2025-03-08 23:01:20,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:01:20,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:01:20,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:20,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:01:20,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:01:20,965 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:21,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:21,021 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2025-03-08 23:01:21,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:01:21,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-08 23:01:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:21,022 INFO L225 Difference]: With dead ends: 70 [2025-03-08 23:01:21,022 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 23:01:21,023 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-03-08 23:01:21,024 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 27 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:21,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 69 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:01:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 23:01:21,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2025-03-08 23:01:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.605263157894737) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 23:01:21,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2025-03-08 23:01:21,032 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 14 [2025-03-08 23:01:21,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:21,033 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2025-03-08 23:01:21,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:21,034 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2025-03-08 23:01:21,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 23:01:21,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:21,035 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:01:21,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 23:01:21,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:21,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:21,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1598701265, now seen corresponding path program 1 times [2025-03-08 23:01:21,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:21,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848009141] [2025-03-08 23:01:21,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:21,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:21,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 23:01:21,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 23:01:21,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:21,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:21,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:21,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848009141] [2025-03-08 23:01:21,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848009141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:01:21,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:01:21,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:01:21,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157661285] [2025-03-08 23:01:21,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:01:21,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:01:21,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:21,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:01:21,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:01:21,126 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:21,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:21,151 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2025-03-08 23:01:21,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:01:21,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-08 23:01:21,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:21,152 INFO L225 Difference]: With dead ends: 57 [2025-03-08 23:01:21,152 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 23:01:21,152 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-03-08 23:01:21,153 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:21,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 63 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:01:21,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 23:01:21,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-08 23:01:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 53 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 23:01:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2025-03-08 23:01:21,159 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 14 [2025-03-08 23:01:21,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:21,159 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2025-03-08 23:01:21,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2025-03-08 23:01:21,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 23:01:21,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:21,160 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:01:21,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 23:01:21,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:21,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:21,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1638264379, now seen corresponding path program 1 times [2025-03-08 23:01:21,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:21,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231870869] [2025-03-08 23:01:21,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:21,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:21,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 23:01:21,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 23:01:21,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:21,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:21,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:21,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231870869] [2025-03-08 23:01:21,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231870869] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:01:21,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123687730] [2025-03-08 23:01:21,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:21,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:01:21,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:01:21,379 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:01:21,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 23:01:21,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 23:01:21,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 23:01:21,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:21,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:21,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 23:01:21,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:01:21,478 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-03-08 23:01:21,511 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base 1))) is different from true [2025-03-08 23:01:21,537 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 23:01:21,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-08 23:01:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-08 23:01:21,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:01:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:21,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123687730] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:01:21,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:01:21,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2025-03-08 23:01:21,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751725856] [2025-03-08 23:01:21,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:01:21,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 23:01:21,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:21,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 23:01:21,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2025-03-08 23:01:21,710 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 23:01:21,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:21,863 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2025-03-08 23:01:21,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:01:21,863 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 18 [2025-03-08 23:01:21,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:21,864 INFO L225 Difference]: With dead ends: 62 [2025-03-08 23:01:21,864 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 23:01:21,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=101, Unknown=1, NotChecked=20, Total=156 [2025-03-08 23:01:21,864 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:21,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 201 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 163 Invalid, 0 Unknown, 59 Unchecked, 0.1s Time] [2025-03-08 23:01:21,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 23:01:21,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2025-03-08 23:01:21,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 55 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:01:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2025-03-08 23:01:21,871 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 18 [2025-03-08 23:01:21,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:21,873 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2025-03-08 23:01:21,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 23:01:21,873 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2025-03-08 23:01:21,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 23:01:21,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:21,873 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:01:21,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 23:01:22,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:01:22,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:22,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:22,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1638264380, now seen corresponding path program 1 times [2025-03-08 23:01:22,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:22,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390672792] [2025-03-08 23:01:22,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:22,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:22,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 23:01:22,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 23:01:22,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:22,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:22,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:22,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390672792] [2025-03-08 23:01:22,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390672792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:01:22,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620806868] [2025-03-08 23:01:22,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:22,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:01:22,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:01:22,350 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:01:22,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 23:01:22,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 23:01:22,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 23:01:22,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:22,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:22,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 23:01:22,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:01:22,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 23:01:22,428 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-03-08 23:01:22,567 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-03-08 23:01:22,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:01:22,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 23:01:22,604 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:01:22,604 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-03-08 23:01:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-08 23:01:22,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:01:22,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620806868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:01:22,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:01:22,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2025-03-08 23:01:22,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998951331] [2025-03-08 23:01:22,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:01:22,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 23:01:22,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:22,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 23:01:22,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=257, Unknown=1, NotChecked=32, Total=342 [2025-03-08 23:01:22,704 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 23:01:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:22,901 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2025-03-08 23:01:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:01:22,901 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2025-03-08 23:01:22,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:22,902 INFO L225 Difference]: With dead ends: 64 [2025-03-08 23:01:22,902 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 23:01:22,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=319, Unknown=1, NotChecked=36, Total=420 [2025-03-08 23:01:22,903 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 10 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:22,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 353 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 273 Invalid, 0 Unknown, 60 Unchecked, 0.1s Time] [2025-03-08 23:01:22,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 23:01:22,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2025-03-08 23:01:22,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 57 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:01:22,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2025-03-08 23:01:22,908 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 18 [2025-03-08 23:01:22,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:22,908 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2025-03-08 23:01:22,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 23:01:22,908 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2025-03-08 23:01:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 23:01:22,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:22,909 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:01:22,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 23:01:23,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 23:01:23,113 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:23,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:23,113 INFO L85 PathProgramCache]: Analyzing trace with hash 17018357, now seen corresponding path program 1 times [2025-03-08 23:01:23,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:23,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454538049] [2025-03-08 23:01:23,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:23,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:23,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 23:01:23,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 23:01:23,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:23,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:23,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:23,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:23,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454538049] [2025-03-08 23:01:23,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454538049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:01:23,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:01:23,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 23:01:23,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555801225] [2025-03-08 23:01:23,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:01:23,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 23:01:23,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:23,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 23:01:23,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:01:23,245 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:23,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:23,362 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2025-03-08 23:01:23,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 23:01:23,363 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-08 23:01:23,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:23,363 INFO L225 Difference]: With dead ends: 75 [2025-03-08 23:01:23,363 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 23:01:23,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 23:01:23,364 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 28 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:23,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 191 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:01:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 23:01:23,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2025-03-08 23:01:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 62 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:01:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2025-03-08 23:01:23,373 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 17 [2025-03-08 23:01:23,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:23,373 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2025-03-08 23:01:23,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2025-03-08 23:01:23,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 23:01:23,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:23,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:01:23,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 23:01:23,373 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:23,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:23,374 INFO L85 PathProgramCache]: Analyzing trace with hash 17018358, now seen corresponding path program 1 times [2025-03-08 23:01:23,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:23,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806753689] [2025-03-08 23:01:23,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:23,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:23,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 23:01:23,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 23:01:23,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:23,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:23,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:23,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806753689] [2025-03-08 23:01:23,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806753689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:01:23,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:01:23,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 23:01:23,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881540297] [2025-03-08 23:01:23,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:01:23,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 23:01:23,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:23,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 23:01:23,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:01:23,609 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:23,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:23,774 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2025-03-08 23:01:23,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:01:23,777 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-08 23:01:23,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:23,777 INFO L225 Difference]: With dead ends: 76 [2025-03-08 23:01:23,777 INFO L226 Difference]: Without dead ends: 76 [2025-03-08 23:01:23,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 23:01:23,778 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 15 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:23,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 219 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:01:23,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-08 23:01:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2025-03-08 23:01:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.4) internal successors, (70), 63 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:01:23,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2025-03-08 23:01:23,782 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 17 [2025-03-08 23:01:23,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:23,782 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2025-03-08 23:01:23,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2025-03-08 23:01:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 23:01:23,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:23,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:01:23,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 23:01:23,783 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:23,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:23,783 INFO L85 PathProgramCache]: Analyzing trace with hash -825203252, now seen corresponding path program 1 times [2025-03-08 23:01:23,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:23,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696774277] [2025-03-08 23:01:23,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:23,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:23,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 23:01:23,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 23:01:23,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:23,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:23,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:23,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:23,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696774277] [2025-03-08 23:01:23,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696774277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:01:23,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:01:23,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 23:01:23,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343499469] [2025-03-08 23:01:23,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:01:23,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 23:01:23,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:23,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 23:01:23,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:01:23,860 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:23,919 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2025-03-08 23:01:23,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:01:23,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-08 23:01:23,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:23,920 INFO L225 Difference]: With dead ends: 71 [2025-03-08 23:01:23,920 INFO L226 Difference]: Without dead ends: 71 [2025-03-08 23:01:23,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:01:23,920 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 22 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:23,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 315 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:01:23,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-08 23:01:23,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2025-03-08 23:01:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 64 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:01:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2025-03-08 23:01:23,926 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 19 [2025-03-08 23:01:23,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:23,926 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2025-03-08 23:01:23,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:23,926 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2025-03-08 23:01:23,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 23:01:23,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:23,926 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] [2025-03-08 23:01:23,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 23:01:23,926 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:23,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:23,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1524738161, now seen corresponding path program 1 times [2025-03-08 23:01:23,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:23,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821773022] [2025-03-08 23:01:23,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:23,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:23,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 23:01:23,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 23:01:23,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:23,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:24,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:24,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821773022] [2025-03-08 23:01:24,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821773022] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:01:24,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442561281] [2025-03-08 23:01:24,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:24,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:01:24,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:01:24,340 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:01:24,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 23:01:24,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 23:01:24,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 23:01:24,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:24,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:24,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 23:01:24,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:01:24,398 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-03-08 23:01:24,414 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-03-08 23:01:24,420 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-03-08 23:01:24,566 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:01:24,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 23:01:24,598 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-03-08 23:01:24,602 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-03-08 23:01:24,658 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-03-08 23:01:24,662 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-03-08 23:01:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:24,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:01:25,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:01:25,439 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 22 treesize of output 23 [2025-03-08 23:01:25,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:01:25,447 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 36 treesize of output 32 [2025-03-08 23:01:25,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:01:25,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:01:25,479 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 22 treesize of output 23 [2025-03-08 23:01:25,480 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:01:25,487 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 23:01:25,487 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 20 treesize of output 11 [2025-03-08 23:01:25,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:25,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442561281] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:01:25,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:01:25,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 32 [2025-03-08 23:01:25,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427058643] [2025-03-08 23:01:25,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:01:25,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 23:01:25,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:25,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 23:01:25,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=894, Unknown=2, NotChecked=0, Total=992 [2025-03-08 23:01:25,528 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 32 states, 32 states have (on average 1.4375) internal successors, (46), 29 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:01:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:25,977 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2025-03-08 23:01:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 23:01:25,978 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.4375) internal successors, (46), 29 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2025-03-08 23:01:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:25,978 INFO L225 Difference]: With dead ends: 72 [2025-03-08 23:01:25,978 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 23:01:25,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=146, Invalid=1334, Unknown=2, NotChecked=0, Total=1482 [2025-03-08 23:01:25,980 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 12 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:25,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 543 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 23:01:25,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 23:01:25,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2025-03-08 23:01:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 66 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:01:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2025-03-08 23:01:25,982 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 21 [2025-03-08 23:01:25,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:25,982 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2025-03-08 23:01:25,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.4375) internal successors, (46), 29 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:01:25,983 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2025-03-08 23:01:25,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 23:01:25,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:25,983 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-03-08 23:01:25,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 23:01:26,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:01:26,184 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:26,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:26,184 INFO L85 PathProgramCache]: Analyzing trace with hash 689549640, now seen corresponding path program 1 times [2025-03-08 23:01:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:26,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168333451] [2025-03-08 23:01:26,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:26,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 23:01:26,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 23:01:26,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:26,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:26,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:26,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:26,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168333451] [2025-03-08 23:01:26,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168333451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:01:26,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31469800] [2025-03-08 23:01:26,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:26,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:01:26,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:01:26,252 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:01:26,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 23:01:26,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 23:01:26,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 23:01:26,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:26,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:26,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 23:01:26,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:01:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:26,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:01:26,329 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 23:01:26,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-03-08 23:01:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:26,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31469800] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:01:26,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:01:26,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-03-08 23:01:26,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473884583] [2025-03-08 23:01:26,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:01:26,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:01:26,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:26,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:01:26,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:01:26,336 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:26,381 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2025-03-08 23:01:26,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:01:26,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-08 23:01:26,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:26,381 INFO L225 Difference]: With dead ends: 75 [2025-03-08 23:01:26,381 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 23:01:26,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:01:26,382 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:26,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 118 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:01:26,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 23:01:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2025-03-08 23:01:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 66 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:01:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2025-03-08 23:01:26,384 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 23 [2025-03-08 23:01:26,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:26,384 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2025-03-08 23:01:26,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:26,384 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2025-03-08 23:01:26,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 23:01:26,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:26,385 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-03-08 23:01:26,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 23:01:26,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:01:26,585 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:26,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:26,586 INFO L85 PathProgramCache]: Analyzing trace with hash 689549641, now seen corresponding path program 1 times [2025-03-08 23:01:26,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:26,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175162918] [2025-03-08 23:01:26,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:26,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:26,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 23:01:26,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 23:01:26,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:26,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:26,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:26,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175162918] [2025-03-08 23:01:26,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175162918] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:01:26,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998765053] [2025-03-08 23:01:26,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:26,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:01:26,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:01:26,718 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:01:26,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 23:01:26,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 23:01:26,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 23:01:26,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:26,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:26,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 23:01:26,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:01:26,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 23:01:26,800 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-03-08 23:01:26,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:01:26,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 23:01:26,903 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:01:26,903 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-03-08 23:01:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:01:26,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:01:26,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998765053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:01:26,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:01:26,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2025-03-08 23:01:26,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617508345] [2025-03-08 23:01:26,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:01:26,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 23:01:26,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:26,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 23:01:26,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-08 23:01:26,930 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:27,056 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2025-03-08 23:01:27,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:01:27,057 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-08 23:01:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:27,057 INFO L225 Difference]: With dead ends: 76 [2025-03-08 23:01:27,057 INFO L226 Difference]: Without dead ends: 76 [2025-03-08 23:01:27,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-08 23:01:27,057 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 3 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:27,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 174 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:01:27,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-08 23:01:27,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-08 23:01:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 71 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:01:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2025-03-08 23:01:27,060 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 23 [2025-03-08 23:01:27,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:27,060 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2025-03-08 23:01:27,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:27,060 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2025-03-08 23:01:27,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 23:01:27,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:27,065 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] [2025-03-08 23:01:27,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 23:01:27,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 23:01:27,265 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:27,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:27,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1232262013, now seen corresponding path program 1 times [2025-03-08 23:01:27,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:27,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792013404] [2025-03-08 23:01:27,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:27,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:27,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:01:27,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:01:27,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:27,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:01:27,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:27,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792013404] [2025-03-08 23:01:27,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792013404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:01:27,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:01:27,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 23:01:27,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390104239] [2025-03-08 23:01:27,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:01:27,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 23:01:27,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:27,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 23:01:27,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:01:27,332 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:27,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:27,376 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2025-03-08 23:01:27,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:01:27,377 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-08 23:01:27,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:27,377 INFO L225 Difference]: With dead ends: 77 [2025-03-08 23:01:27,377 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 23:01:27,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:01:27,378 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:27,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 296 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:01:27,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 23:01:27,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2025-03-08 23:01:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 55 states have (on average 1.309090909090909) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:01:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2025-03-08 23:01:27,380 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 25 [2025-03-08 23:01:27,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:27,380 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2025-03-08 23:01:27,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2025-03-08 23:01:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 23:01:27,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:27,380 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-03-08 23:01:27,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 23:01:27,381 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:27,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash -455259538, now seen corresponding path program 1 times [2025-03-08 23:01:27,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:27,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157162187] [2025-03-08 23:01:27,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:27,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:27,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 23:01:27,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 23:01:27,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:27,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:01:27,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:27,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157162187] [2025-03-08 23:01:27,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157162187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:01:27,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:01:27,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 23:01:27,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001002327] [2025-03-08 23:01:27,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:01:27,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 23:01:27,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:27,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 23:01:27,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:01:27,485 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:27,554 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2025-03-08 23:01:27,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:01:27,555 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-08 23:01:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:27,555 INFO L225 Difference]: With dead ends: 76 [2025-03-08 23:01:27,555 INFO L226 Difference]: Without dead ends: 76 [2025-03-08 23:01:27,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:01:27,556 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 13 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:27,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 250 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:01:27,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-08 23:01:27,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2025-03-08 23:01:27,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 70 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:01:27,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2025-03-08 23:01:27,558 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 26 [2025-03-08 23:01:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:27,558 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2025-03-08 23:01:27,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2025-03-08 23:01:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 23:01:27,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:27,558 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:01:27,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 23:01:27,562 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:27,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:27,562 INFO L85 PathProgramCache]: Analyzing trace with hash 2061760640, now seen corresponding path program 1 times [2025-03-08 23:01:27,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:27,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690318481] [2025-03-08 23:01:27,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:27,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:27,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 23:01:27,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 23:01:27,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:27,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:27,708 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 23:01:27,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:27,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690318481] [2025-03-08 23:01:27,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690318481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:01:27,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745631936] [2025-03-08 23:01:27,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:27,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:01:27,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:01:27,711 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:01:27,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 23:01:27,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 23:01:27,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 23:01:27,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:27,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:27,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 23:01:27,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:01:27,783 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-03-08 23:01:27,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 23:01:27,795 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 21 treesize of output 9 [2025-03-08 23:01:27,805 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base 1))) is different from true [2025-03-08 23:01:27,817 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 23:01:27,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-08 23:01:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-08 23:01:27,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:01:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:01:27,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745631936] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:01:27,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:01:27,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 13 [2025-03-08 23:01:27,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445176334] [2025-03-08 23:01:27,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:01:27,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 23:01:27,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:27,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 23:01:27,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-03-08 23:01:27,917 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 23:01:28,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:28,077 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2025-03-08 23:01:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 23:01:28,077 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2025-03-08 23:01:28,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:28,078 INFO L225 Difference]: With dead ends: 74 [2025-03-08 23:01:28,078 INFO L226 Difference]: Without dead ends: 74 [2025-03-08 23:01:28,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=197, Unknown=1, NotChecked=28, Total=272 [2025-03-08 23:01:28,078 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:28,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 349 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 263 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2025-03-08 23:01:28,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-08 23:01:28,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-08 23:01:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.293103448275862) internal successors, (75), 69 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:01:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2025-03-08 23:01:28,080 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 30 [2025-03-08 23:01:28,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:28,080 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2025-03-08 23:01:28,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 23:01:28,080 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2025-03-08 23:01:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 23:01:28,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:28,081 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:01:28,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 23:01:28,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 23:01:28,282 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:28,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:28,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2061760641, now seen corresponding path program 1 times [2025-03-08 23:01:28,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:28,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567417586] [2025-03-08 23:01:28,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:28,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:28,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 23:01:28,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 23:01:28,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:28,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:01:28,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:28,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567417586] [2025-03-08 23:01:28,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567417586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:01:28,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931301624] [2025-03-08 23:01:28,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:28,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:01:28,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:01:28,547 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:01:28,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 23:01:28,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 23:01:28,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 23:01:28,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:28,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:28,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 23:01:28,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:01:28,623 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-03-08 23:01:28,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 23:01:28,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 23:01:28,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 23:01:28,689 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 32 treesize of output 14 [2025-03-08 23:01:28,738 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-03-08 23:01:28,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:01:28,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 23:01:28,760 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:01:28,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-03-08 23:01:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-08 23:01:28,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:01:28,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931301624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:01:28,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:01:28,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2025-03-08 23:01:28,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944747928] [2025-03-08 23:01:28,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:01:28,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 23:01:28,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:28,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 23:01:28,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=329, Unknown=1, NotChecked=36, Total=420 [2025-03-08 23:01:28,827 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 15 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 23:01:29,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:29,020 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2025-03-08 23:01:29,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 23:01:29,020 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 15 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 30 [2025-03-08 23:01:29,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:29,021 INFO L225 Difference]: With dead ends: 72 [2025-03-08 23:01:29,021 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 23:01:29,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=475, Unknown=1, NotChecked=44, Total=600 [2025-03-08 23:01:29,021 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 7 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:29,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 367 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 255 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2025-03-08 23:01:29,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 23:01:29,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2025-03-08 23:01:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 64 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 23:01:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2025-03-08 23:01:29,024 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 30 [2025-03-08 23:01:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:29,024 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2025-03-08 23:01:29,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 15 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 23:01:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2025-03-08 23:01:29,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 23:01:29,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:29,025 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:01:29,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 23:01:29,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:01:29,229 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:29,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:29,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1416152848, now seen corresponding path program 1 times [2025-03-08 23:01:29,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:29,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349981435] [2025-03-08 23:01:29,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:29,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:29,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:01:29,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:01:29,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:29,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 23:01:29,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:29,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349981435] [2025-03-08 23:01:29,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349981435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:01:29,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820211740] [2025-03-08 23:01:29,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:29,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:01:29,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:01:29,308 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:01:29,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 23:01:29,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:01:29,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:01:29,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:29,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:29,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 23:01:29,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:01:29,398 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-08 23:01:29,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-08 23:01:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 23:01:29,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:01:29,468 INFO L349 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2025-03-08 23:01:29,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2025-03-08 23:01:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 23:01:29,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820211740] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:01:29,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:01:29,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 10 [2025-03-08 23:01:29,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838739200] [2025-03-08 23:01:29,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:01:29,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 23:01:29,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:29,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 23:01:29,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 23:01:29,511 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 23:01:29,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:29,621 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2025-03-08 23:01:29,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:01:29,621 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-08 23:01:29,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:29,623 INFO L225 Difference]: With dead ends: 90 [2025-03-08 23:01:29,623 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 23:01:29,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 23:01:29,623 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 26 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:29,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 271 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:01:29,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 23:01:29,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2025-03-08 23:01:29,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 76 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:01:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2025-03-08 23:01:29,626 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 29 [2025-03-08 23:01:29,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:29,626 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2025-03-08 23:01:29,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 23:01:29,626 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2025-03-08 23:01:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 23:01:29,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:29,627 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:01:29,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 23:01:29,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 23:01:29,827 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:29,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:29,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1416152849, now seen corresponding path program 1 times [2025-03-08 23:01:29,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:29,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111448865] [2025-03-08 23:01:29,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:29,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:29,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:01:29,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:01:29,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:29,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:30,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:30,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:30,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111448865] [2025-03-08 23:01:30,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111448865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:01:30,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472448790] [2025-03-08 23:01:30,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:30,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:01:30,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:01:30,082 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:01:30,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 23:01:30,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:01:30,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:01:30,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:30,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:30,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 23:01:30,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:01:30,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:01:30,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 23:01:30,289 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:01:30,289 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-03-08 23:01:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:01:30,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:01:30,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:01:30,530 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 49 treesize of output 53 [2025-03-08 23:01:30,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:01:30,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2025-03-08 23:01:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:01:30,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472448790] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:01:30,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:01:30,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 27 [2025-03-08 23:01:30,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431484199] [2025-03-08 23:01:30,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:01:30,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 23:01:30,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:30,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 23:01:30,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2025-03-08 23:01:30,679 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-08 23:01:31,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:31,003 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2025-03-08 23:01:31,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 23:01:31,003 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2025-03-08 23:01:31,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:31,003 INFO L225 Difference]: With dead ends: 91 [2025-03-08 23:01:31,003 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 23:01:31,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 23:01:31,004 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 33 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:31,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 494 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:01:31,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 23:01:31,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2025-03-08 23:01:31,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 77 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:01:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2025-03-08 23:01:31,006 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 29 [2025-03-08 23:01:31,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:31,006 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2025-03-08 23:01:31,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-08 23:01:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2025-03-08 23:01:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 23:01:31,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:31,007 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:01:31,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 23:01:31,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 23:01:31,211 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:31,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:31,211 INFO L85 PathProgramCache]: Analyzing trace with hash 869810625, now seen corresponding path program 1 times [2025-03-08 23:01:31,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:31,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782913838] [2025-03-08 23:01:31,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:31,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:31,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:01:31,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:01:31,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:31,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:31,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:31,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782913838] [2025-03-08 23:01:31,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782913838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:01:31,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812344684] [2025-03-08 23:01:31,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:31,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:01:31,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:01:31,504 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:01:31,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 23:01:31,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:01:31,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:01:31,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:31,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:31,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-08 23:01:31,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:01:31,577 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-03-08 23:01:31,591 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-03-08 23:01:31,595 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-03-08 23:01:31,723 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:01:31,723 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-03-08 23:01:31,749 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-03-08 23:01:31,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-03-08 23:01:31,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:01:31,810 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-03-08 23:01:31,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:01:31,814 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-03-08 23:01:31,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:01:31,867 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-03-08 23:01:31,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:01:31,871 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-03-08 23:01:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:31,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:01:32,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:01:32,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2025-03-08 23:01:32,668 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 38 treesize of output 34 [2025-03-08 23:01:32,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:01:32,676 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 32 treesize of output 34 [2025-03-08 23:01:32,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-08 23:01:32,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:01:32,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2025-03-08 23:01:32,725 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:01:32,727 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 21 treesize of output 17 [2025-03-08 23:01:32,735 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 23:01:32,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2025-03-08 23:01:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:01:32,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812344684] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:01:32,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:01:32,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 39 [2025-03-08 23:01:32,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034074267] [2025-03-08 23:01:32,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:01:32,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-08 23:01:32,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:32,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-08 23:01:32,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1346, Unknown=29, NotChecked=0, Total=1482 [2025-03-08 23:01:32,774 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 36 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:01:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:33,391 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2025-03-08 23:01:33,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 23:01:33,391 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 36 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2025-03-08 23:01:33,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:33,392 INFO L225 Difference]: With dead ends: 95 [2025-03-08 23:01:33,392 INFO L226 Difference]: Without dead ends: 95 [2025-03-08 23:01:33,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=191, Invalid=2226, Unknown=33, NotChecked=0, Total=2450 [2025-03-08 23:01:33,393 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:33,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 471 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 23:01:33,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-08 23:01:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2025-03-08 23:01:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:01:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2025-03-08 23:01:33,395 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 29 [2025-03-08 23:01:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:33,395 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2025-03-08 23:01:33,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 36 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:01:33,396 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2025-03-08 23:01:33,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 23:01:33,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:33,396 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] [2025-03-08 23:01:33,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 23:01:33,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:01:33,597 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:33,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:33,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1630590538, now seen corresponding path program 1 times [2025-03-08 23:01:33,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:33,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047216895] [2025-03-08 23:01:33,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:33,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:33,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 23:01:33,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 23:01:33,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:33,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:33,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 23:01:33,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:33,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047216895] [2025-03-08 23:01:33,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047216895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:01:33,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:01:33,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:01:33,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909139139] [2025-03-08 23:01:33,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:01:33,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:01:33,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:01:33,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:01:33,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:01:33,636 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:01:33,647 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2025-03-08 23:01:33,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:01:33,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-03-08 23:01:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:01:33,648 INFO L225 Difference]: With dead ends: 91 [2025-03-08 23:01:33,648 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 23:01:33,648 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-03-08 23:01:33,649 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:01:33,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 58 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:01:33,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 23:01:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-08 23:01:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 86 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:01:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2025-03-08 23:01:33,651 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 31 [2025-03-08 23:01:33,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:01:33,651 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2025-03-08 23:01:33,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:01:33,651 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2025-03-08 23:01:33,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 23:01:33,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:01:33,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:01:33,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 23:01:33,654 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2025-03-08 23:01:33,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:01:33,655 INFO L85 PathProgramCache]: Analyzing trace with hash -712066036, now seen corresponding path program 1 times [2025-03-08 23:01:33,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:01:33,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120421911] [2025-03-08 23:01:33,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:33,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:01:33,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 23:01:33,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 23:01:33,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:33,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:01:34,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:01:34,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120421911] [2025-03-08 23:01:34,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120421911] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:01:34,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003230086] [2025-03-08 23:01:34,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:01:34,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:01:34,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:01:34,018 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:01:34,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 23:01:34,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 23:01:34,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 23:01:34,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:01:34,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:01:34,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 23:01:34,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:01:34,163 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-03-08 23:01:34,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 23:01:34,257 INFO L349 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2025-03-08 23:01:34,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2025-03-08 23:01:34,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2025-03-08 23:01:34,390 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 33 treesize of output 17 [2025-03-08 23:01:34,423 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 25 treesize of output 13 [2025-03-08 23:01:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:01:34,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:01:34,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:01:34,675 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 27 treesize of output 28 [2025-03-08 23:01:34,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:01:34,680 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 46 treesize of output 45 [2025-03-08 23:01:34,683 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-03-08 23:01:35,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:01:35,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 237 treesize of output 835