./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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/forester-heap/sll-buckets-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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 32bit --witnessprinter.graph.data.programhash c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:52:34,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:52:34,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:52:34,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:52:34,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:52:34,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:52:34,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:52:34,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:52:34,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:52:34,109 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:52:34,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:52:34,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:52:34,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:52:34,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:52:34,110 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:52:34,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:52:34,110 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:52:34,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:52:34,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:52:34,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:52:34,111 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:52:34,111 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:52:34,111 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:52:34,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:52:34,111 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:52:34,111 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:52:34,111 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:52:34,111 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:52:34,111 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:52:34,111 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:52:34,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:52:34,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:52:34,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:52:34,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:52:34,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:52:34,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:52:34,112 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:52:34,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:52:34,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:52:34,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:52:34,112 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:52:34,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:52:34,113 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac [2025-03-04 07:52:34,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:52:34,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:52:34,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:52:34,347 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:52:34,347 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:52:34,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-1.i [2025-03-04 07:52:35,534 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a63ccd22/68e448fcc0c8485492cf1406576dc191/FLAG30431d99e [2025-03-04 07:52:35,798 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:52:35,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2025-03-04 07:52:35,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a63ccd22/68e448fcc0c8485492cf1406576dc191/FLAG30431d99e [2025-03-04 07:52:36,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a63ccd22/68e448fcc0c8485492cf1406576dc191 [2025-03-04 07:52:36,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:52:36,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:52:36,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:52:36,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:52:36,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:52:36,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:52:36" (1/1) ... [2025-03-04 07:52:36,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16745eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:36, skipping insertion in model container [2025-03-04 07:52:36,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:52:36" (1/1) ... [2025-03-04 07:52:36,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:52:36,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:52:36,332 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:52:36,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:52:36,386 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:52:36,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:36 WrapperNode [2025-03-04 07:52:36,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:52:36,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:52:36,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:52:36,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:52:36,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:36" (1/1) ... [2025-03-04 07:52:36,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:36" (1/1) ... [2025-03-04 07:52:36,414 INFO L138 Inliner]: procedures = 119, calls = 47, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 147 [2025-03-04 07:52:36,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:52:36,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:52:36,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:52:36,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:52:36,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:36" (1/1) ... [2025-03-04 07:52:36,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:36" (1/1) ... [2025-03-04 07:52:36,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:36" (1/1) ... [2025-03-04 07:52:36,437 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 16 writes are split as follows [0, 16]. [2025-03-04 07:52:36,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:36" (1/1) ... [2025-03-04 07:52:36,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:36" (1/1) ... [2025-03-04 07:52:36,445 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:36" (1/1) ... [2025-03-04 07:52:36,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:36" (1/1) ... [2025-03-04 07:52:36,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:36" (1/1) ... [2025-03-04 07:52:36,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:36" (1/1) ... [2025-03-04 07:52:36,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:52:36,450 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:52:36,450 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:52:36,450 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:52:36,450 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:36" (1/1) ... [2025-03-04 07:52:36,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:52:36,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:36,479 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-04 07:52:36,481 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-04 07:52:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 07:52:36,496 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 07:52:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:52:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:52:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:52:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:52:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:52:36,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:52:36,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:52:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:52:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:52:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:52:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:52:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:52:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:52:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:52:36,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:52:36,588 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:52:36,589 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:52:36,910 INFO L? ?]: Removed 143 outVars from TransFormulas that were not future-live. [2025-03-04 07:52:36,910 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:52:36,921 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:52:36,921 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:52:36,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:52:36 BoogieIcfgContainer [2025-03-04 07:52:36,922 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:52:36,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:52:36,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:52:36,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:52:36,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:52:36" (1/3) ... [2025-03-04 07:52:36,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c9e9a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:52:36, skipping insertion in model container [2025-03-04 07:52:36,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:36" (2/3) ... [2025-03-04 07:52:36,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c9e9a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:52:36, skipping insertion in model container [2025-03-04 07:52:36,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:52:36" (3/3) ... [2025-03-04 07:52:36,933 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2025-03-04 07:52:36,944 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:52:36,945 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-buckets-1.i that has 2 procedures, 159 locations, 1 initial locations, 10 loop locations, and 68 error locations. [2025-03-04 07:52:36,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:52:36,982 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;@5cfd0e13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:52:36,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2025-03-04 07:52:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 84 states have (on average 2.130952380952381) internal successors, (179), 152 states have internal predecessors, (179), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 07:52:36,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:52:36,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:36,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:52:36,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:52:36,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:36,992 INFO L85 PathProgramCache]: Analyzing trace with hash 213462, now seen corresponding path program 1 times [2025-03-04 07:52:36,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:36,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254949204] [2025-03-04 07:52:36,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:36,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:37,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:52:37,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:52:37,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:37,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:37,161 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-04 07:52:37,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:37,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254949204] [2025-03-04 07:52:37,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254949204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:37,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:37,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:37,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726754434] [2025-03-04 07:52:37,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:37,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:37,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:37,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:37,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:37,190 INFO L87 Difference]: Start difference. First operand has 159 states, 84 states have (on average 2.130952380952381) internal successors, (179), 152 states have internal predecessors, (179), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:37,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:37,308 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2025-03-04 07:52:37,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:37,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 07:52:37,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:37,315 INFO L225 Difference]: With dead ends: 148 [2025-03-04 07:52:37,315 INFO L226 Difference]: Without dead ends: 146 [2025-03-04 07:52:37,316 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-04 07:52:37,318 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 95 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:37,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 136 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:37,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-04 07:52:37,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-03-04 07:52:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 77 states have (on average 1.974025974025974) internal successors, (152), 144 states have internal predecessors, (152), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:37,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2025-03-04 07:52:37,350 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 3 [2025-03-04 07:52:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:37,350 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2025-03-04 07:52:37,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:37,350 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2025-03-04 07:52:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:52:37,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:37,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:52:37,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:52:37,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:52:37,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:37,351 INFO L85 PathProgramCache]: Analyzing trace with hash 213463, now seen corresponding path program 1 times [2025-03-04 07:52:37,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:37,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619393045] [2025-03-04 07:52:37,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:37,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:37,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:52:37,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:52:37,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:37,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:37,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:37,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619393045] [2025-03-04 07:52:37,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619393045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:37,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:37,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:37,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804581014] [2025-03-04 07:52:37,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:37,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:37,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:37,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:37,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:37,430 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:37,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:37,567 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2025-03-04 07:52:37,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:37,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 07:52:37,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:37,568 INFO L225 Difference]: With dead ends: 145 [2025-03-04 07:52:37,568 INFO L226 Difference]: Without dead ends: 145 [2025-03-04 07:52:37,568 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-04 07:52:37,568 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 32 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:37,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 202 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:37,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-04 07:52:37,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2025-03-04 07:52:37,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 77 states have (on average 1.922077922077922) internal successors, (148), 140 states have internal predecessors, (148), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:37,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2025-03-04 07:52:37,574 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 3 [2025-03-04 07:52:37,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:37,574 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2025-03-04 07:52:37,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2025-03-04 07:52:37,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:52:37,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:37,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:37,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:52:37,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:52:37,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:37,575 INFO L85 PathProgramCache]: Analyzing trace with hash 559947477, now seen corresponding path program 1 times [2025-03-04 07:52:37,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:37,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393180916] [2025-03-04 07:52:37,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:37,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:37,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:52:37,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:52:37,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:37,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:37,758 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-04 07:52:37,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:37,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393180916] [2025-03-04 07:52:37,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393180916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:37,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:37,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:52:37,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130156464] [2025-03-04 07:52:37,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:37,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:52:37,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:37,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:52:37,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:37,759 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:38,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:38,003 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2025-03-04 07:52:38,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:52:38,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 07:52:38,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:38,007 INFO L225 Difference]: With dead ends: 145 [2025-03-04 07:52:38,007 INFO L226 Difference]: Without dead ends: 145 [2025-03-04 07:52:38,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:52:38,007 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 43 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:38,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 334 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-04 07:52:38,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2025-03-04 07:52:38,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 86 states have (on average 1.7906976744186047) internal successors, (154), 138 states have internal predecessors, (154), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2025-03-04 07:52:38,016 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 159 transitions. Word has length 10 [2025-03-04 07:52:38,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:38,017 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 159 transitions. [2025-03-04 07:52:38,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2025-03-04 07:52:38,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:52:38,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:38,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:38,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:52:38,017 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:52:38,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:38,018 INFO L85 PathProgramCache]: Analyzing trace with hash 559947478, now seen corresponding path program 1 times [2025-03-04 07:52:38,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:38,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573407625] [2025-03-04 07:52:38,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:38,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:38,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:52:38,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:52:38,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:38,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:38,237 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-04 07:52:38,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:38,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573407625] [2025-03-04 07:52:38,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573407625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:38,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:38,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:52:38,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24695378] [2025-03-04 07:52:38,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:38,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:52:38,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:38,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:52:38,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:38,238 INFO L87 Difference]: Start difference. First operand 140 states and 159 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:38,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:38,433 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2025-03-04 07:52:38,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:52:38,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 07:52:38,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:38,434 INFO L225 Difference]: With dead ends: 136 [2025-03-04 07:52:38,434 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 07:52:38,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:52:38,434 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 6 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:38,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 421 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:38,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 07:52:38,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-04 07:52:38,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 86 states have (on average 1.744186046511628) internal successors, (150), 134 states have internal predecessors, (150), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:38,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 155 transitions. [2025-03-04 07:52:38,439 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 155 transitions. Word has length 10 [2025-03-04 07:52:38,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:38,439 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 155 transitions. [2025-03-04 07:52:38,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:38,440 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 155 transitions. [2025-03-04 07:52:38,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:52:38,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:38,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:38,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:52:38,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:52:38,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:38,441 INFO L85 PathProgramCache]: Analyzing trace with hash -932258169, now seen corresponding path program 1 times [2025-03-04 07:52:38,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:38,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261938045] [2025-03-04 07:52:38,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:38,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:38,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:52:38,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:52:38,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:38,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:38,570 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-04 07:52:38,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:38,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261938045] [2025-03-04 07:52:38,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261938045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:38,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:38,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:52:38,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99779926] [2025-03-04 07:52:38,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:38,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:52:38,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:38,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:52:38,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:38,572 INFO L87 Difference]: Start difference. First operand 136 states and 155 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:38,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:38,776 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2025-03-04 07:52:38,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:52:38,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 07:52:38,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:38,777 INFO L225 Difference]: With dead ends: 140 [2025-03-04 07:52:38,777 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 07:52:38,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:52:38,778 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 40 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:38,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 326 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 07:52:38,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 135. [2025-03-04 07:52:38,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 86 states have (on average 1.7325581395348837) internal successors, (149), 133 states have internal predecessors, (149), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 154 transitions. [2025-03-04 07:52:38,785 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 154 transitions. Word has length 17 [2025-03-04 07:52:38,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:38,785 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 154 transitions. [2025-03-04 07:52:38,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:38,785 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2025-03-04 07:52:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:52:38,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:38,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:38,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:52:38,789 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:52:38,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:38,789 INFO L85 PathProgramCache]: Analyzing trace with hash -932258168, now seen corresponding path program 1 times [2025-03-04 07:52:38,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:38,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81573896] [2025-03-04 07:52:38,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:38,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:38,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:52:38,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:52:38,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:38,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:38,980 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-04 07:52:38,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:38,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81573896] [2025-03-04 07:52:38,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81573896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:38,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:38,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:52:38,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092652782] [2025-03-04 07:52:38,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:38,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:52:38,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:38,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:52:38,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:38,982 INFO L87 Difference]: Start difference. First operand 135 states and 154 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:39,142 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2025-03-04 07:52:39,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:52:39,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 07:52:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:39,143 INFO L225 Difference]: With dead ends: 132 [2025-03-04 07:52:39,143 INFO L226 Difference]: Without dead ends: 132 [2025-03-04 07:52:39,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:39,144 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 2 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:39,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 410 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-04 07:52:39,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-04 07:52:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 86 states have (on average 1.697674418604651) internal successors, (146), 130 states have internal predecessors, (146), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:39,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 151 transitions. [2025-03-04 07:52:39,152 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 151 transitions. Word has length 17 [2025-03-04 07:52:39,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:39,152 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 151 transitions. [2025-03-04 07:52:39,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:39,152 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 151 transitions. [2025-03-04 07:52:39,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:52:39,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:39,153 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-04 07:52:39,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:52:39,153 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:52:39,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:39,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1700820452, now seen corresponding path program 1 times [2025-03-04 07:52:39,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:39,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231347363] [2025-03-04 07:52:39,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:39,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:39,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:52:39,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:52:39,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:39,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:39,214 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-04 07:52:39,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:39,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231347363] [2025-03-04 07:52:39,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231347363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:39,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:39,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:39,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248800260] [2025-03-04 07:52:39,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:39,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:39,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:39,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:39,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:39,216 INFO L87 Difference]: Start difference. First operand 132 states and 151 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:39,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:39,277 INFO L93 Difference]: Finished difference Result 127 states and 146 transitions. [2025-03-04 07:52:39,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:39,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 07:52:39,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:39,279 INFO L225 Difference]: With dead ends: 127 [2025-03-04 07:52:39,279 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 07:52:39,279 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-04 07:52:39,279 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 47 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:39,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 138 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:39,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 07:52:39,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-04 07:52:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 125 states have internal predecessors, (141), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2025-03-04 07:52:39,283 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 146 transitions. Word has length 23 [2025-03-04 07:52:39,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:39,283 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 146 transitions. [2025-03-04 07:52:39,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 146 transitions. [2025-03-04 07:52:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:52:39,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:39,284 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-04 07:52:39,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:52:39,284 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:52:39,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:39,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1700820451, now seen corresponding path program 1 times [2025-03-04 07:52:39,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:39,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564527762] [2025-03-04 07:52:39,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:39,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:39,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:52:39,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:52:39,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:39,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:39,423 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-04 07:52:39,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:39,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564527762] [2025-03-04 07:52:39,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564527762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:39,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:39,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:39,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834523163] [2025-03-04 07:52:39,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:39,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:39,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:39,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:39,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:39,424 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:39,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:39,491 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2025-03-04 07:52:39,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:39,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 07:52:39,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:39,494 INFO L225 Difference]: With dead ends: 122 [2025-03-04 07:52:39,494 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 07:52:39,494 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-04 07:52:39,494 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 47 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:39,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 138 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 07:52:39,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-04 07:52:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.5813953488372092) internal successors, (136), 120 states have internal predecessors, (136), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2025-03-04 07:52:39,499 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 23 [2025-03-04 07:52:39,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:39,499 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2025-03-04 07:52:39,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2025-03-04 07:52:39,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:52:39,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:39,500 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-04 07:52:39,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:52:39,500 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:52:39,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:39,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1893982831, now seen corresponding path program 1 times [2025-03-04 07:52:39,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:39,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617327636] [2025-03-04 07:52:39,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:39,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:39,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:52:39,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:52:39,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:39,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:39,558 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-04 07:52:39,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:39,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617327636] [2025-03-04 07:52:39,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617327636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:39,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:39,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:39,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466368263] [2025-03-04 07:52:39,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:39,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:39,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:39,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:39,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:39,559 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:39,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:39,633 INFO L93 Difference]: Finished difference Result 174 states and 218 transitions. [2025-03-04 07:52:39,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:39,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-04 07:52:39,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:39,634 INFO L225 Difference]: With dead ends: 174 [2025-03-04 07:52:39,634 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 07:52:39,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:39,635 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 115 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:39,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 191 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:39,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 07:52:39,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 126. [2025-03-04 07:52:39,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.5714285714285714) internal successors, (143), 124 states have internal predecessors, (143), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:39,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2025-03-04 07:52:39,638 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 25 [2025-03-04 07:52:39,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:39,638 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2025-03-04 07:52:39,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:39,638 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2025-03-04 07:52:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:52:39,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:39,638 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-04 07:52:39,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:52:39,638 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:52:39,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:39,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1893984463, now seen corresponding path program 1 times [2025-03-04 07:52:39,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:39,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011874617] [2025-03-04 07:52:39,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:39,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:39,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:52:39,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:52:39,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:39,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:39,777 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-04 07:52:39,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:39,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011874617] [2025-03-04 07:52:39,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011874617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:39,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:39,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:52:39,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091827947] [2025-03-04 07:52:39,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:39,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:39,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:39,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:39,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:39,778 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:39,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:39,890 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2025-03-04 07:52:39,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:39,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-04 07:52:39,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:39,891 INFO L225 Difference]: With dead ends: 138 [2025-03-04 07:52:39,891 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 07:52:39,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:39,892 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 102 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:39,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 113 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:39,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 07:52:39,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 131. [2025-03-04 07:52:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 96 states have (on average 1.5625) internal successors, (150), 129 states have internal predecessors, (150), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 154 transitions. [2025-03-04 07:52:39,896 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 154 transitions. Word has length 25 [2025-03-04 07:52:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:39,896 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 154 transitions. [2025-03-04 07:52:39,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:39,896 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2025-03-04 07:52:39,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:52:39,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:39,897 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-04 07:52:39,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:52:39,897 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:52:39,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:39,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1893984464, now seen corresponding path program 1 times [2025-03-04 07:52:39,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:39,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339966913] [2025-03-04 07:52:39,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:39,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:39,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:52:39,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:52:39,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:39,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:40,170 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-04 07:52:40,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:40,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339966913] [2025-03-04 07:52:40,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339966913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:40,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:40,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:52:40,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277104061] [2025-03-04 07:52:40,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:40,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:52:40,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:40,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:52:40,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:52:40,172 INFO L87 Difference]: Start difference. First operand 131 states and 154 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:40,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:40,425 INFO L93 Difference]: Finished difference Result 176 states and 208 transitions. [2025-03-04 07:52:40,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:52:40,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-04 07:52:40,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:40,426 INFO L225 Difference]: With dead ends: 176 [2025-03-04 07:52:40,426 INFO L226 Difference]: Without dead ends: 176 [2025-03-04 07:52:40,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:52:40,426 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 117 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:40,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 231 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:40,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-04 07:52:40,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 166. [2025-03-04 07:52:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 131 states have (on average 1.5419847328244274) internal successors, (202), 164 states have internal predecessors, (202), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 206 transitions. [2025-03-04 07:52:40,435 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 206 transitions. Word has length 25 [2025-03-04 07:52:40,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:40,435 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 206 transitions. [2025-03-04 07:52:40,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:40,435 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 206 transitions. [2025-03-04 07:52:40,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:52:40,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:40,436 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] [2025-03-04 07:52:40,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:52:40,436 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:52:40,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:40,437 INFO L85 PathProgramCache]: Analyzing trace with hash 404790185, now seen corresponding path program 1 times [2025-03-04 07:52:40,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:40,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695460466] [2025-03-04 07:52:40,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:40,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:40,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:52:40,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:52:40,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:40,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:41,071 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-04 07:52:41,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:41,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695460466] [2025-03-04 07:52:41,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695460466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:41,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:41,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 07:52:41,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208843569] [2025-03-04 07:52:41,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:41,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 07:52:41,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:41,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 07:52:41,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:52:41,073 INFO L87 Difference]: Start difference. First operand 166 states and 206 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:41,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:41,528 INFO L93 Difference]: Finished difference Result 180 states and 219 transitions. [2025-03-04 07:52:41,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:52:41,528 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-04 07:52:41,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:41,530 INFO L225 Difference]: With dead ends: 180 [2025-03-04 07:52:41,531 INFO L226 Difference]: Without dead ends: 180 [2025-03-04 07:52:41,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2025-03-04 07:52:41,531 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 123 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:41,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 514 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:52:41,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-04 07:52:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 173. [2025-03-04 07:52:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 139 states have (on average 1.4892086330935252) internal successors, (207), 171 states have internal predecessors, (207), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 210 transitions. [2025-03-04 07:52:41,535 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 210 transitions. Word has length 29 [2025-03-04 07:52:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:41,535 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 210 transitions. [2025-03-04 07:52:41,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 210 transitions. [2025-03-04 07:52:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:52:41,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:41,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:41,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:52:41,538 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:52:41,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:41,538 INFO L85 PathProgramCache]: Analyzing trace with hash -2128477859, now seen corresponding path program 1 times [2025-03-04 07:52:41,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:41,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712126196] [2025-03-04 07:52:41,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:41,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:41,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:52:41,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:52:41,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:41,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:41,585 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-04 07:52:41,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:41,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712126196] [2025-03-04 07:52:41,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712126196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:41,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:41,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:52:41,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313838796] [2025-03-04 07:52:41,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:41,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:41,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:41,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:41,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:41,587 INFO L87 Difference]: Start difference. First operand 173 states and 210 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-04 07:52:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:41,607 INFO L93 Difference]: Finished difference Result 172 states and 208 transitions. [2025-03-04 07:52:41,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:41,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 33 [2025-03-04 07:52:41,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:41,608 INFO L225 Difference]: With dead ends: 172 [2025-03-04 07:52:41,608 INFO L226 Difference]: Without dead ends: 172 [2025-03-04 07:52:41,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:41,611 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 38 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:41,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 171 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:52:41,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-04 07:52:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-03-04 07:52:41,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 139 states have (on average 1.4820143884892085) internal successors, (206), 170 states have internal predecessors, (206), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 208 transitions. [2025-03-04 07:52:41,615 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 208 transitions. Word has length 33 [2025-03-04 07:52:41,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:41,615 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 208 transitions. [2025-03-04 07:52:41,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-04 07:52:41,615 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 208 transitions. [2025-03-04 07:52:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 07:52:41,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:41,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:41,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:52:41,617 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:52:41,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:41,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1642572179, now seen corresponding path program 1 times [2025-03-04 07:52:41,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:41,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597374442] [2025-03-04 07:52:41,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:41,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:41,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:52:41,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:52:41,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:41,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:41,692 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-04 07:52:41,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:41,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597374442] [2025-03-04 07:52:41,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597374442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:41,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:41,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:52:41,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904955598] [2025-03-04 07:52:41,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:41,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:41,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:41,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:41,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:41,694 INFO L87 Difference]: Start difference. First operand 172 states and 208 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:41,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:41,779 INFO L93 Difference]: Finished difference Result 183 states and 211 transitions. [2025-03-04 07:52:41,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:41,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-04 07:52:41,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:41,780 INFO L225 Difference]: With dead ends: 183 [2025-03-04 07:52:41,780 INFO L226 Difference]: Without dead ends: 183 [2025-03-04 07:52:41,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:41,781 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 94 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:41,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 219 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:41,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-04 07:52:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 174. [2025-03-04 07:52:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 141 states have (on average 1.475177304964539) internal successors, (208), 172 states have internal predecessors, (208), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:41,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 210 transitions. [2025-03-04 07:52:41,786 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 210 transitions. Word has length 35 [2025-03-04 07:52:41,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:41,786 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 210 transitions. [2025-03-04 07:52:41,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:41,787 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 210 transitions. [2025-03-04 07:52:41,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:52:41,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:41,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:41,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:52:41,788 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:52:41,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:41,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2073847476, now seen corresponding path program 1 times [2025-03-04 07:52:41,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:41,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062354872] [2025-03-04 07:52:41,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:41,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:41,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:52:41,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:52:41,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:41,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:42,426 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-04 07:52:42,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:42,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062354872] [2025-03-04 07:52:42,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062354872] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:52:42,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547695915] [2025-03-04 07:52:42,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:42,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:42,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:42,428 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-04 07:52:42,430 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-04 07:52:42,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:52:42,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:52:42,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:42,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:42,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 07:52:42,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:42,572 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-04 07:52:42,610 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:52:42,611 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-04 07:52:42,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:52:42,696 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-04 07:52:42,709 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-04 07:52:42,734 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:52:42,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 07:52:42,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:52:42,970 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-03-04 07:52:42,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 44 [2025-03-04 07:52:42,981 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 12 treesize of output 8 [2025-03-04 07:52:43,055 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-03-04 07:52:43,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2025-03-04 07:52:43,112 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-03-04 07:52:43,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2025-03-04 07:52:43,190 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-03-04 07:52:43,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2025-03-04 07:52:43,242 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 34 treesize of output 25 [2025-03-04 07:52:43,276 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 34 treesize of output 25 [2025-03-04 07:52:43,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:52:43,411 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-04 07:52:43,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:52:52,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:52,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2025-03-04 07:53:07,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:07,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2025-03-04 07:53:07,859 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:53:07,860 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:53:07,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:07,869 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 50 treesize of output 50 [2025-03-04 07:53:07,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:07,880 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 68 treesize of output 64 [2025-03-04 07:53:08,933 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-04 07:53:08,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547695915] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:53:08,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:53:08,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 43 [2025-03-04 07:53:08,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212355699] [2025-03-04 07:53:08,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:53:08,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 07:53:08,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:08,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 07:53:08,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1651, Unknown=21, NotChecked=0, Total=1892 [2025-03-04 07:53:08,935 INFO L87 Difference]: Start difference. First operand 174 states and 210 transitions. Second operand has 44 states, 43 states have (on average 2.3488372093023258) internal successors, (101), 44 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:10,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:10,942 INFO L93 Difference]: Finished difference Result 240 states and 282 transitions. [2025-03-04 07:53:10,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:53:10,943 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.3488372093023258) internal successors, (101), 44 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-04 07:53:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:10,944 INFO L225 Difference]: With dead ends: 240 [2025-03-04 07:53:10,944 INFO L226 Difference]: Without dead ends: 240 [2025-03-04 07:53:10,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=371, Invalid=2364, Unknown=21, NotChecked=0, Total=2756 [2025-03-04 07:53:10,945 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 427 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 1893 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:10,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1189 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1893 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 07:53:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-04 07:53:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 192. [2025-03-04 07:53:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 159 states have (on average 1.4465408805031446) internal successors, (230), 190 states have internal predecessors, (230), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 232 transitions. [2025-03-04 07:53:10,950 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 232 transitions. Word has length 37 [2025-03-04 07:53:10,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:10,950 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 232 transitions. [2025-03-04 07:53:10,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.3488372093023258) internal successors, (101), 44 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:10,950 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 232 transitions. [2025-03-04 07:53:10,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:53:10,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:10,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:10,959 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-04 07:53:11,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 07:53:11,156 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:53:11,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:11,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2073847475, now seen corresponding path program 1 times [2025-03-04 07:53:11,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:11,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332883818] [2025-03-04 07:53:11,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:11,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:11,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:53:11,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:53:11,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:11,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:12,020 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-04 07:53:12,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:12,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332883818] [2025-03-04 07:53:12,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332883818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:53:12,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318108927] [2025-03-04 07:53:12,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:12,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:12,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:53:12,022 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-04 07:53:12,023 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-04 07:53:12,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:53:12,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:53:12,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:12,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:12,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-04 07:53:12,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:53:12,137 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-04 07:53:12,144 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-04 07:53:12,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:53:12,186 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:53:12,186 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-04 07:53:12,216 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-04 07:53:12,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:53:12,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-04 07:53:12,349 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-04 07:53:12,359 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-04 07:53:12,369 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:53:12,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:53:12,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:53:12,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:53:12,454 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 16 treesize of output 8 [2025-03-04 07:53:12,523 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-04 07:53:12,529 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-04 07:53:12,540 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-04 07:53:12,579 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-04 07:53:12,623 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:53:12,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-04 07:53:12,690 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2025-03-04 07:53:12,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 32 [2025-03-04 07:53:12,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:12,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2025-03-04 07:53:12,992 INFO L349 Elim1Store]: treesize reduction 76, result has 52.2 percent of original size [2025-03-04 07:53:12,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 69 treesize of output 119 [2025-03-04 07:53:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:13,263 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:53:13,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318108927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:13,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:53:13,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [17] total 35 [2025-03-04 07:53:13,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183606711] [2025-03-04 07:53:13,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:13,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 07:53:13,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:13,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 07:53:13,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1068, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 07:53:13,264 INFO L87 Difference]: Start difference. First operand 192 states and 232 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:14,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:14,334 INFO L93 Difference]: Finished difference Result 283 states and 334 transitions. [2025-03-04 07:53:14,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 07:53:14,335 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-04 07:53:14,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:14,335 INFO L225 Difference]: With dead ends: 283 [2025-03-04 07:53:14,335 INFO L226 Difference]: Without dead ends: 281 [2025-03-04 07:53:14,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=260, Invalid=1996, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 07:53:14,336 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 236 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:14,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 826 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 07:53:14,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-04 07:53:14,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 210. [2025-03-04 07:53:14,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 177 states have (on average 1.4180790960451977) internal successors, (251), 208 states have internal predecessors, (251), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:14,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 253 transitions. [2025-03-04 07:53:14,340 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 253 transitions. Word has length 37 [2025-03-04 07:53:14,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:14,340 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 253 transitions. [2025-03-04 07:53:14,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:14,340 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 253 transitions. [2025-03-04 07:53:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 07:53:14,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:14,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:14,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:53:14,545 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,SelfDestructingSolverStorable15 [2025-03-04 07:53:14,545 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:53:14,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:14,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1305402149, now seen corresponding path program 1 times [2025-03-04 07:53:14,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:14,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971771745] [2025-03-04 07:53:14,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:14,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:14,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:53:14,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:53:14,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:14,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:14,971 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-04 07:53:14,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:14,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971771745] [2025-03-04 07:53:14,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971771745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:53:14,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098992046] [2025-03-04 07:53:14,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:14,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:14,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:53:14,974 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-04 07:53:14,976 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-04 07:53:15,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:53:15,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:53:15,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:15,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:15,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 07:53:15,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:53:15,088 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-04 07:53:15,109 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:53:15,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:53:15,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:53:15,212 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:53:15,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 07:53:15,235 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:53:15,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 07:53:15,267 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:53:15,268 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-04 07:53:15,312 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-03-04 07:53:15,312 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 1 case distinctions, treesize of input 39 treesize of output 19 [2025-03-04 07:53:15,440 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-03-04 07:53:15,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 43 [2025-03-04 07:53:15,450 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 12 treesize of output 8 [2025-03-04 07:53:15,506 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-03-04 07:53:15,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 50 [2025-03-04 07:53:15,551 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-03-04 07:53:15,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 50 [2025-03-04 07:53:15,569 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-04 07:53:15,651 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-04 07:53:15,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 22 [2025-03-04 07:53:15,716 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 24 treesize of output 12 [2025-03-04 07:53:15,723 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-04 07:53:15,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:53:15,878 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_60| Int) (v_ArrVal_1113 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~bcki~0#1.offset_60| 0) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1113) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_60|) 0)) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_60|))) is different from false [2025-03-04 07:53:16,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:16,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 07:53:16,148 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_60| Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1113 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_3 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~bcki~0#1.offset_60| 0) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_3) .cse0 v_ArrVal_1113) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_60|) 0)) (not (= (select |c_#valid| .cse0) 0)) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_60|)))) is different from false [2025-03-04 07:53:16,161 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_60| Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1113 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_3 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~bcki~0#1.offset_60| 0) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_arrayElimArr_3) .cse0 v_ArrVal_1113) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_60|) 0)) (not (= (select |c_#valid| .cse0) 0)) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_60|)))) is different from false [2025-03-04 07:53:16,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:16,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-04 07:53:16,185 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:53:16,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:16,192 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 33 treesize of output 33 [2025-03-04 07:53:16,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:16,202 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 29 treesize of output 33 [2025-03-04 07:53:16,213 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:53:16,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-03-04 07:53:16,323 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-04 07:53:16,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098992046] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:53:16,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:53:16,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 38 [2025-03-04 07:53:16,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748496903] [2025-03-04 07:53:16,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:53:16,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-04 07:53:16,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:16,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 07:53:16,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1003, Unknown=13, NotChecked=204, Total=1406 [2025-03-04 07:53:16,324 INFO L87 Difference]: Start difference. First operand 210 states and 253 transitions. Second operand has 38 states, 38 states have (on average 2.526315789473684) internal successors, (96), 38 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:17,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:17,350 INFO L93 Difference]: Finished difference Result 253 states and 312 transitions. [2025-03-04 07:53:17,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 07:53:17,350 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.526315789473684) internal successors, (96), 38 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-04 07:53:17,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:17,351 INFO L225 Difference]: With dead ends: 253 [2025-03-04 07:53:17,351 INFO L226 Difference]: Without dead ends: 253 [2025-03-04 07:53:17,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=312, Invalid=1757, Unknown=13, NotChecked=270, Total=2352 [2025-03-04 07:53:17,352 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 85 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 15 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 419 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:17,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1188 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1164 Invalid, 4 Unknown, 419 Unchecked, 0.7s Time] [2025-03-04 07:53:17,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-04 07:53:17,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 219. [2025-03-04 07:53:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 186 states have (on average 1.3978494623655915) internal successors, (260), 217 states have internal predecessors, (260), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 262 transitions. [2025-03-04 07:53:17,363 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 262 transitions. Word has length 38 [2025-03-04 07:53:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:17,364 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 262 transitions. [2025-03-04 07:53:17,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.526315789473684) internal successors, (96), 38 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:17,364 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 262 transitions. [2025-03-04 07:53:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 07:53:17,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:17,364 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:17,372 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-04 07:53:17,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:17,565 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:53:17,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:17,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1305400517, now seen corresponding path program 1 times [2025-03-04 07:53:17,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:17,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397060669] [2025-03-04 07:53:17,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:17,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:17,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:53:17,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:53:17,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:17,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:18,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:18,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397060669] [2025-03-04 07:53:18,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397060669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:53:18,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158770855] [2025-03-04 07:53:18,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:18,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:18,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:53:18,091 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-04 07:53:18,093 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-04 07:53:18,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:53:18,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:53:18,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:18,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:18,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 07:53:18,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:53:18,208 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-04 07:53:18,233 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 07:53:18,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 07:53:18,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:53:18,365 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:53:18,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2025-03-04 07:53:18,383 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:53:18,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2025-03-04 07:53:18,419 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2025-03-04 07:53:18,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2025-03-04 07:53:18,487 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-03-04 07:53:18,487 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 1 case distinctions, treesize of input 52 treesize of output 28 [2025-03-04 07:53:18,650 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-03-04 07:53:18,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 55 [2025-03-04 07:53:18,679 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-03-04 07:53:18,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 55 [2025-03-04 07:53:18,713 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 07:53:18,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 64 [2025-03-04 07:53:18,889 INFO L349 Elim1Store]: treesize reduction 66, result has 24.1 percent of original size [2025-03-04 07:53:18,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 46 [2025-03-04 07:53:19,154 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 07:53:19,154 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 29 [2025-03-04 07:53:19,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-04 07:53:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:19,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:53:19,500 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_67| Int) (v_ArrVal_1260 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~bcki~0#1.offset_67| 0) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_67|) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1260) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_67|) |c_ULTIMATE.start_main_~bucket~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_67| Int) (v_ArrVal_1260 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~bcki~0#1.offset_67| 0) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_67|) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1260) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_67|)) 1)))) is different from false [2025-03-04 07:53:19,553 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_67| Int) (v_ArrVal_1260 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~bcki~0#1.offset_67| 0) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_67|) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1260) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_67|)) 1))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_67| Int) (v_ArrVal_1260 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1260) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_67|) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_67| 0) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_67|)))) is different from false [2025-03-04 07:53:19,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:19,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 07:53:19,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:19,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-04 07:53:22,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:22,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2025-03-04 07:53:22,619 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:53:22,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:22,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2025-03-04 07:53:22,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:22,634 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 40 treesize of output 40 [2025-03-04 07:53:22,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:22,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-04 07:53:22,711 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:53:22,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:22,722 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 33 treesize of output 33 [2025-03-04 07:53:22,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:22,730 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 29 treesize of output 33 [2025-03-04 07:53:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:35,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158770855] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:53:35,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:53:35,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 45 [2025-03-04 07:53:35,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976632362] [2025-03-04 07:53:35,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:53:35,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 07:53:35,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:35,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 07:53:35,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1623, Unknown=20, NotChecked=170, Total=2070 [2025-03-04 07:53:35,578 INFO L87 Difference]: Start difference. First operand 219 states and 262 transitions. Second operand has 46 states, 45 states have (on average 2.3333333333333335) internal successors, (105), 46 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:39,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:39,760 INFO L93 Difference]: Finished difference Result 248 states and 293 transitions. [2025-03-04 07:53:39,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 07:53:39,760 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.3333333333333335) internal successors, (105), 46 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-04 07:53:39,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:39,761 INFO L225 Difference]: With dead ends: 248 [2025-03-04 07:53:39,761 INFO L226 Difference]: Without dead ends: 248 [2025-03-04 07:53:39,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=343, Invalid=2193, Unknown=22, NotChecked=198, Total=2756 [2025-03-04 07:53:39,762 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 223 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:39,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 866 Invalid, 1720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1350 Invalid, 1 Unknown, 346 Unchecked, 1.5s Time] [2025-03-04 07:53:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-04 07:53:39,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 220. [2025-03-04 07:53:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 187 states have (on average 1.4010695187165776) internal successors, (262), 218 states have internal predecessors, (262), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 264 transitions. [2025-03-04 07:53:39,765 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 264 transitions. Word has length 38 [2025-03-04 07:53:39,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:39,765 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 264 transitions. [2025-03-04 07:53:39,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.3333333333333335) internal successors, (105), 46 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 264 transitions. [2025-03-04 07:53:39,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 07:53:39,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:39,766 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:39,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:53:39,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 07:53:39,967 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:53:39,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:39,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1305400516, now seen corresponding path program 1 times [2025-03-04 07:53:39,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:39,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768346053] [2025-03-04 07:53:39,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:39,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:39,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:53:39,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:53:39,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:39,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:40,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:40,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768346053] [2025-03-04 07:53:40,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768346053] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:53:40,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773374295] [2025-03-04 07:53:40,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:40,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:40,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:53:40,612 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-04 07:53:40,613 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-04 07:53:40,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:53:40,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:53:40,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:40,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:40,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-04 07:53:40,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:53:40,740 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-04 07:53:40,757 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-04 07:53:40,769 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:53:40,770 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-04 07:53:40,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:53:40,806 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-04 07:53:40,957 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:53:40,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2025-03-04 07:53:40,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:53:40,977 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-04 07:53:40,997 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:53:40,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-04 07:53:41,018 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:53:41,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2025-03-04 07:53:41,060 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:53:41,060 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-04 07:53:41,080 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2025-03-04 07:53:41,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 26 [2025-03-04 07:53:41,144 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-04 07:53:41,145 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 1 case distinctions, treesize of input 23 treesize of output 19 [2025-03-04 07:53:41,168 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-03-04 07:53:41,168 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 1 case distinctions, treesize of input 40 treesize of output 20 [2025-03-04 07:53:41,390 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-03-04 07:53:41,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 73 [2025-03-04 07:53:41,409 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-04 07:53:41,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2025-03-04 07:53:41,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-04 07:53:41,429 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 19 treesize of output 13 [2025-03-04 07:53:41,548 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-03-04 07:53:41,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 86 [2025-03-04 07:53:41,573 INFO L349 Elim1Store]: treesize reduction 36, result has 39.0 percent of original size [2025-03-04 07:53:41,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 75 [2025-03-04 07:53:41,601 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 19 treesize of output 13 [2025-03-04 07:53:41,618 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-04 07:53:41,684 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-03-04 07:53:41,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 86 [2025-03-04 07:53:41,714 INFO L349 Elim1Store]: treesize reduction 36, result has 39.0 percent of original size [2025-03-04 07:53:41,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 75 [2025-03-04 07:53:41,743 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-04 07:53:41,765 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 23 treesize of output 17 [2025-03-04 07:53:42,003 INFO L349 Elim1Store]: treesize reduction 66, result has 24.1 percent of original size [2025-03-04 07:53:42,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 56 [2025-03-04 07:53:42,017 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-03-04 07:53:42,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 54 [2025-03-04 07:53:42,300 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 07:53:42,300 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 39 [2025-03-04 07:53:42,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-03-04 07:53:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:42,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:53:43,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:43,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2025-03-04 07:53:43,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:43,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 43 [2025-03-04 07:53:43,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:43,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2025-03-04 07:53:43,274 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1417 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_74| Int) (v_ArrVal_1416 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_9 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_10) .cse0 v_ArrVal_1417) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_74|) 7) (select (store |c_#length| .cse0 12) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_9) .cse0 v_ArrVal_1416) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_74|))) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_74| 0) (not (= (select |c_#valid| .cse0) 0)) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_74|) (not (= (select v_arrayElimArr_10 |ULTIMATE.start_main_~bcki~0#1.offset|) 0))))) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_1417 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_74| Int) (|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_21| Int)) (or (< |v_ULTIMATE.start_main_~bcki~0#1.offset_74| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_21|) 0)) (< 0 (+ 5 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_#t~malloc4#1.base_21| v_ArrVal_1417) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_74|))) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_74|) (not (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|) 0))))) is different from false [2025-03-04 07:53:43,339 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1417 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_74| Int) (v_ArrVal_1416 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_9 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_10) .cse0 v_ArrVal_1417) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_74|) 7) (select (store |c_#length| .cse0 12) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_9) .cse0 v_ArrVal_1416) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_74|))) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_74| 0) (not (= (select |c_#valid| .cse0) 0)) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_74|) (not (= (select v_arrayElimArr_10 |ULTIMATE.start_main_~bcki~0#1.offset|) 0))))) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_1417 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_74| Int) (|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_21| Int)) (or (< 0 (+ 5 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_#t~malloc4#1.base_21| v_ArrVal_1417) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_74|))) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_74| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_21|) 0)) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_74|) (not (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|) 0))))) is different from false [2025-03-04 07:53:43,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:43,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 109 [2025-03-04 07:53:43,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:43,555 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 100 treesize of output 101 [2025-03-04 07:53:43,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:43,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 252 treesize of output 264 [2025-03-04 07:53:43,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:43,606 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 550 treesize of output 538 [2025-03-04 07:53:43,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:43,629 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 193 treesize of output 182 [2025-03-04 07:53:43,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:43,644 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 173 treesize of output 178 [2025-03-04 07:53:43,652 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 169 treesize of output 165 [2025-03-04 07:53:43,659 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 165 treesize of output 161 [2025-03-04 07:53:43,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:43,684 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 168 treesize of output 186 [2025-03-04 07:53:43,697 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 157 treesize of output 153 [2025-03-04 07:53:43,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:43,711 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 153 treesize of output 158 [2025-03-04 07:53:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:44,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773374295] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:53:44,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:53:44,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 44 [2025-03-04 07:53:44,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34866598] [2025-03-04 07:53:44,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:53:44,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-04 07:53:44,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:44,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-04 07:53:44,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1595, Unknown=5, NotChecked=166, Total=1980 [2025-03-04 07:53:44,277 INFO L87 Difference]: Start difference. First operand 220 states and 264 transitions. Second operand has 45 states, 44 states have (on average 2.522727272727273) internal successors, (111), 45 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:02,646 INFO L93 Difference]: Finished difference Result 255 states and 306 transitions. [2025-03-04 07:54:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 07:54:02,647 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.522727272727273) internal successors, (111), 45 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-04 07:54:02,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:02,647 INFO L225 Difference]: With dead ends: 255 [2025-03-04 07:54:02,647 INFO L226 Difference]: Without dead ends: 255 [2025-03-04 07:54:02,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=414, Invalid=3004, Unknown=12, NotChecked=230, Total=3660 [2025-03-04 07:54:02,648 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 237 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 40 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 320 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:02,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1136 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1547 Invalid, 10 Unknown, 320 Unchecked, 2.0s Time] [2025-03-04 07:54:02,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-04 07:54:02,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 243. [2025-03-04 07:54:02,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 213 states have (on average 1.403755868544601) internal successors, (299), 241 states have internal predecessors, (299), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:02,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 301 transitions. [2025-03-04 07:54:02,652 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 301 transitions. Word has length 38 [2025-03-04 07:54:02,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:02,652 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 301 transitions. [2025-03-04 07:54:02,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.522727272727273) internal successors, (111), 45 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 301 transitions. [2025-03-04 07:54:02,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 07:54:02,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:02,653 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:02,659 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-04 07:54:02,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:02,855 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-03-04 07:54:02,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:02,855 INFO L85 PathProgramCache]: Analyzing trace with hash 166034142, now seen corresponding path program 1 times [2025-03-04 07:54:02,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:02,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85308199] [2025-03-04 07:54:02,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:02,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:02,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:54:02,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:54:02,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:02,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:03,659 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-04 07:54:03,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:54:03,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85308199] [2025-03-04 07:54:03,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85308199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:54:03,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381653241] [2025-03-04 07:54:03,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:03,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:03,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:03,661 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-04 07:54:03,662 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-04 07:54:03,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:54:03,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:54:03,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:03,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:03,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-04 07:54:03,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:03,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-04 07:54:03,797 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-04 07:54:03,819 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 07:54:03,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 07:54:03,861 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-04 07:54:03,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:54:04,028 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:54:04,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 31 [2025-03-04 07:54:04,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:54:04,040 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-04 07:54:04,061 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:54:04,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 31 [2025-03-04 07:54:04,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:54:04,072 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-04 07:54:04,114 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2025-03-04 07:54:04,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2025-03-04 07:54:04,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 07:54:04,212 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:54:04,212 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-04 07:54:04,245 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-03-04 07:54:04,245 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 1 case distinctions, treesize of input 61 treesize of output 33 [2025-03-04 07:54:04,489 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-03-04 07:54:04,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 62 [2025-03-04 07:54:04,522 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:54:04,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-04 07:54:04,588 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-03-04 07:54:04,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 62 [2025-03-04 07:54:04,616 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:54:04,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-04 07:54:04,697 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 07:54:04,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 83 [2025-03-04 07:54:04,703 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 32 treesize of output 11 [2025-03-04 07:54:04,858 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-03-04 07:54:04,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2025-03-04 07:54:04,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 07:54:04,938 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-04 07:54:04,953 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-03-04 07:54:04,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 49 [2025-03-04 07:54:05,040 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-03-04 07:54:05,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 49 [2025-03-04 07:54:05,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:54:05,440 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 07:54:05,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 28 [2025-03-04 07:54:05,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-03-04 07:54:05,562 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-04 07:54:05,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:54:06,491 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1590 Int) (v_ArrVal_1589 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~item~0#1.base_62| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_62|) 0)) (forall ((v_ArrVal_1594 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_81| Int)) (or (< |v_ULTIMATE.start_main_~bcki~0#1.offset_81| 0) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_81|) (< (select (store |c_#length| |v_ULTIMATE.start_main_~item~0#1.base_62| v_ArrVal_1590) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_81| 12)) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1589) |v_ULTIMATE.start_main_~item~0#1.base_62| v_ArrVal_1594) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_81|) 9)))))) (< 8 v_ArrVal_1590))) (forall ((v_ArrVal_1590 Int) (v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1588 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~item~0#1.base_62| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_62|) 0)) (forall ((v_ArrVal_1594 (Array Int Int)) (v_ArrVal_1593 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_81| Int)) (let ((.cse0 (store |c_#length| |v_ULTIMATE.start_main_~item~0#1.base_62| v_ArrVal_1590))) (or (< |v_ULTIMATE.start_main_~bcki~0#1.offset_81| 0) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_81|) (< (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_81| 12)) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1589) |v_ULTIMATE.start_main_~item~0#1.base_62| v_ArrVal_1594) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_81|) 11) (select .cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1588) |v_ULTIMATE.start_main_~item~0#1.base_62| v_ArrVal_1593) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)))))))) (< 8 v_ArrVal_1590)))) is different from false [2025-03-04 07:54:08,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:08,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46