./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/dll-lst-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/dll-lst-shared.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6f8708414d69d58e69308ef3f6436b82a3a2ac306b0f68b7007fd3139e12ef15 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:30:58,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:30:58,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-09 22:30:58,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:30:58,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:30:58,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:30:58,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:30:58,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:30:58,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:30:58,375 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:30:58,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:30:58,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:30:58,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:30:58,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:30:58,375 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:30:58,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:30:58,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:30:58,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:30:58,375 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:30:58,375 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:30:58,376 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:30:58,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:30:58,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:30:58,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:30:58,377 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f8708414d69d58e69308ef3f6436b82a3a2ac306b0f68b7007fd3139e12ef15 [2025-01-09 22:30:58,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:30:58,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:30:58,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:30:58,626 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:30:58,627 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:30:58,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/dll-lst-shared.i [2025-01-09 22:30:59,898 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/133dd70e0/ed83f46b7f554344bd1512331de3842d/FLAG65d817e85 [2025-01-09 22:31:00,271 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:31:00,273 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-lst-shared.i [2025-01-09 22:31:00,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/133dd70e0/ed83f46b7f554344bd1512331de3842d/FLAG65d817e85 [2025-01-09 22:31:00,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/133dd70e0/ed83f46b7f554344bd1512331de3842d [2025-01-09 22:31:00,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:31:00,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:31:00,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:31:00,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:31:00,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:31:00,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:31:00" (1/1) ... [2025-01-09 22:31:00,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32cc897d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:00, skipping insertion in model container [2025-01-09 22:31:00,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:31:00" (1/1) ... [2025-01-09 22:31:00,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:31:00,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:31:00,776 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:31:00,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:31:00,820 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:31:00,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:00 WrapperNode [2025-01-09 22:31:00,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:31:00,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:31:00,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:31:00,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:31:00,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:00" (1/1) ... [2025-01-09 22:31:00,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:00" (1/1) ... [2025-01-09 22:31:00,846 INFO L138 Inliner]: procedures = 121, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 71 [2025-01-09 22:31:00,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:31:00,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:31:00,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:31:00,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:31:00,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:00" (1/1) ... [2025-01-09 22:31:00,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:00" (1/1) ... [2025-01-09 22:31:00,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:00" (1/1) ... [2025-01-09 22:31:00,878 INFO L175 MemorySlicer]: Split 14 memory accesses to 1 slices as follows [14]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 7 writes are split as follows [7]. [2025-01-09 22:31:00,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:00" (1/1) ... [2025-01-09 22:31:00,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:00" (1/1) ... [2025-01-09 22:31:00,882 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:00" (1/1) ... [2025-01-09 22:31:00,883 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:00" (1/1) ... [2025-01-09 22:31:00,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:00" (1/1) ... [2025-01-09 22:31:00,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:00" (1/1) ... [2025-01-09 22:31:00,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:00" (1/1) ... [2025-01-09 22:31:00,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:31:00,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:31:00,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:31:00,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:31:00,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:00" (1/1) ... [2025-01-09 22:31:00,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:31:00,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:00,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:31:00,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:31:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:31:00,931 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-01-09 22:31:00,931 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-01-09 22:31:00,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:31:00,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:31:00,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:31:00,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:31:00,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:31:00,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:31:00,999 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:31:01,000 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:31:01,201 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2025-01-09 22:31:01,201 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:31:01,208 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:31:01,210 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 22:31:01,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:31:01 BoogieIcfgContainer [2025-01-09 22:31:01,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:31:01,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:31:01,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:31:01,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:31:01,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:31:00" (1/3) ... [2025-01-09 22:31:01,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac1ff71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:31:01, skipping insertion in model container [2025-01-09 22:31:01,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:00" (2/3) ... [2025-01-09 22:31:01,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac1ff71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:31:01, skipping insertion in model container [2025-01-09 22:31:01,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:31:01" (3/3) ... [2025-01-09 22:31:01,219 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-lst-shared.i [2025-01-09 22:31:01,229 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:31:01,231 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-lst-shared.i that has 2 procedures, 85 locations, 1 initial locations, 3 loop locations, and 35 error locations. [2025-01-09 22:31:01,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:31:01,274 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;@34cc8655, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:31:01,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-01-09 22:31:01,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 81 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:31:01,280 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:01,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:31:01,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:01,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:01,286 INFO L85 PathProgramCache]: Analyzing trace with hash 37378097, now seen corresponding path program 1 times [2025-01-09 22:31:01,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:01,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978299170] [2025-01-09 22:31:01,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:01,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:01,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:31:01,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:31:01,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:01,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:01,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:01,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978299170] [2025-01-09 22:31:01,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978299170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:01,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:01,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:31:01,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841072087] [2025-01-09 22:31:01,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:01,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:31:01,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:01,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:31:01,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:31:01,442 INFO L87 Difference]: Start difference. First operand has 85 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 81 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:31:01,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:01,518 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2025-01-09 22:31:01,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:31:01,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 22:31:01,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:01,524 INFO L225 Difference]: With dead ends: 83 [2025-01-09 22:31:01,524 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 22:31:01,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:31:01,527 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:01,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 130 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:01,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 22:31:01,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 22:31:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.8) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2025-01-09 22:31:01,551 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 5 [2025-01-09 22:31:01,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:01,551 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2025-01-09 22:31:01,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:31:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2025-01-09 22:31:01,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:31:01,551 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:01,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:31:01,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:31:01,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:01,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:01,552 INFO L85 PathProgramCache]: Analyzing trace with hash 37378098, now seen corresponding path program 1 times [2025-01-09 22:31:01,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:01,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567435939] [2025-01-09 22:31:01,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:01,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:01,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:31:01,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:31:01,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:01,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:01,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:01,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:01,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567435939] [2025-01-09 22:31:01,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567435939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:01,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:01,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:31:01,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360407383] [2025-01-09 22:31:01,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:01,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:31:01,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:01,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:31:01,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:31:01,661 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:31:01,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:01,699 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2025-01-09 22:31:01,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:31:01,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 22:31:01,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:01,700 INFO L225 Difference]: With dead ends: 79 [2025-01-09 22:31:01,700 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 22:31:01,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:31:01,700 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:01,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:31:01,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 22:31:01,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-01-09 22:31:01,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 75 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:01,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2025-01-09 22:31:01,705 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 5 [2025-01-09 22:31:01,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:01,705 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2025-01-09 22:31:01,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:31:01,705 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2025-01-09 22:31:01,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:31:01,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:01,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:01,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:31:01,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:01,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:01,706 INFO L85 PathProgramCache]: Analyzing trace with hash 92196737, now seen corresponding path program 1 times [2025-01-09 22:31:01,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:01,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764530822] [2025-01-09 22:31:01,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:01,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:01,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:31:01,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:31:01,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:01,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:01,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:01,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:01,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764530822] [2025-01-09 22:31:01,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764530822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:01,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:01,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:31:01,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849729631] [2025-01-09 22:31:01,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:01,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:31:01,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:01,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:31:01,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:31:01,842 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:01,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:01,893 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2025-01-09 22:31:01,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:31:01,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-01-09 22:31:01,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:01,895 INFO L225 Difference]: With dead ends: 83 [2025-01-09 22:31:01,895 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 22:31:01,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:31:01,896 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 9 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:01,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 126 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:31:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 22:31:01,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2025-01-09 22:31:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:01,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2025-01-09 22:31:01,901 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 11 [2025-01-09 22:31:01,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:01,901 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2025-01-09 22:31:01,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:01,901 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2025-01-09 22:31:01,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:31:01,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:01,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:01,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:31:01,901 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:01,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:01,902 INFO L85 PathProgramCache]: Analyzing trace with hash 92196736, now seen corresponding path program 1 times [2025-01-09 22:31:01,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:01,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518015218] [2025-01-09 22:31:01,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:01,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:01,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:31:01,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:31:01,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:01,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:01,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:01,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518015218] [2025-01-09 22:31:01,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518015218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:01,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:01,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:31:01,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435251004] [2025-01-09 22:31:01,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:01,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:31:01,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:01,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:31:01,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:31:01,965 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:02,021 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2025-01-09 22:31:02,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:31:02,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-01-09 22:31:02,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:02,022 INFO L225 Difference]: With dead ends: 82 [2025-01-09 22:31:02,022 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 22:31:02,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:31:02,022 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 9 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:02,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 120 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:02,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 22:31:02,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2025-01-09 22:31:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.711111111111111) internal successors, (77), 73 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2025-01-09 22:31:02,026 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 11 [2025-01-09 22:31:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:02,026 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2025-01-09 22:31:02,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:02,027 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2025-01-09 22:31:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:31:02,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:02,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:02,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:31:02,027 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:02,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:02,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1593250335, now seen corresponding path program 1 times [2025-01-09 22:31:02,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:02,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031550042] [2025-01-09 22:31:02,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:02,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:02,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:31:02,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:31:02,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:02,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:02,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:02,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031550042] [2025-01-09 22:31:02,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031550042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:02,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:02,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:31:02,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894516869] [2025-01-09 22:31:02,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:02,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:31:02,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:02,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:31:02,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:02,161 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:02,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:02,269 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2025-01-09 22:31:02,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:31:02,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-01-09 22:31:02,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:02,270 INFO L225 Difference]: With dead ends: 78 [2025-01-09 22:31:02,270 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 22:31:02,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:02,271 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:02,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 235 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:02,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 22:31:02,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2025-01-09 22:31:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2025-01-09 22:31:02,274 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 13 [2025-01-09 22:31:02,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:02,274 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2025-01-09 22:31:02,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:02,274 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2025-01-09 22:31:02,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:31:02,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:02,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:02,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:31:02,275 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:02,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:02,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1593250334, now seen corresponding path program 1 times [2025-01-09 22:31:02,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:02,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452947784] [2025-01-09 22:31:02,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:02,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:02,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:31:02,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:31:02,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:02,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:02,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:02,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452947784] [2025-01-09 22:31:02,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452947784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:02,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:02,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:31:02,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914541472] [2025-01-09 22:31:02,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:02,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:31:02,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:02,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:31:02,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:02,488 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:02,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:02,595 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2025-01-09 22:31:02,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:31:02,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-01-09 22:31:02,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:02,596 INFO L225 Difference]: With dead ends: 77 [2025-01-09 22:31:02,596 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 22:31:02,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:02,597 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 5 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:02,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 219 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:02,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 22:31:02,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2025-01-09 22:31:02,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 45 states have (on average 1.6) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2025-01-09 22:31:02,603 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 13 [2025-01-09 22:31:02,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:02,604 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2025-01-09 22:31:02,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2025-01-09 22:31:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:31:02,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:02,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:02,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:31:02,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:02,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:02,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1409207529, now seen corresponding path program 1 times [2025-01-09 22:31:02,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:02,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602515958] [2025-01-09 22:31:02,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:02,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:02,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:31:02,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:31:02,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:02,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:02,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:02,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:02,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602515958] [2025-01-09 22:31:02,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602515958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:02,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:02,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:31:02,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549156503] [2025-01-09 22:31:02,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:02,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:31:02,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:02,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:31:02,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:31:02,704 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:02,826 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2025-01-09 22:31:02,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:31:02,827 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-01-09 22:31:02,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:02,827 INFO L225 Difference]: With dead ends: 101 [2025-01-09 22:31:02,827 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 22:31:02,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:02,828 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 42 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:02,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 220 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:02,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 22:31:02,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2025-01-09 22:31:02,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 86 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2025-01-09 22:31:02,837 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 19 [2025-01-09 22:31:02,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:02,837 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2025-01-09 22:31:02,837 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:02,837 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2025-01-09 22:31:02,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:31:02,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:02,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:02,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:31:02,838 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:02,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:02,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1409207530, now seen corresponding path program 1 times [2025-01-09 22:31:02,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:02,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43799157] [2025-01-09 22:31:02,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:02,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:02,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:31:02,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:31:02,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:02,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:03,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:03,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:03,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43799157] [2025-01-09 22:31:03,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43799157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:03,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:03,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:31:03,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027785616] [2025-01-09 22:31:03,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:03,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:31:03,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:03,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:31:03,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:31:03,046 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:03,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:03,187 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2025-01-09 22:31:03,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:31:03,188 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-01-09 22:31:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:03,188 INFO L225 Difference]: With dead ends: 109 [2025-01-09 22:31:03,189 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 22:31:03,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:31:03,190 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 42 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:03,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 389 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:03,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 22:31:03,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2025-01-09 22:31:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.6231884057971016) internal successors, (112), 92 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2025-01-09 22:31:03,197 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 19 [2025-01-09 22:31:03,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:03,197 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2025-01-09 22:31:03,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:03,197 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2025-01-09 22:31:03,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:31:03,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:03,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:03,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:31:03,198 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:03,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:03,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1334108715, now seen corresponding path program 1 times [2025-01-09 22:31:03,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:03,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280930980] [2025-01-09 22:31:03,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:03,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:03,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:31:03,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:31:03,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:03,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:03,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:03,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280930980] [2025-01-09 22:31:03,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280930980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:03,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:03,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:31:03,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260727543] [2025-01-09 22:31:03,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:03,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:31:03,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:03,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:31:03,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:31:03,295 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:03,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:03,334 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2025-01-09 22:31:03,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:31:03,336 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-01-09 22:31:03,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:03,337 INFO L225 Difference]: With dead ends: 106 [2025-01-09 22:31:03,337 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 22:31:03,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:31:03,338 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 26 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:03,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 426 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:31:03,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 22:31:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2025-01-09 22:31:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.6) internal successors, (112), 93 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2025-01-09 22:31:03,341 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 21 [2025-01-09 22:31:03,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:03,342 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2025-01-09 22:31:03,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2025-01-09 22:31:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:31:03,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:03,342 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:03,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:31:03,342 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:03,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:03,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1766568833, now seen corresponding path program 1 times [2025-01-09 22:31:03,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:03,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350702180] [2025-01-09 22:31:03,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:03,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:03,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:31:03,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:31:03,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:03,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:03,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:03,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:03,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350702180] [2025-01-09 22:31:03,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350702180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:03,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:03,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:31:03,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583538236] [2025-01-09 22:31:03,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:03,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:31:03,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:03,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:31:03,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:03,469 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:03,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:03,586 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2025-01-09 22:31:03,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:31:03,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-01-09 22:31:03,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:03,587 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:31:03,587 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:31:03,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:03,587 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 14 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:03,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 237 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:03,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:31:03,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2025-01-09 22:31:03,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 93 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2025-01-09 22:31:03,590 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 23 [2025-01-09 22:31:03,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:03,590 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2025-01-09 22:31:03,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:03,591 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2025-01-09 22:31:03,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:31:03,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:03,591 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:03,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:31:03,596 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:03,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:03,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1766568832, now seen corresponding path program 1 times [2025-01-09 22:31:03,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:03,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278103995] [2025-01-09 22:31:03,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:03,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:03,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:31:03,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:31:03,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:03,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:03,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:03,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278103995] [2025-01-09 22:31:03,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278103995] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:03,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153335464] [2025-01-09 22:31:03,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:03,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:03,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:03,974 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:03,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:31:04,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:31:04,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:31:04,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:04,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:04,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 22:31:04,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:04,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:31:04,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:31:04,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:04,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:31:04,214 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:04,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:04,268 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-01-09 22:31:04,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:04,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:31:04,305 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:04,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2025-01-09 22:31:04,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:04,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153335464] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:04,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:31:04,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2025-01-09 22:31:04,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120859747] [2025-01-09 22:31:04,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:04,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:31:04,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:04,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:31:04,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2025-01-09 22:31:04,403 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand has 16 states, 15 states have (on average 2.2) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:31:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:04,639 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2025-01-09 22:31:04,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:31:04,640 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 23 [2025-01-09 22:31:04,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:04,640 INFO L225 Difference]: With dead ends: 104 [2025-01-09 22:31:04,640 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 22:31:04,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=288, Unknown=1, NotChecked=34, Total=380 [2025-01-09 22:31:04,641 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 15 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:04,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 340 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 322 Invalid, 0 Unknown, 91 Unchecked, 0.2s Time] [2025-01-09 22:31:04,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 22:31:04,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2025-01-09 22:31:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 93 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:04,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2025-01-09 22:31:04,644 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 23 [2025-01-09 22:31:04,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:04,644 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2025-01-09 22:31:04,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:31:04,645 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2025-01-09 22:31:04,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:31:04,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:04,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:04,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 22:31:04,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 22:31:04,849 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:04,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:04,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1603785155, now seen corresponding path program 1 times [2025-01-09 22:31:04,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:04,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187183348] [2025-01-09 22:31:04,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:04,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:04,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:31:04,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:31:04,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:04,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:04,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:04,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:04,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187183348] [2025-01-09 22:31:04,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187183348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:04,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:04,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:31:04,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432357442] [2025-01-09 22:31:04,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:04,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:31:04,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:04,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:31:04,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:31:04,919 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:05,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:05,013 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2025-01-09 22:31:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:31:05,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-09 22:31:05,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:05,014 INFO L225 Difference]: With dead ends: 108 [2025-01-09 22:31:05,014 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 22:31:05,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:05,015 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 31 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:05,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 233 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 22:31:05,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2025-01-09 22:31:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.5135135135135136) internal successors, (112), 97 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2025-01-09 22:31:05,018 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 22 [2025-01-09 22:31:05,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:05,018 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2025-01-09 22:31:05,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2025-01-09 22:31:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:31:05,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:05,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:05,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:31:05,019 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:05,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:05,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1603785154, now seen corresponding path program 1 times [2025-01-09 22:31:05,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:05,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756972336] [2025-01-09 22:31:05,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:05,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:05,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:31:05,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:31:05,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:05,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:05,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:05,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756972336] [2025-01-09 22:31:05,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756972336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:05,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:05,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:31:05,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099960970] [2025-01-09 22:31:05,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:05,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:31:05,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:05,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:31:05,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:31:05,267 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:05,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:05,425 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2025-01-09 22:31:05,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:31:05,425 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-09 22:31:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:05,426 INFO L225 Difference]: With dead ends: 109 [2025-01-09 22:31:05,426 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 22:31:05,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:31:05,427 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 8 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:05,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 354 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:05,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 22:31:05,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-01-09 22:31:05,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 104 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:05,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2025-01-09 22:31:05,433 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 22 [2025-01-09 22:31:05,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:05,433 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2025-01-09 22:31:05,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:05,433 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2025-01-09 22:31:05,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:31:05,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:05,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:05,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:31:05,434 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:05,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:05,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1617821015, now seen corresponding path program 1 times [2025-01-09 22:31:05,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:05,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663967620] [2025-01-09 22:31:05,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:05,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:05,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:31:05,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:31:05,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:05,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:31:05,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:05,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663967620] [2025-01-09 22:31:05,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663967620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:05,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:05,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:31:05,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520001396] [2025-01-09 22:31:05,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:05,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:31:05,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:05,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:31:05,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:05,523 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:31:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:05,619 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2025-01-09 22:31:05,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:31:05,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-01-09 22:31:05,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:05,620 INFO L225 Difference]: With dead ends: 108 [2025-01-09 22:31:05,620 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 22:31:05,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:31:05,620 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 8 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:05,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 249 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:05,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 22:31:05,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-01-09 22:31:05,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 103 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:05,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2025-01-09 22:31:05,623 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 26 [2025-01-09 22:31:05,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:05,623 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2025-01-09 22:31:05,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:31:05,623 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2025-01-09 22:31:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:31:05,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:05,624 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:05,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:31:05,624 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:05,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:05,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1617821014, now seen corresponding path program 1 times [2025-01-09 22:31:05,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:05,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973096259] [2025-01-09 22:31:05,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:05,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:05,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:31:05,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:31:05,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:05,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:05,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:05,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973096259] [2025-01-09 22:31:05,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973096259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:05,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:05,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:31:05,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432712256] [2025-01-09 22:31:05,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:05,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:31:05,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:05,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:31:05,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:05,774 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:31:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:05,861 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2025-01-09 22:31:05,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:31:05,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-01-09 22:31:05,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:05,862 INFO L225 Difference]: With dead ends: 107 [2025-01-09 22:31:05,862 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 22:31:05,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:31:05,862 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 3 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:05,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 283 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:05,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 22:31:05,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-01-09 22:31:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 102 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2025-01-09 22:31:05,865 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 26 [2025-01-09 22:31:05,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:05,865 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2025-01-09 22:31:05,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:31:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2025-01-09 22:31:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:31:05,866 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:05,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:05,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:31:05,866 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:05,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:05,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1242516977, now seen corresponding path program 1 times [2025-01-09 22:31:05,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:05,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139263958] [2025-01-09 22:31:05,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:05,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:05,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:31:05,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:31:05,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:05,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:05,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:05,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139263958] [2025-01-09 22:31:05,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139263958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:05,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:05,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:31:05,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181954103] [2025-01-09 22:31:05,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:05,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:31:05,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:05,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:31:05,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:05,923 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:06,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:06,052 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2025-01-09 22:31:06,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:31:06,052 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-01-09 22:31:06,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:06,053 INFO L225 Difference]: With dead ends: 116 [2025-01-09 22:31:06,053 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 22:31:06,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:31:06,054 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 42 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:06,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 206 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:06,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 22:31:06,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2025-01-09 22:31:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.430232558139535) internal successors, (123), 106 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:06,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2025-01-09 22:31:06,056 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 27 [2025-01-09 22:31:06,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:06,056 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2025-01-09 22:31:06,056 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:06,057 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2025-01-09 22:31:06,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:31:06,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:06,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:06,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:31:06,057 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:06,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:06,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1242516978, now seen corresponding path program 1 times [2025-01-09 22:31:06,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:06,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179490630] [2025-01-09 22:31:06,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:06,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:06,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:31:06,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:31:06,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:06,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:06,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:06,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179490630] [2025-01-09 22:31:06,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179490630] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:06,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427516805] [2025-01-09 22:31:06,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:06,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:06,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:06,174 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:06,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:31:06,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:31:06,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:31:06,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:06,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:06,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 22:31:06,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:06,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:06,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:06,441 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 19 treesize of output 23 [2025-01-09 22:31:06,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-01-09 22:31:06,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427516805] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:31:06,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:31:06,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2025-01-09 22:31:06,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814939372] [2025-01-09 22:31:06,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:06,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 22:31:06,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:06,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 22:31:06,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2025-01-09 22:31:06,661 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 25 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:31:07,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:07,004 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2025-01-09 22:31:07,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:31:07,004 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 25 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-01-09 22:31:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:07,005 INFO L225 Difference]: With dead ends: 121 [2025-01-09 22:31:07,005 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 22:31:07,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 22:31:07,006 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 120 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:07,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 709 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:07,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 22:31:07,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2025-01-09 22:31:07,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 109 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:07,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2025-01-09 22:31:07,009 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 27 [2025-01-09 22:31:07,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:07,009 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2025-01-09 22:31:07,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 25 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:31:07,009 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2025-01-09 22:31:07,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:31:07,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:07,009 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:07,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:31:07,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 22:31:07,210 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:07,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:07,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1617149799, now seen corresponding path program 1 times [2025-01-09 22:31:07,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:07,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722462398] [2025-01-09 22:31:07,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:07,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:07,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:31:07,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:31:07,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:07,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:07,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:07,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:07,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722462398] [2025-01-09 22:31:07,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722462398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:07,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:07,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:31:07,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154343450] [2025-01-09 22:31:07,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:07,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:31:07,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:07,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:31:07,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:31:07,483 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:07,643 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2025-01-09 22:31:07,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:31:07,643 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-01-09 22:31:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:07,644 INFO L225 Difference]: With dead ends: 115 [2025-01-09 22:31:07,644 INFO L226 Difference]: Without dead ends: 115 [2025-01-09 22:31:07,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:31:07,644 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 24 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:07,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 329 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:07,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-09 22:31:07,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-01-09 22:31:07,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 109 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2025-01-09 22:31:07,647 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 29 [2025-01-09 22:31:07,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:07,647 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2025-01-09 22:31:07,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:07,647 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2025-01-09 22:31:07,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:31:07,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:07,647 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:07,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:31:07,648 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:07,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:07,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1617149798, now seen corresponding path program 1 times [2025-01-09 22:31:07,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:07,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229453690] [2025-01-09 22:31:07,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:07,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:07,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:31:07,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:31:07,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:07,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:07,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:07,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229453690] [2025-01-09 22:31:07,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229453690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:07,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:07,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 22:31:07,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457289404] [2025-01-09 22:31:07,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:07,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:31:07,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:07,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:31:07,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:31:07,881 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:08,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:08,141 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2025-01-09 22:31:08,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:31:08,142 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-01-09 22:31:08,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:08,142 INFO L225 Difference]: With dead ends: 114 [2025-01-09 22:31:08,142 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 22:31:08,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:31:08,143 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 21 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:08,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 315 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:08,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 22:31:08,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-01-09 22:31:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 109 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:08,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2025-01-09 22:31:08,147 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 29 [2025-01-09 22:31:08,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:08,148 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2025-01-09 22:31:08,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:08,148 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2025-01-09 22:31:08,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:31:08,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:08,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:08,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 22:31:08,148 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:08,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:08,149 INFO L85 PathProgramCache]: Analyzing trace with hash -136679324, now seen corresponding path program 1 times [2025-01-09 22:31:08,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:08,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567444737] [2025-01-09 22:31:08,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:08,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:08,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:31:08,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:31:08,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:08,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:08,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:08,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567444737] [2025-01-09 22:31:08,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567444737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:08,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:08,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:31:08,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93008309] [2025-01-09 22:31:08,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:08,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:31:08,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:08,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:31:08,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:31:08,247 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:08,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:08,357 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2025-01-09 22:31:08,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:31:08,358 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-01-09 22:31:08,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:08,359 INFO L225 Difference]: With dead ends: 136 [2025-01-09 22:31:08,359 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 22:31:08,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:31:08,361 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 25 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:08,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 316 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:08,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 22:31:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2025-01-09 22:31:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.37) internal successors, (137), 119 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 143 transitions. [2025-01-09 22:31:08,366 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 143 transitions. Word has length 28 [2025-01-09 22:31:08,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:08,366 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 143 transitions. [2025-01-09 22:31:08,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2025-01-09 22:31:08,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:31:08,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:08,366 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:08,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 22:31:08,367 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:08,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:08,367 INFO L85 PathProgramCache]: Analyzing trace with hash -148161737, now seen corresponding path program 1 times [2025-01-09 22:31:08,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:08,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652682852] [2025-01-09 22:31:08,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:08,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:08,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:31:08,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:31:08,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:08,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:08,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:08,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652682852] [2025-01-09 22:31:08,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652682852] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:08,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891773572] [2025-01-09 22:31:08,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:08,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:08,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:08,805 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:08,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:31:08,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:31:08,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:31:08,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:08,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:08,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-01-09 22:31:08,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:08,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:31:08,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:31:08,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:31:08,934 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 0 case distinctions, treesize of input 23 treesize of output 22 [2025-01-09 22:31:08,942 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 22 [2025-01-09 22:31:09,052 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:09,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:09,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2025-01-09 22:31:09,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2025-01-09 22:31:09,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:09,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:09,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-01-09 22:31:09,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:09,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:09,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-01-09 22:31:09,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:09,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:09,461 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8))) (and (forall ((v_ArrVal_734 Int) (v_ArrVal_731 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_731))) (store .cse0 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_734))) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_732 (Array Int Int)) (|ULTIMATE.start_create_~data~0#1.offset| Int)) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_732))) (store .cse2 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data~0#1.offset|))) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 0)))) is different from false [2025-01-09 22:31:09,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:09,851 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 2 case distinctions, treesize of input 27 treesize of output 33 [2025-01-09 22:31:09,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:09,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 28 [2025-01-09 22:31:09,863 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-01-09 22:31:09,864 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 2 case distinctions, treesize of input 27 treesize of output 1 [2025-01-09 22:31:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:12,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891773572] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:31:12,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:31:12,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2025-01-09 22:31:12,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561986421] [2025-01-09 22:31:12,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:12,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 22:31:12,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:12,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 22:31:12,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=883, Unknown=9, NotChecked=60, Total=1056 [2025-01-09 22:31:12,358 INFO L87 Difference]: Start difference. First operand 124 states and 143 transitions. Second operand has 33 states, 33 states have (on average 1.878787878787879) internal successors, (62), 30 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:31:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:12,843 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2025-01-09 22:31:12,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:31:12,844 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.878787878787879) internal successors, (62), 30 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2025-01-09 22:31:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:12,844 INFO L225 Difference]: With dead ends: 120 [2025-01-09 22:31:12,845 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 22:31:12,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=151, Invalid=1326, Unknown=9, NotChecked=74, Total=1560 [2025-01-09 22:31:12,846 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 14 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:12,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 824 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 486 Invalid, 0 Unknown, 42 Unchecked, 0.3s Time] [2025-01-09 22:31:12,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 22:31:12,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 22:31:12,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 115 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2025-01-09 22:31:12,848 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 28 [2025-01-09 22:31:12,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:12,848 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2025-01-09 22:31:12,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.878787878787879) internal successors, (62), 30 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:31:12,849 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2025-01-09 22:31:12,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:31:12,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:12,849 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-01-09 22:31:12,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 22:31:13,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:13,053 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:13,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:13,054 INFO L85 PathProgramCache]: Analyzing trace with hash 57908369, now seen corresponding path program 1 times [2025-01-09 22:31:13,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:13,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51395547] [2025-01-09 22:31:13,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:13,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:13,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:31:13,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:31:13,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:13,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:13,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:13,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51395547] [2025-01-09 22:31:13,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51395547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:13,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:13,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:31:13,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581252680] [2025-01-09 22:31:13,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:13,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:31:13,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:13,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:31:13,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:31:13,158 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:13,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:13,292 INFO L93 Difference]: Finished difference Result 129 states and 148 transitions. [2025-01-09 22:31:13,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:31:13,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-01-09 22:31:13,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:13,294 INFO L225 Difference]: With dead ends: 129 [2025-01-09 22:31:13,294 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 22:31:13,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:31:13,295 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 23 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:13,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 264 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 22:31:13,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2025-01-09 22:31:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 116 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2025-01-09 22:31:13,298 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 29 [2025-01-09 22:31:13,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:13,298 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2025-01-09 22:31:13,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2025-01-09 22:31:13,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:31:13,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:13,298 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-01-09 22:31:13,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 22:31:13,299 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:13,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:13,299 INFO L85 PathProgramCache]: Analyzing trace with hash 58261825, now seen corresponding path program 1 times [2025-01-09 22:31:13,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:13,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900936253] [2025-01-09 22:31:13,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:13,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:13,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:31:13,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:31:13,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:13,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:13,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:13,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900936253] [2025-01-09 22:31:13,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900936253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:13,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:13,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:31:13,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997910239] [2025-01-09 22:31:13,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:13,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:31:13,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:13,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:31:13,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:31:13,364 INFO L87 Difference]: Start difference. First operand 121 states and 137 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:13,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:13,418 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2025-01-09 22:31:13,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:31:13,419 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-01-09 22:31:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:13,419 INFO L225 Difference]: With dead ends: 121 [2025-01-09 22:31:13,419 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 22:31:13,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:31:13,420 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 35 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:13,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 389 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:13,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 22:31:13,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2025-01-09 22:31:13,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 95 states have (on average 1.305263157894737) internal successors, (124), 114 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2025-01-09 22:31:13,422 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 29 [2025-01-09 22:31:13,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:13,423 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2025-01-09 22:31:13,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:13,423 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2025-01-09 22:31:13,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:31:13,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:13,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:13,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 22:31:13,424 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:13,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:13,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1795159558, now seen corresponding path program 1 times [2025-01-09 22:31:13,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:13,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427828998] [2025-01-09 22:31:13,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:13,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:13,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:31:13,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:31:13,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:13,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:13,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:13,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427828998] [2025-01-09 22:31:13,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427828998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:13,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:13,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:31:13,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406781507] [2025-01-09 22:31:13,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:13,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:31:13,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:13,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:31:13,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:31:13,533 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:13,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:13,655 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2025-01-09 22:31:13,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:31:13,656 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-01-09 22:31:13,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:13,656 INFO L225 Difference]: With dead ends: 120 [2025-01-09 22:31:13,656 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 22:31:13,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:31:13,657 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 20 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:13,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 279 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 22:31:13,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 22:31:13,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 115 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:13,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2025-01-09 22:31:13,663 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 30 [2025-01-09 22:31:13,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:13,663 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2025-01-09 22:31:13,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:13,663 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2025-01-09 22:31:13,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:31:13,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:13,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:13,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 22:31:13,664 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:13,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1428513751, now seen corresponding path program 1 times [2025-01-09 22:31:13,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:13,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199518531] [2025-01-09 22:31:13,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:13,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:13,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:31:13,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:31:13,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:13,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:13,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:13,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199518531] [2025-01-09 22:31:13,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199518531] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:13,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:13,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 22:31:13,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28345961] [2025-01-09 22:31:13,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:13,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:31:13,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:13,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:31:13,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:31:13,868 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:14,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:14,076 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2025-01-09 22:31:14,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:31:14,077 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-01-09 22:31:14,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:14,077 INFO L225 Difference]: With dead ends: 124 [2025-01-09 22:31:14,077 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 22:31:14,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:31:14,078 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 29 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:14,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 332 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:14,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 22:31:14,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2025-01-09 22:31:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 117 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2025-01-09 22:31:14,082 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 32 [2025-01-09 22:31:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:14,082 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2025-01-09 22:31:14,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2025-01-09 22:31:14,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:31:14,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:14,082 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-01-09 22:31:14,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 22:31:14,083 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:14,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:14,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1977848604, now seen corresponding path program 1 times [2025-01-09 22:31:14,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:14,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353511801] [2025-01-09 22:31:14,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:14,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:14,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:31:14,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:31:14,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:14,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:14,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:14,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:14,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353511801] [2025-01-09 22:31:14,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353511801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:14,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:14,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:31:14,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559614770] [2025-01-09 22:31:14,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:14,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:31:14,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:14,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:31:14,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:31:14,168 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:14,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:14,241 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2025-01-09 22:31:14,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:31:14,241 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-01-09 22:31:14,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:14,242 INFO L225 Difference]: With dead ends: 123 [2025-01-09 22:31:14,242 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 22:31:14,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:31:14,243 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 26 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:14,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 350 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:14,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 22:31:14,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-01-09 22:31:14,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.292929292929293) internal successors, (128), 118 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:14,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2025-01-09 22:31:14,246 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 35 [2025-01-09 22:31:14,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:14,246 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2025-01-09 22:31:14,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:14,247 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2025-01-09 22:31:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 22:31:14,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:14,247 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-01-09 22:31:14,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 22:31:14,247 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:14,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:14,248 INFO L85 PathProgramCache]: Analyzing trace with hash -568438322, now seen corresponding path program 1 times [2025-01-09 22:31:14,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:14,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749130898] [2025-01-09 22:31:14,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:14,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:14,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:31:14,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:31:14,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:14,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:14,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:14,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:14,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749130898] [2025-01-09 22:31:14,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749130898] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:14,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921001097] [2025-01-09 22:31:14,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:14,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:14,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:14,795 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:14,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 22:31:14,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:31:14,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:31:14,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:14,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:14,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-01-09 22:31:14,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:14,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:31:14,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:31:14,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:31:14,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-09 22:31:14,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-09 22:31:15,082 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:15,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:15,124 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 16 [2025-01-09 22:31:15,132 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 16 [2025-01-09 22:31:15,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:15,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:15,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-01-09 22:31:15,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:15,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:15,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-01-09 22:31:15,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:15,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2025-01-09 22:31:15,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:15,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2025-01-09 22:31:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:15,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:15,885 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_949 (Array Int Int)) (|ULTIMATE.start_create_~data~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_949))) (store .cse0 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data~0#1.offset|))) |c_ULTIMATE.start_create_~dll~0#1.base|) 8) 0)) (forall ((v_ArrVal_951 Int) (v_ArrVal_948 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_948))) (store .cse1 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_951))) |c_ULTIMATE.start_create_~dll~0#1.base|) 8) 0))) is different from false [2025-01-09 22:31:16,273 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_alloc_and_zero_~pi~0.offset 16))) (and (forall ((v_ArrVal_951 Int) (v_ArrVal_948 (Array Int Int)) (|v_ULTIMATE.start_create_~now~0#1.offset_21| Int) (|v_ULTIMATE.start_create_~data~0#1.base_14| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_~data~0#1.base_14|) 0)) (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| c_alloc_and_zero_~pi~0.base (store (select |c_#memory_$Pointer$#0.base| c_alloc_and_zero_~pi~0.base) .cse0 0)) |v_ULTIMATE.start_create_~data~0#1.base_14| v_ArrVal_948) c_alloc_and_zero_~pi~0.base) |v_ULTIMATE.start_create_~now~0#1.offset_21| v_ArrVal_951) 8) 0) (< c_alloc_and_zero_~pi~0.offset |v_ULTIMATE.start_create_~now~0#1.offset_21|))) (forall ((v_ArrVal_949 (Array Int Int)) (|ULTIMATE.start_create_~data~0#1.offset| Int) (|v_ULTIMATE.start_create_~now~0#1.offset_21| Int) (|v_ULTIMATE.start_create_~data~0#1.base_14| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_~data~0#1.base_14|) 0)) (= (select (store (select (store (store |c_#memory_$Pointer$#0.offset| c_alloc_and_zero_~pi~0.base (store (select |c_#memory_$Pointer$#0.offset| c_alloc_and_zero_~pi~0.base) .cse0 0)) |v_ULTIMATE.start_create_~data~0#1.base_14| v_ArrVal_949) c_alloc_and_zero_~pi~0.base) |v_ULTIMATE.start_create_~now~0#1.offset_21| |ULTIMATE.start_create_~data~0#1.offset|) 8) 0) (< c_alloc_and_zero_~pi~0.offset |v_ULTIMATE.start_create_~now~0#1.offset_21|))))) is different from false [2025-01-09 22:31:16,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:16,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2025-01-09 22:31:16,296 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 48 treesize of output 42 [2025-01-09 22:31:16,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-01-09 22:31:16,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:16,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2025-01-09 22:31:16,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:16,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2025-01-09 22:31:16,365 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:31:16,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2025-01-09 22:31:16,380 INFO L349 Elim1Store]: treesize reduction 10, result has 47.4 percent of original size [2025-01-09 22:31:16,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 32 [2025-01-09 22:31:16,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:16,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921001097] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:31:16,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:31:16,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 43 [2025-01-09 22:31:16,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389481014] [2025-01-09 22:31:16,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:16,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-01-09 22:31:16,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:16,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-01-09 22:31:16,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1512, Unknown=3, NotChecked=158, Total=1806 [2025-01-09 22:31:16,428 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 43 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:31:17,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:17,110 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2025-01-09 22:31:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:31:17,110 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2025-01-09 22:31:17,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:17,111 INFO L225 Difference]: With dead ends: 128 [2025-01-09 22:31:17,111 INFO L226 Difference]: Without dead ends: 128 [2025-01-09 22:31:17,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=200, Invalid=2255, Unknown=3, NotChecked=194, Total=2652 [2025-01-09 22:31:17,112 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 19 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:17,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1099 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 795 Invalid, 0 Unknown, 114 Unchecked, 0.4s Time] [2025-01-09 22:31:17,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-09 22:31:17,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-01-09 22:31:17,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.2788461538461537) internal successors, (133), 123 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2025-01-09 22:31:17,116 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 38 [2025-01-09 22:31:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:17,116 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2025-01-09 22:31:17,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:31:17,116 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2025-01-09 22:31:17,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:31:17,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:17,116 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, 1] [2025-01-09 22:31:17,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 22:31:17,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-09 22:31:17,321 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:17,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:17,322 INFO L85 PathProgramCache]: Analyzing trace with hash -441706783, now seen corresponding path program 1 times [2025-01-09 22:31:17,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:17,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262287979] [2025-01-09 22:31:17,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:17,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:17,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:31:17,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:31:17,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:17,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:17,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:17,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262287979] [2025-01-09 22:31:17,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262287979] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:17,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925697733] [2025-01-09 22:31:17,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:17,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:17,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:17,756 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:17,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:31:17,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:31:17,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:31:17,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:17,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:17,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-09 22:31:17,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:18,073 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 15 treesize of output 1 [2025-01-09 22:31:18,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:18,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 30 [2025-01-09 22:31:18,687 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_~l#1.base_22| Int)) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~l#1.base_22| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~l#1.base_22|) 0))) is different from true [2025-01-09 22:31:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-01-09 22:31:18,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:18,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-01-09 22:31:18,866 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 60 treesize of output 52 [2025-01-09 22:31:19,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925697733] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:19,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:31:19,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2025-01-09 22:31:19,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400747101] [2025-01-09 22:31:19,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:19,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 22:31:19,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:19,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 22:31:19,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=916, Unknown=1, NotChecked=60, Total=1056 [2025-01-09 22:31:19,561 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 25 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:31:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:20,781 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2025-01-09 22:31:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:31:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 25 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2025-01-09 22:31:20,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:20,782 INFO L225 Difference]: With dead ends: 130 [2025-01-09 22:31:20,782 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 22:31:20,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=145, Invalid=1580, Unknown=1, NotChecked=80, Total=1806 [2025-01-09 22:31:20,783 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 25 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:20,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 670 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 940 Invalid, 1 Unknown, 96 Unchecked, 0.6s Time] [2025-01-09 22:31:20,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 22:31:20,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-01-09 22:31:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 101 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2025-01-09 22:31:20,785 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 39 [2025-01-09 22:31:20,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:20,785 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2025-01-09 22:31:20,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 25 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:31:20,785 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2025-01-09 22:31:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:31:20,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:20,786 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:20,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 22:31:20,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 22:31:20,990 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:20,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:20,990 INFO L85 PathProgramCache]: Analyzing trace with hash -945950578, now seen corresponding path program 1 times [2025-01-09 22:31:20,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:20,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479700379] [2025-01-09 22:31:20,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:20,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:21,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:31:21,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:31:21,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:21,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:31:21,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:21,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479700379] [2025-01-09 22:31:21,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479700379] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:21,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627467471] [2025-01-09 22:31:21,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:21,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:21,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:21,347 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:21,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:31:21,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:31:21,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:31:21,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:21,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:21,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 22:31:21,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:21,492 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:21,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:21,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:31:21,542 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:31:21,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-09 22:31:21,574 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:31:21,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-09 22:31:21,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-09 22:31:21,595 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2025-01-09 22:31:21,615 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:31:21,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 22:31:21,617 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2025-01-09 22:31:21,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:21,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627467471] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:21,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:31:21,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 21 [2025-01-09 22:31:21,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730291331] [2025-01-09 22:31:21,652 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:21,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 22:31:21,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:21,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 22:31:21,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=403, Unknown=1, NotChecked=40, Total=506 [2025-01-09 22:31:21,653 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 19 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:31:21,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:21,861 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2025-01-09 22:31:21,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:31:21,862 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 19 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2025-01-09 22:31:21,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:21,862 INFO L225 Difference]: With dead ends: 104 [2025-01-09 22:31:21,862 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 22:31:21,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=652, Unknown=1, NotChecked=52, Total=812 [2025-01-09 22:31:21,863 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 14 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:21,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 395 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 275 Invalid, 0 Unknown, 64 Unchecked, 0.1s Time] [2025-01-09 22:31:21,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 22:31:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-01-09 22:31:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 99 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:21,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2025-01-09 22:31:21,865 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 42 [2025-01-09 22:31:21,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:21,865 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2025-01-09 22:31:21,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 19 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:31:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2025-01-09 22:31:21,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:31:21,866 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:21,866 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:21,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 22:31:22,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-09 22:31:22,067 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:22,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:22,067 INFO L85 PathProgramCache]: Analyzing trace with hash -945950577, now seen corresponding path program 1 times [2025-01-09 22:31:22,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:22,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868343440] [2025-01-09 22:31:22,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:22,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:22,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:31:22,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:31:22,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:22,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:22,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:22,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868343440] [2025-01-09 22:31:22,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868343440] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:22,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047871767] [2025-01-09 22:31:22,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:22,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:22,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:22,542 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:22,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 22:31:22,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:31:22,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:31:22,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:22,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:22,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-09 22:31:22,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:22,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:31:22,746 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:22,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:22,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:31:22,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:31:22,834 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:31:22,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-01-09 22:31:22,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-09 22:31:22,910 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:31:22,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-01-09 22:31:22,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-09 22:31:22,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2025-01-09 22:31:22,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-09 22:31:23,001 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-01-09 22:31:23,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:23,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:31:23,022 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:23,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2025-01-09 22:31:23,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:23,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047871767] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:23,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:31:23,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 28 [2025-01-09 22:31:23,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897268814] [2025-01-09 22:31:23,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:23,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 22:31:23,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:23,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 22:31:23,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=780, Unknown=1, NotChecked=56, Total=930 [2025-01-09 22:31:23,128 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 23 states have internal predecessors, (59), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:31:23,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:23,648 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2025-01-09 22:31:23,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 22:31:23,649 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 23 states have internal predecessors, (59), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2025-01-09 22:31:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:23,653 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:31:23,653 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:31:23,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=1296, Unknown=1, NotChecked=74, Total=1560 [2025-01-09 22:31:23,654 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 43 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:23,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 759 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 704 Invalid, 0 Unknown, 73 Unchecked, 0.3s Time] [2025-01-09 22:31:23,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:31:23,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-01-09 22:31:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 95 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2025-01-09 22:31:23,657 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 42 [2025-01-09 22:31:23,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:23,657 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2025-01-09 22:31:23,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 23 states have internal predecessors, (59), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:31:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2025-01-09 22:31:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:31:23,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:23,657 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:23,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 22:31:23,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:23,858 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:23,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:23,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1161671601, now seen corresponding path program 1 times [2025-01-09 22:31:23,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:23,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269317630] [2025-01-09 22:31:23,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:23,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:23,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:31:23,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:31:23,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:23,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:24,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:24,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:24,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269317630] [2025-01-09 22:31:24,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269317630] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:24,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763904377] [2025-01-09 22:31:24,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:24,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:24,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:24,097 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:24,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 22:31:24,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:31:24,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:31:24,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:24,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:24,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 22:31:24,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:31:24,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:24,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:24,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2025-01-09 22:31:24,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:31:24,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763904377] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:31:24,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:31:24,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 19 [2025-01-09 22:31:24,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665808947] [2025-01-09 22:31:24,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:24,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:31:24,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:24,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:31:24,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:31:24,541 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 20 states, 19 states have (on average 4.421052631578948) internal successors, (84), 19 states have internal predecessors, (84), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:31:24,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:24,691 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2025-01-09 22:31:24,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:31:24,691 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.421052631578948) internal successors, (84), 19 states have internal predecessors, (84), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2025-01-09 22:31:24,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:24,692 INFO L225 Difference]: With dead ends: 101 [2025-01-09 22:31:24,692 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 22:31:24,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:31:24,692 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 4 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:24,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 620 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:24,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 22:31:24,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-01-09 22:31:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2025-01-09 22:31:24,696 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 41 [2025-01-09 22:31:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:24,696 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2025-01-09 22:31:24,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.421052631578948) internal successors, (84), 19 states have internal predecessors, (84), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:31:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2025-01-09 22:31:24,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 22:31:24,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:24,697 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:24,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 22:31:24,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:24,897 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:24,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:24,898 INFO L85 PathProgramCache]: Analyzing trace with hash 369089590, now seen corresponding path program 1 times [2025-01-09 22:31:24,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:24,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58303794] [2025-01-09 22:31:24,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:24,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:24,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 22:31:24,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:31:24,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:24,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:25,524 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:31:25,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:25,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58303794] [2025-01-09 22:31:25,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58303794] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:25,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301379231] [2025-01-09 22:31:25,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:25,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:25,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:25,527 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:25,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 22:31:25,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 22:31:25,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:31:25,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:25,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:25,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-01-09 22:31:25,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:25,826 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:25,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:25,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:31:25,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:31:25,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-01-09 22:31:25,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:25,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2025-01-09 22:31:25,995 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:31:25,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-09 22:31:26,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-09 22:31:26,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:31:26,108 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:26,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:26,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:31:26,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:31:26,201 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:31:26,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-09 22:31:26,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-09 22:31:26,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-09 22:31:26,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-09 22:31:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:26,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:26,360 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1648) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1649) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))) (forall ((v_ArrVal_1648 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1648) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))))) is different from false [2025-01-09 22:31:26,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:26,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-01-09 22:31:26,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-01-09 22:31:26,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:26,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2025-01-09 22:31:26,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:26,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-01-09 22:31:26,387 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:31:26,391 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 33 treesize of output 21 [2025-01-09 22:31:26,393 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:31:26,394 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 24 treesize of output 12 [2025-01-09 22:31:26,697 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-01-09 22:31:26,698 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 22 treesize of output 21 [2025-01-09 22:31:26,746 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1642 (Array Int Int))) (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1642) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))))) is different from false [2025-01-09 22:31:26,752 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base|) (+ 16 |c_ULTIMATE.start_create_#t~mem9#1.offset|) v_ArrVal_1641))) (.cse2 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1642) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) .cse1)))) is different from false [2025-01-09 22:31:26,760 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1642 (Array Int Int)) (|v_ULTIMATE.start_create_#t~mem9#1.offset_18| Int) (v_ArrVal_1641 Int)) (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (or (< |v_ULTIMATE.start_create_#t~mem9#1.offset_18| (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)) (let ((.cse2 (let ((.cse3 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (store |c_#memory_$Pointer$#0.base| .cse3 (store (select |c_#memory_$Pointer$#0.base| .cse3) (+ 16 |v_ULTIMATE.start_create_#t~mem9#1.offset_18|) v_ArrVal_1641))))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (= .cse1 (select (select (store .cse2 .cse1 v_ArrVal_1642) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))))))) is different from false [2025-01-09 22:31:26,784 INFO L349 Elim1Store]: treesize reduction 31, result has 50.0 percent of original size [2025-01-09 22:31:26,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 90 [2025-01-09 22:31:26,789 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 279 treesize of output 267 [2025-01-09 22:31:26,794 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 74 treesize of output 66 [2025-01-09 22:31:26,798 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-09 22:31:26,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:26,814 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 23 [2025-01-09 22:31:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2025-01-09 22:31:26,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301379231] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:31:26,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:31:26,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23, 19] total 55 [2025-01-09 22:31:26,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686419337] [2025-01-09 22:31:26,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:26,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-01-09 22:31:26,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:26,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-01-09 22:31:26,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2447, Unknown=38, NotChecked=412, Total=3080 [2025-01-09 22:31:26,969 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 47 states have internal predecessors, (107), 4 states have call successors, (4), 3 states have call predecessors, (4), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 22:31:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:27,691 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2025-01-09 22:31:27,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:31:27,691 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 47 states have internal predecessors, (107), 4 states have call successors, (4), 3 states have call predecessors, (4), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) Word has length 48 [2025-01-09 22:31:27,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:27,693 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:31:27,693 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:31:27,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=332, Invalid=3428, Unknown=38, NotChecked=492, Total=4290 [2025-01-09 22:31:27,698 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 49 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:27,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1243 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 626 Invalid, 0 Unknown, 158 Unchecked, 0.3s Time] [2025-01-09 22:31:27,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:31:27,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 22:31:27,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:27,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2025-01-09 22:31:27,701 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 48 [2025-01-09 22:31:27,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:27,704 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2025-01-09 22:31:27,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 47 states have internal predecessors, (107), 4 states have call successors, (4), 3 states have call predecessors, (4), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 22:31:27,705 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2025-01-09 22:31:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:31:27,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:27,705 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:27,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 22:31:27,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:27,906 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:27,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:27,906 INFO L85 PathProgramCache]: Analyzing trace with hash -454033995, now seen corresponding path program 1 times [2025-01-09 22:31:27,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:27,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019972970] [2025-01-09 22:31:27,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:27,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:27,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:31:27,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:31:27,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:27,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:28,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:28,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019972970] [2025-01-09 22:31:28,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019972970] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:28,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900821618] [2025-01-09 22:31:28,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:28,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:28,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:28,308 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:28,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 22:31:28,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:31:28,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:31:28,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:28,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:28,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-01-09 22:31:28,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:28,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:31:28,681 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:28,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:28,685 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-01-09 22:31:28,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:31:28,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:28,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 22:31:28,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:28,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 40 [2025-01-09 22:31:28,823 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 37 treesize of output 18 [2025-01-09 22:31:28,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-01-09 22:31:28,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-01-09 22:31:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:29,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:29,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900821618] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:29,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:31:29,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2025-01-09 22:31:29,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090510405] [2025-01-09 22:31:29,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:29,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 22:31:29,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:29,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 22:31:29,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1719, Unknown=11, NotChecked=0, Total=1892 [2025-01-09 22:31:29,698 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 30 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:31:30,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:30,183 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2025-01-09 22:31:30,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:31:30,184 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 30 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2025-01-09 22:31:30,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:30,184 INFO L225 Difference]: With dead ends: 111 [2025-01-09 22:31:30,184 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 22:31:30,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=262, Invalid=2483, Unknown=11, NotChecked=0, Total=2756 [2025-01-09 22:31:30,185 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 35 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:30,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 809 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:31:30,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 22:31:30,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2025-01-09 22:31:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2025-01-09 22:31:30,192 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 47 [2025-01-09 22:31:30,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:30,192 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2025-01-09 22:31:30,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 30 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:31:30,192 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2025-01-09 22:31:30,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:31:30,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:30,192 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:30,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 22:31:30,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:30,393 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:30,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:30,394 INFO L85 PathProgramCache]: Analyzing trace with hash -465516408, now seen corresponding path program 1 times [2025-01-09 22:31:30,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:30,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690161284] [2025-01-09 22:31:30,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:30,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:30,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:31:30,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:31:30,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:30,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:30,967 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:30,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:30,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690161284] [2025-01-09 22:31:30,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690161284] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:30,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411294037] [2025-01-09 22:31:30,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:30,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:30,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:30,970 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:30,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 22:31:31,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:31:31,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:31:31,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:31,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:31,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-01-09 22:31:31,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:31,257 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:31,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:31,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:31:31,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:31:31,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-01-09 22:31:31,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:31,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 37 [2025-01-09 22:31:31,442 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:31:31,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-09 22:31:31,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-09 22:31:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:31,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:31,662 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1914 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_1914) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8))))) is different from false [2025-01-09 22:31:31,678 INFO L349 Elim1Store]: treesize reduction 5, result has 88.4 percent of original size [2025-01-09 22:31:31,678 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 47 treesize of output 46 [2025-01-09 22:31:31,858 INFO L349 Elim1Store]: treesize reduction 19, result has 69.4 percent of original size [2025-01-09 22:31:31,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 102 [2025-01-09 22:31:31,900 INFO L349 Elim1Store]: treesize reduction 40, result has 50.0 percent of original size [2025-01-09 22:31:31,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 101 [2025-01-09 22:31:31,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:31,938 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 64 treesize of output 66 [2025-01-09 22:31:31,946 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 78 treesize of output 70 [2025-01-09 22:31:31,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-01-09 22:31:31,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-01-09 22:31:32,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-01-09 22:31:32,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-01-09 22:31:32,132 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-09 22:31:32,134 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-09 22:31:32,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:32,143 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 35 treesize of output 35 [2025-01-09 22:31:32,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411294037] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:32,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:31:32,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 35 [2025-01-09 22:31:32,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787850349] [2025-01-09 22:31:32,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:32,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 22:31:32,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:32,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 22:31:32,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1627, Unknown=37, NotChecked=82, Total=1892 [2025-01-09 22:31:32,232 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 36 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 31 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:31:32,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:32,688 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2025-01-09 22:31:32,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:31:32,688 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 31 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2025-01-09 22:31:32,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:32,688 INFO L225 Difference]: With dead ends: 107 [2025-01-09 22:31:32,689 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 22:31:32,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=234, Invalid=2282, Unknown=38, NotChecked=98, Total=2652 [2025-01-09 22:31:32,690 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 17 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:32,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 939 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:31:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 22:31:32,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2025-01-09 22:31:32,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.247191011235955) internal successors, (111), 101 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2025-01-09 22:31:32,692 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 47 [2025-01-09 22:31:32,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:32,692 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2025-01-09 22:31:32,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 31 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:31:32,692 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2025-01-09 22:31:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:31:32,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:32,693 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:32,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 22:31:32,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-01-09 22:31:32,898 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:32,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:32,898 INFO L85 PathProgramCache]: Analyzing trace with hash -465516407, now seen corresponding path program 1 times [2025-01-09 22:31:32,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:32,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080259002] [2025-01-09 22:31:32,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:32,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:32,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:31:32,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:31:32,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:32,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:33,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:33,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080259002] [2025-01-09 22:31:33,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080259002] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:33,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120134864] [2025-01-09 22:31:33,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:33,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:33,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:33,449 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:33,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 22:31:33,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:31:33,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:31:33,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:33,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:33,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-01-09 22:31:33,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:33,691 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:33,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:33,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:31:33,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:31:33,796 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:31:33,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2025-01-09 22:31:33,801 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 49 treesize of output 30 [2025-01-09 22:31:33,870 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:31:33,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2025-01-09 22:31:33,872 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 49 treesize of output 30 [2025-01-09 22:31:34,007 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 39 treesize of output 21 [2025-01-09 22:31:34,009 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 32 treesize of output 14 [2025-01-09 22:31:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:34,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:34,304 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8))) (and (forall ((v_ArrVal_2042 (Array Int Int)) (v_ArrVal_2041 (Array Int Int))) (<= (+ 16 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2041) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2042) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)))) (forall ((v_ArrVal_2041 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2041) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 8))))) is different from false [2025-01-09 22:31:34,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:34,316 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 84 treesize of output 88 [2025-01-09 22:31:34,343 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8))) (and (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2041 (Array Int Int)) (v_ArrVal_2040 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2039) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2040) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) v_ArrVal_2041) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 8))) (forall ((v_prenex_30 (Array Int Int)) (v_ArrVal_2042 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_prenex_30))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) v_ArrVal_2042)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1))) (forall ((v_prenex_30 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_prenex_28) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_prenex_30) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) v_prenex_29) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) (+ 9 |c_ULTIMATE.start_create_#t~mem9#1.offset|))))) is different from false [2025-01-09 22:31:34,358 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse2 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8))) (and (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2041 (Array Int Int)) (v_ArrVal_2040 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2039) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2040) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2041) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)))) (forall ((v_prenex_30 (Array Int Int)) (v_ArrVal_2042 (Array Int Int))) (= .cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_prenex_30))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2042)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (forall ((v_prenex_30 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_prenex_28) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_prenex_30) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_prenex_29) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) (+ 9 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))))))) is different from false [2025-01-09 22:31:34,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:34,373 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 137 treesize of output 128 [2025-01-09 22:31:34,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:34,377 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 123 treesize of output 94 [2025-01-09 22:31:34,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:34,388 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 400 treesize of output 345 [2025-01-09 22:31:34,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:34,407 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 666 treesize of output 575 [2025-01-09 22:31:34,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 380 [2025-01-09 22:31:34,419 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 380 treesize of output 372 [2025-01-09 22:31:34,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 372 treesize of output 360 [2025-01-09 22:31:34,430 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 360 treesize of output 356 [2025-01-09 22:31:34,435 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 356 treesize of output 344 [2025-01-09 22:31:34,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:34,446 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 344 treesize of output 329 [2025-01-09 22:31:34,451 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 320 treesize of output 312 [2025-01-09 22:31:34,457 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 312 treesize of output 296 [2025-01-09 22:31:34,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120134864] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:34,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:31:34,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2025-01-09 22:31:34,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349927484] [2025-01-09 22:31:34,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:34,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 22:31:34,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:34,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 22:31:34,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1554, Unknown=26, NotChecked=246, Total=1980 [2025-01-09 22:31:34,604 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 34 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 30 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:31:35,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:35,028 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2025-01-09 22:31:35,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:31:35,029 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 30 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2025-01-09 22:31:35,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:35,029 INFO L225 Difference]: With dead ends: 107 [2025-01-09 22:31:35,029 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 22:31:35,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=2018, Unknown=27, NotChecked=282, Total=2550 [2025-01-09 22:31:35,030 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 22 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:35,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 847 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:31:35,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 22:31:35,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2025-01-09 22:31:35,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 101 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2025-01-09 22:31:35,032 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 47 [2025-01-09 22:31:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:35,032 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2025-01-09 22:31:35,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 30 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:31:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2025-01-09 22:31:35,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 22:31:35,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:35,036 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:35,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 22:31:35,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:35,237 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:35,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:35,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1190151840, now seen corresponding path program 1 times [2025-01-09 22:31:35,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:35,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276314282] [2025-01-09 22:31:35,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:35,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:35,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 22:31:35,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:31:35,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:35,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:35,651 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:35,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:35,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276314282] [2025-01-09 22:31:35,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276314282] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:35,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517663634] [2025-01-09 22:31:35,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:35,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:35,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:35,653 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:35,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 22:31:35,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 22:31:35,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:31:35,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:35,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:35,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-01-09 22:31:35,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:35,903 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 15 treesize of output 1 [2025-01-09 22:31:35,943 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 9 treesize of output 5 [2025-01-09 22:31:36,028 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:36,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:36,032 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 18 treesize of output 13 [2025-01-09 22:31:36,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:36,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-09 22:31:36,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:31:36,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-01-09 22:31:36,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:36,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:36,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:36,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2025-01-09 22:31:36,249 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:31:36,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2025-01-09 22:31:36,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:36,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 22:31:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:36,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:37,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517663634] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:37,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:31:37,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 35 [2025-01-09 22:31:37,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342425926] [2025-01-09 22:31:37,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:37,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 22:31:37,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:37,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 22:31:37,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1966, Unknown=16, NotChecked=0, Total=2162 [2025-01-09 22:31:37,029 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 36 states, 35 states have (on average 2.4) internal successors, (84), 32 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:31:37,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:37,721 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2025-01-09 22:31:37,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:31:37,722 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.4) internal successors, (84), 32 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2025-01-09 22:31:37,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:37,722 INFO L225 Difference]: With dead ends: 116 [2025-01-09 22:31:37,722 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 22:31:37,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=290, Invalid=2886, Unknown=16, NotChecked=0, Total=3192 [2025-01-09 22:31:37,723 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 53 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:37,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 664 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:31:37,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 22:31:37,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2025-01-09 22:31:37,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 102 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2025-01-09 22:31:37,726 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 48 [2025-01-09 22:31:37,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:37,726 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2025-01-09 22:31:37,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.4) internal successors, (84), 32 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:31:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2025-01-09 22:31:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:31:37,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:37,726 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:37,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 22:31:37,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:37,931 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:37,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:37,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1759998743, now seen corresponding path program 1 times [2025-01-09 22:31:37,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:37,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152090531] [2025-01-09 22:31:37,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:37,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:37,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:31:37,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:31:37,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:37,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:38,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:38,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152090531] [2025-01-09 22:31:38,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152090531] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:38,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821423355] [2025-01-09 22:31:38,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:38,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:38,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:38,405 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:38,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 22:31:38,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:31:38,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:31:38,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:38,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:38,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-01-09 22:31:38,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:38,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:31:38,655 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 15 treesize of output 1 [2025-01-09 22:31:38,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:38,865 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 18 treesize of output 13 [2025-01-09 22:31:38,889 INFO L349 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2025-01-09 22:31:38,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2025-01-09 22:31:38,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:31:38,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:38,956 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 43 treesize of output 23 [2025-01-09 22:31:39,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-01-09 22:31:39,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:39,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:39,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:39,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 53 [2025-01-09 22:31:39,201 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:31:39,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 58 [2025-01-09 22:31:39,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2025-01-09 22:31:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:39,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:40,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821423355] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:40,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:31:40,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2025-01-09 22:31:40,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550605712] [2025-01-09 22:31:40,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:40,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 22:31:40,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:40,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 22:31:40,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1875, Unknown=14, NotChecked=0, Total=2070 [2025-01-09 22:31:40,030 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 32 states have internal predecessors, (88), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:31:40,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:40,609 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2025-01-09 22:31:40,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:31:40,609 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 32 states have internal predecessors, (88), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 49 [2025-01-09 22:31:40,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:40,610 INFO L225 Difference]: With dead ends: 112 [2025-01-09 22:31:40,610 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 22:31:40,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=289, Invalid=2667, Unknown=14, NotChecked=0, Total=2970 [2025-01-09 22:31:40,611 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 32 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:40,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 608 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:31:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 22:31:40,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2025-01-09 22:31:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 103 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2025-01-09 22:31:40,618 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 49 [2025-01-09 22:31:40,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:40,618 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2025-01-09 22:31:40,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 32 states have internal predecessors, (88), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:31:40,618 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2025-01-09 22:31:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:31:40,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:40,619 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:40,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-09 22:31:40,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-01-09 22:31:40,820 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:40,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:40,821 INFO L85 PathProgramCache]: Analyzing trace with hash -858318598, now seen corresponding path program 1 times [2025-01-09 22:31:40,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:40,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955292182] [2025-01-09 22:31:40,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:40,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:40,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:31:40,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:31:40,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:40,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:41,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:41,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:41,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955292182] [2025-01-09 22:31:41,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955292182] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:41,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359546831] [2025-01-09 22:31:41,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:41,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:41,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:41,479 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:41,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 22:31:41,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:31:41,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:31:41,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:41,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:41,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-01-09 22:31:41,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:41,845 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:41,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:41,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:31:41,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:31:41,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-01-09 22:31:41,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:41,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 36 [2025-01-09 22:31:42,072 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:31:42,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2025-01-09 22:31:42,213 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 30 treesize of output 12 [2025-01-09 22:31:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:42,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:42,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:31:42,515 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2443 Int) (v_ArrVal_2444 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base|) (+ 16 |c_ULTIMATE.start_create_#t~mem9#1.offset|) v_ArrVal_2443)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_2444)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8)) 0))) is different from false [2025-01-09 22:31:42,635 INFO L349 Elim1Store]: treesize reduction 19, result has 69.4 percent of original size [2025-01-09 22:31:42,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 105 [2025-01-09 22:31:42,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:42,656 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 236 treesize of output 237 [2025-01-09 22:31:42,663 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 102 treesize of output 90 [2025-01-09 22:31:42,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:42,860 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 25 treesize of output 25 [2025-01-09 22:31:42,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359546831] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:42,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:31:42,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2025-01-09 22:31:42,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354144088] [2025-01-09 22:31:42,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:42,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 22:31:42,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:42,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 22:31:42,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2171, Unknown=43, NotChecked=94, Total=2450 [2025-01-09 22:31:42,992 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand has 39 states, 39 states have (on average 2.358974358974359) internal successors, (92), 33 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:31:43,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:43,933 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2025-01-09 22:31:43,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 22:31:43,933 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.358974358974359) internal successors, (92), 33 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 51 [2025-01-09 22:31:43,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:43,934 INFO L225 Difference]: With dead ends: 116 [2025-01-09 22:31:43,934 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 22:31:43,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=279, Invalid=3841, Unknown=44, NotChecked=126, Total=4290 [2025-01-09 22:31:43,935 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 55 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:43,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 818 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:31:43,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 22:31:43,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2025-01-09 22:31:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 105 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:43,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2025-01-09 22:31:43,937 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 51 [2025-01-09 22:31:43,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:43,937 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2025-01-09 22:31:43,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.358974358974359) internal successors, (92), 33 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:31:43,937 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2025-01-09 22:31:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 22:31:43,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:43,938 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:43,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-09 22:31:44,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-01-09 22:31:44,138 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-01-09 22:31:44,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash -132402878, now seen corresponding path program 2 times [2025-01-09 22:31:44,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:44,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456988751] [2025-01-09 22:31:44,139 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:31:44,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:44,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-01-09 22:31:44,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:31:44,172 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:31:44,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:45,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:45,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456988751] [2025-01-09 22:31:45,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456988751] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:45,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442057909] [2025-01-09 22:31:45,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:31:45,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:45,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:45,253 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:45,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-09 22:31:45,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-01-09 22:31:45,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:31:45,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:31:45,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:45,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-01-09 22:31:45,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:45,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:31:45,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:31:45,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-09 22:31:45,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-09 22:31:45,623 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:45,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:45,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2025-01-09 22:31:45,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2025-01-09 22:31:45,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:45,811 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-01-09 22:31:45,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 81 [2025-01-09 22:31:45,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:45,832 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-01-09 22:31:45,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 61 treesize of output 43 [2025-01-09 22:31:45,998 INFO L349 Elim1Store]: treesize reduction 61, result has 19.7 percent of original size [2025-01-09 22:31:45,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 136 treesize of output 101 [2025-01-09 22:31:46,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 69 [2025-01-09 22:31:46,711 INFO L349 Elim1Store]: treesize reduction 92, result has 47.4 percent of original size [2025-01-09 22:31:46,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 148 treesize of output 162 [2025-01-09 22:31:46,761 INFO L349 Elim1Store]: treesize reduction 24, result has 70.4 percent of original size [2025-01-09 22:31:46,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 78 treesize of output 110 [2025-01-09 22:31:47,419 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:47,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:59,067 INFO L349 Elim1Store]: treesize reduction 2745, result has 31.6 percent of original size [2025-01-09 22:31:59,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 22 case distinctions, treesize of input 13895143 treesize of output 11559517 [2025-01-09 22:32:06,857 WARN L286 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 444 DAG size of output: 142 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-01-09 22:32:06,857 INFO L349 Elim1Store]: treesize reduction 726, result has 24.5 percent of original size [2025-01-09 22:32:06,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 26 new quantified variables, introduced 92 case distinctions, treesize of input 42536811 treesize of output 24163153 [2025-01-09 22:32:20,487 WARN L286 SmtUtils]: Spent 13.61s on a formula simplification. DAG size of input: 7297 DAG size of output: 1516 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 22:32:23,100 INFO L349 Elim1Store]: treesize reduction 1550, result has 24.1 percent of original size [2025-01-09 22:32:23,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 16 new quantified variables, introduced 79 case distinctions, treesize of input 76704 treesize of output 60886 [2025-01-09 22:32:25,654 INFO L349 Elim1Store]: treesize reduction 137, result has 78.4 percent of original size [2025-01-09 22:32:25,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 57909 treesize of output 55467 [2025-01-09 22:32:29,091 INFO L349 Elim1Store]: treesize reduction 925, result has 24.9 percent of original size [2025-01-09 22:32:29,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 19 new quantified variables, introduced 79 case distinctions, treesize of input 60500 treesize of output 48112