./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/dll-lst-data.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/dll-lst-data.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 681b2cdabf3cde7288ed8a3079e7f4da8bc32fbe83841db92939828e5c0eb464 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:06:45,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:06:45,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-17 12:06:45,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:06:45,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:06:45,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:06:45,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:06:45,394 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:06:45,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:06:45,395 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:06:45,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:06:45,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:06:45,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:06:45,396 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:06:45,396 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:06:45,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:06:45,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:06:45,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:06:45,397 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:06:45,397 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:06:45,397 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:06:45,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:06:45,397 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:06:45,397 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:06:45,397 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:06:45,397 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:06:45,397 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:06:45,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:06:45,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:06:45,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:06:45,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:06:45,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:06:45,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:06:45,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:06:45,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:06:45,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:06:45,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:06:45,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:06:45,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:06:45,398 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 681b2cdabf3cde7288ed8a3079e7f4da8bc32fbe83841db92939828e5c0eb464 [2025-03-17 12:06:45,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:06:45,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:06:45,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:06:45,667 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:06:45,667 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:06:45,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/dll-lst-data.i [2025-03-17 12:06:47,063 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6202d1fe/b08b74a80d2143f89de37893e20f3b28/FLAG7c1e48adb [2025-03-17 12:06:47,533 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:06:47,533 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-lst-data.i [2025-03-17 12:06:47,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6202d1fe/b08b74a80d2143f89de37893e20f3b28/FLAG7c1e48adb [2025-03-17 12:06:47,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6202d1fe/b08b74a80d2143f89de37893e20f3b28 [2025-03-17 12:06:47,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:06:47,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:06:47,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:06:47,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:06:47,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:06:47,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:06:47" (1/1) ... [2025-03-17 12:06:47,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4922ca42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:47, skipping insertion in model container [2025-03-17 12:06:47,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:06:47" (1/1) ... [2025-03-17 12:06:47,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:06:48,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:06:48,073 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:06:48,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:06:48,189 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:06:48,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:48 WrapperNode [2025-03-17 12:06:48,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:06:48,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:06:48,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:06:48,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:06:48,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:48" (1/1) ... [2025-03-17 12:06:48,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:48" (1/1) ... [2025-03-17 12:06:48,249 INFO L138 Inliner]: procedures = 121, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 62 [2025-03-17 12:06:48,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:06:48,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:06:48,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:06:48,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:06:48,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:48" (1/1) ... [2025-03-17 12:06:48,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:48" (1/1) ... [2025-03-17 12:06:48,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:48" (1/1) ... [2025-03-17 12:06:48,281 INFO L175 MemorySlicer]: Split 12 memory accesses to 1 slices as follows [12]. 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-03-17 12:06:48,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:48" (1/1) ... [2025-03-17 12:06:48,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:48" (1/1) ... [2025-03-17 12:06:48,296 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:48" (1/1) ... [2025-03-17 12:06:48,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:48" (1/1) ... [2025-03-17 12:06:48,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:48" (1/1) ... [2025-03-17 12:06:48,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:48" (1/1) ... [2025-03-17 12:06:48,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:06:48,306 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:06:48,306 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:06:48,306 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:06:48,307 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:48" (1/1) ... [2025-03-17 12:06:48,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:06:48,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:06:48,361 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 12:06:48,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 12:06:48,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:06:48,395 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-03-17 12:06:48,395 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-03-17 12:06:48,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:06:48,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:06:48,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:06:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:06:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:06:48,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:06:48,510 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:06:48,514 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:06:48,903 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2025-03-17 12:06:48,912 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:06:48,928 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:06:48,930 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:06:48,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:06:48 BoogieIcfgContainer [2025-03-17 12:06:48,930 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:06:48,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:06:48,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:06:48,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:06:48,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:06:47" (1/3) ... [2025-03-17 12:06:48,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fab6c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:06:48, skipping insertion in model container [2025-03-17 12:06:48,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:48" (2/3) ... [2025-03-17 12:06:48,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fab6c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:06:48, skipping insertion in model container [2025-03-17 12:06:48,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:06:48" (3/3) ... [2025-03-17 12:06:48,956 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-lst-data.i [2025-03-17 12:06:48,967 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:06:48,969 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-lst-data.i that has 2 procedures, 67 locations, 1 initial locations, 3 loop locations, and 28 error locations. [2025-03-17 12:06:49,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:06:49,051 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;@29cfa890, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:06:49,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-17 12:06:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:49,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:06:49,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:49,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:06:49,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:06:49,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:49,076 INFO L85 PathProgramCache]: Analyzing trace with hash 2988067, now seen corresponding path program 1 times [2025-03-17 12:06:49,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:49,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524097703] [2025-03-17 12:06:49,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:49,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:49,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:06:49,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:06:49,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:49,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:49,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:49,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:49,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524097703] [2025-03-17 12:06:49,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524097703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:49,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:49,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:06:49,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142946974] [2025-03-17 12:06:49,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:49,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:06:49,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:49,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:06:49,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:06:49,361 INFO L87 Difference]: Start difference. First operand has 67 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:06:49,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:49,480 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2025-03-17 12:06:49,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:06:49,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 4 [2025-03-17 12:06:49,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:49,486 INFO L225 Difference]: With dead ends: 64 [2025-03-17 12:06:49,486 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 12:06:49,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:06:49,491 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 3 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:49,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 96 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:49,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 12:06:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-17 12:06:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2025-03-17 12:06:49,552 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 4 [2025-03-17 12:06:49,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:49,553 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2025-03-17 12:06:49,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:06:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2025-03-17 12:06:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:06:49,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:49,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:06:49,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:06:49,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:06:49,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:49,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2988068, now seen corresponding path program 1 times [2025-03-17 12:06:49,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:49,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931381080] [2025-03-17 12:06:49,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:49,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:49,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:06:49,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:06:49,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:49,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:49,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:49,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931381080] [2025-03-17 12:06:49,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931381080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:49,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:49,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:06:49,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561370982] [2025-03-17 12:06:49,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:49,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:06:49,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:49,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:06:49,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:06:49,723 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:06:49,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:49,809 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2025-03-17 12:06:49,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:06:49,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 4 [2025-03-17 12:06:49,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:49,814 INFO L225 Difference]: With dead ends: 59 [2025-03-17 12:06:49,814 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 12:06:49,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:06:49,815 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 3 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:49,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 97 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:49,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 12:06:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-17 12:06:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2025-03-17 12:06:49,826 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 4 [2025-03-17 12:06:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:49,827 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2025-03-17 12:06:49,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:06:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2025-03-17 12:06:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 12:06:49,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:49,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:49,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:06:49,828 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:06:49,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:49,829 INFO L85 PathProgramCache]: Analyzing trace with hash 924006845, now seen corresponding path program 1 times [2025-03-17 12:06:49,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:49,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685446831] [2025-03-17 12:06:49,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:49,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:49,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 12:06:49,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 12:06:49,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:49,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:50,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:50,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:50,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685446831] [2025-03-17 12:06:50,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685446831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:50,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:50,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:06:50,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540965812] [2025-03-17 12:06:50,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:50,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:06:50,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:50,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:06:50,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:06:50,269 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-03-17 12:06:50,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:50,505 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2025-03-17 12:06:50,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:06:50,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-03-17 12:06:50,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:50,507 INFO L225 Difference]: With dead ends: 62 [2025-03-17 12:06:50,508 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 12:06:50,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:06:50,510 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:50,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 179 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:06:50,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 12:06:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2025-03-17 12:06:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2025-03-17 12:06:50,518 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 11 [2025-03-17 12:06:50,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:50,519 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2025-03-17 12:06:50,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-03-17 12:06:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2025-03-17 12:06:50,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 12:06:50,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:50,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:50,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:06:50,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:06:50,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:50,521 INFO L85 PathProgramCache]: Analyzing trace with hash 924006844, now seen corresponding path program 1 times [2025-03-17 12:06:50,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:50,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743042484] [2025-03-17 12:06:50,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:50,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:50,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 12:06:50,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 12:06:50,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:50,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:50,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:50,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743042484] [2025-03-17 12:06:50,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743042484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:50,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:50,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:06:50,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722466656] [2025-03-17 12:06:50,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:50,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:06:50,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:50,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:06:50,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:06:50,681 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-03-17 12:06:50,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:50,822 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2025-03-17 12:06:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:06:50,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-03-17 12:06:50,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:50,824 INFO L225 Difference]: With dead ends: 58 [2025-03-17 12:06:50,824 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 12:06:50,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:06:50,825 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:50,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 137 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:50,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 12:06:50,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-03-17 12:06:50,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 50 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:50,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2025-03-17 12:06:50,837 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 11 [2025-03-17 12:06:50,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:50,837 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2025-03-17 12:06:50,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-03-17 12:06:50,838 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2025-03-17 12:06:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 12:06:50,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:50,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:50,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:06:50,838 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:06:50,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:50,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1348230243, now seen corresponding path program 1 times [2025-03-17 12:06:50,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:50,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166557519] [2025-03-17 12:06:50,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:50,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:50,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 12:06:50,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 12:06:50,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:50,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:51,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:51,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166557519] [2025-03-17 12:06:51,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166557519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:51,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:51,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:06:51,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058341471] [2025-03-17 12:06:51,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:51,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:06:51,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:51,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:06:51,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:06:51,117 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:51,278 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2025-03-17 12:06:51,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:06:51,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-17 12:06:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:51,280 INFO L225 Difference]: With dead ends: 60 [2025-03-17 12:06:51,283 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 12:06:51,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:06:51,284 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:51,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 173 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:06:51,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 12:06:51,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2025-03-17 12:06:51,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.564102564102564) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2025-03-17 12:06:51,290 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 17 [2025-03-17 12:06:51,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:51,290 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2025-03-17 12:06:51,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2025-03-17 12:06:51,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 12:06:51,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:51,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:51,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:06:51,290 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:06:51,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:51,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1348230242, now seen corresponding path program 1 times [2025-03-17 12:06:51,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:51,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454163718] [2025-03-17 12:06:51,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:51,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:51,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 12:06:51,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 12:06:51,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:51,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:51,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:51,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454163718] [2025-03-17 12:06:51,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454163718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:51,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:51,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:06:51,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526765919] [2025-03-17 12:06:51,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:51,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:06:51,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:51,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:06:51,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:06:51,714 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:51,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:51,950 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2025-03-17 12:06:51,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:06:51,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-17 12:06:51,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:51,959 INFO L225 Difference]: With dead ends: 60 [2025-03-17 12:06:51,959 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 12:06:51,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:06:51,959 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:51,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 181 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:06:51,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 12:06:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2025-03-17 12:06:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2025-03-17 12:06:51,971 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 17 [2025-03-17 12:06:51,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:51,971 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2025-03-17 12:06:51,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2025-03-17 12:06:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 12:06:51,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:51,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:51,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 12:06:51,972 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:06:51,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:51,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1154530521, now seen corresponding path program 1 times [2025-03-17 12:06:51,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:51,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727269897] [2025-03-17 12:06:51,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:51,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:51,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 12:06:52,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 12:06:52,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:52,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:52,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:52,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727269897] [2025-03-17 12:06:52,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727269897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:52,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:52,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:06:52,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127358590] [2025-03-17 12:06:52,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:52,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:06:52,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:52,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:06:52,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:06:52,151 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:52,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:52,215 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2025-03-17 12:06:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:06:52,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-17 12:06:52,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:52,217 INFO L225 Difference]: With dead ends: 61 [2025-03-17 12:06:52,218 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 12:06:52,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:06:52,219 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 22 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:52,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 259 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:52,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 12:06:52,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2025-03-17 12:06:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.5) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2025-03-17 12:06:52,232 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 18 [2025-03-17 12:06:52,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:52,233 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2025-03-17 12:06:52,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:52,233 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2025-03-17 12:06:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 12:06:52,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:52,233 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:52,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:06:52,233 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:06:52,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:52,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1406980125, now seen corresponding path program 1 times [2025-03-17 12:06:52,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:52,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305359743] [2025-03-17 12:06:52,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:52,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:52,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 12:06:52,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:06:52,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:52,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:53,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:53,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305359743] [2025-03-17 12:06:53,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305359743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:06:53,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751439277] [2025-03-17 12:06:53,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:53,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:06:53,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:06:53,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:06:53,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 12:06:53,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 12:06:53,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:06:53,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:53,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:53,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-17 12:06:53,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:06:53,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:06:53,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:06:53,241 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 29 treesize of output 13 [2025-03-17 12:06:53,249 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-03-17 12:06:53,291 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 25 treesize of output 13 [2025-03-17 12:06:53,298 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-03-17 12:06:53,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:06:53,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:06:53,420 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-03-17 12:06:53,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:06:53,427 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 13 [2025-03-17 12:06:53,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:53,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:06:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:53,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751439277] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:06:53,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:06:53,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 23 [2025-03-17 12:06:53,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749902893] [2025-03-17 12:06:53,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:06:53,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 12:06:53,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:54,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 12:06:54,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=428, Unknown=17, NotChecked=0, Total=506 [2025-03-17 12:06:54,000 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:06:54,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:54,306 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2025-03-17 12:06:54,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:06:54,307 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 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 20 [2025-03-17 12:06:54,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:54,308 INFO L225 Difference]: With dead ends: 63 [2025-03-17 12:06:54,308 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 12:06:54,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=644, Unknown=22, NotChecked=0, Total=756 [2025-03-17 12:06:54,308 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:54,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 554 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:06:54,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 12:06:54,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2025-03-17 12:06:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:54,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2025-03-17 12:06:54,311 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 20 [2025-03-17 12:06:54,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:54,311 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2025-03-17 12:06:54,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:06:54,311 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2025-03-17 12:06:54,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:06:54,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:54,312 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-03-17 12:06:54,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 12:06:54,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:06:54,514 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:06:54,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:54,515 INFO L85 PathProgramCache]: Analyzing trace with hash 666706009, now seen corresponding path program 1 times [2025-03-17 12:06:54,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:54,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537608685] [2025-03-17 12:06:54,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:54,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:54,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:06:54,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:06:54,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:54,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:06:54,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:54,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537608685] [2025-03-17 12:06:54,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537608685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:54,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:54,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:06:54,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201612818] [2025-03-17 12:06:54,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:54,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:06:54,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:54,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:06:54,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:06:54,605 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) 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-03-17 12:06:54,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:54,733 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2025-03-17 12:06:54,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:06:54,733 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) 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-03-17 12:06:54,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:54,733 INFO L225 Difference]: With dead ends: 64 [2025-03-17 12:06:54,733 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 12:06:54,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-03-17 12:06:54,734 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:54,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 173 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:54,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 12:06:54,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2025-03-17 12:06:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:54,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2025-03-17 12:06:54,739 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 21 [2025-03-17 12:06:54,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:54,740 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2025-03-17 12:06:54,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) 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-03-17 12:06:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2025-03-17 12:06:54,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:06:54,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:54,740 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-03-17 12:06:54,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 12:06:54,741 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:06:54,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:54,742 INFO L85 PathProgramCache]: Analyzing trace with hash 666706010, now seen corresponding path program 1 times [2025-03-17 12:06:54,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:54,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27763768] [2025-03-17 12:06:54,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:54,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:54,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:06:54,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:06:54,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:54,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:54,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:06:54,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:54,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27763768] [2025-03-17 12:06:54,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27763768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:54,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:54,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:06:54,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968548857] [2025-03-17 12:06:54,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:54,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:06:54,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:54,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:06:54,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:06:54,891 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) 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-03-17 12:06:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:54,999 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2025-03-17 12:06:55,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:06:55,000 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) 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-03-17 12:06:55,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:55,001 INFO L225 Difference]: With dead ends: 66 [2025-03-17 12:06:55,001 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 12:06:55,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-03-17 12:06:55,002 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 3 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:55,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 183 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:55,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 12:06:55,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2025-03-17 12:06:55,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.434782608695652) internal successors, (66), 61 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2025-03-17 12:06:55,008 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 21 [2025-03-17 12:06:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:55,008 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2025-03-17 12:06:55,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) 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-03-17 12:06:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2025-03-17 12:06:55,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:06:55,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:55,008 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-03-17 12:06:55,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 12:06:55,008 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:06:55,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:55,009 INFO L85 PathProgramCache]: Analyzing trace with hash 666705658, now seen corresponding path program 1 times [2025-03-17 12:06:55,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:55,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076514981] [2025-03-17 12:06:55,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:55,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:55,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:06:55,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:06:55,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:55,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:55,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:55,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076514981] [2025-03-17 12:06:55,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076514981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:06:55,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041406986] [2025-03-17 12:06:55,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:55,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:06:55,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:06:55,125 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:06:55,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 12:06:55,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:06:55,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:06:55,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:55,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:55,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 12:06:55,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:06:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:06:55,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:06:55,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041406986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:55,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:06:55,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2025-03-17 12:06:55,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403833643] [2025-03-17 12:06:55,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:55,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:06:55,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:55,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:06:55,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-17 12:06:55,271 INFO L87 Difference]: Start difference. First operand 65 states and 70 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-03-17 12:06:55,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:55,318 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2025-03-17 12:06:55,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:06:55,318 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-03-17 12:06:55,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:55,319 INFO L225 Difference]: With dead ends: 72 [2025-03-17 12:06:55,319 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 12:06:55,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-17 12:06:55,319 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 29 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:55,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 274 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:06:55,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 12:06:55,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2025-03-17 12:06:55,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2025-03-17 12:06:55,323 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 21 [2025-03-17 12:06:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:55,323 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2025-03-17 12:06:55,324 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-03-17 12:06:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2025-03-17 12:06:55,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:06:55,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:55,324 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:55,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 12:06:55,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 12:06:55,525 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 25 more)] === [2025-03-17 12:06:55,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:55,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1584776710, now seen corresponding path program 1 times [2025-03-17 12:06:55,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:55,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055259319] [2025-03-17 12:06:55,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:55,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:55,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:06:55,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:06:55,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:55,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:55,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:55,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055259319] [2025-03-17 12:06:55,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055259319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:06:55,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571889627] [2025-03-17 12:06:55,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:55,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:06:55,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:06:55,709 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:06:55,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 12:06:55,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:06:55,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:06:55,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:55,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:55,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 12:06:55,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:06:55,796 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-03-17 12:06:55,835 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:06:55,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 12:06:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:55,837 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:06:55,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571889627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:55,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:06:55,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2025-03-17 12:06:55,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578332747] [2025-03-17 12:06:55,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:55,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:06:55,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:55,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:06:55,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-03-17 12:06:55,838 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 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-03-17 12:06:55,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:55,878 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2025-03-17 12:06:55,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:06:55,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 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-03-17 12:06:55,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:55,879 INFO L225 Difference]: With dead ends: 68 [2025-03-17 12:06:55,879 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 12:06:55,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-03-17 12:06:55,880 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:55,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 81 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 77 Unchecked, 0.0s Time] [2025-03-17 12:06:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 12:06:55,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-17 12:06:55,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:06:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2025-03-17 12:06:55,882 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 23 [2025-03-17 12:06:55,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:55,882 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2025-03-17 12:06:55,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 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-03-17 12:06:55,882 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2025-03-17 12:06:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:06:55,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:55,884 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:55,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 12:06:56,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:06:56,089 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 25 more)] === [2025-03-17 12:06:56,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:56,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1584776709, now seen corresponding path program 1 times [2025-03-17 12:06:56,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:56,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153447029] [2025-03-17 12:06:56,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:56,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:56,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:06:56,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:06:56,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:56,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:56,271 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:56,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:56,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153447029] [2025-03-17 12:06:56,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153447029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:06:56,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231128129] [2025-03-17 12:06:56,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:56,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:06:56,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:06:56,274 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:06:56,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 12:06:56,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:06:56,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:06:56,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:56,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:56,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 12:06:56,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:06:56,469 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-03-17 12:06:56,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:06:56,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:06:56,513 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:06:56,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:06:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-17 12:06:56,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:06:56,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231128129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:06:56,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:06:56,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2025-03-17 12:06:56,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998396497] [2025-03-17 12:06:56,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:06:56,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 12:06:56,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:56,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 12:06:56,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=258, Unknown=1, NotChecked=32, Total=342 [2025-03-17 12:06:56,615 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 12 states have internal predecessors, (37), 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-03-17 12:06:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:56,833 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2025-03-17 12:06:56,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:06:56,834 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 12 states have internal predecessors, (37), 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 23 [2025-03-17 12:06:56,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:56,834 INFO L225 Difference]: With dead ends: 81 [2025-03-17 12:06:56,834 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 12:06:56,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2025-03-17 12:06:56,835 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 27 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:56,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 243 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 247 Invalid, 0 Unknown, 70 Unchecked, 0.2s Time] [2025-03-17 12:06:56,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 12:06:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2025-03-17 12:06:56,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 72 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:06:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2025-03-17 12:06:56,837 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 23 [2025-03-17 12:06:56,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:56,837 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2025-03-17 12:06:56,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 12 states have internal predecessors, (37), 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-03-17 12:06:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2025-03-17 12:06:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:06:56,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:56,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:56,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 12:06:57,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:06:57,044 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:06:57,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:57,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1909928412, now seen corresponding path program 1 times [2025-03-17 12:06:57,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:57,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917816429] [2025-03-17 12:06:57,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:57,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:57,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:06:57,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:06:57,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:57,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:06:57,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:57,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917816429] [2025-03-17 12:06:57,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917816429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:57,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:57,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:06:57,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758736812] [2025-03-17 12:06:57,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:57,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:06:57,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:57,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:06:57,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:06:57,141 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:57,208 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2025-03-17 12:06:57,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:06:57,208 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-17 12:06:57,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:57,210 INFO L225 Difference]: With dead ends: 82 [2025-03-17 12:06:57,210 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 12:06:57,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-03-17 12:06:57,210 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 25 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:57,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 250 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:57,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 12:06:57,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-03-17 12:06:57,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 76 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:06:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2025-03-17 12:06:57,216 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 24 [2025-03-17 12:06:57,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:57,217 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2025-03-17 12:06:57,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2025-03-17 12:06:57,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 12:06:57,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:57,217 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] [2025-03-17 12:06:57,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 12:06:57,217 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:06:57,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:57,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1802428230, now seen corresponding path program 1 times [2025-03-17 12:06:57,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:57,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433291539] [2025-03-17 12:06:57,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:57,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:57,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 12:06:57,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 12:06:57,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:57,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:06:57,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:57,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433291539] [2025-03-17 12:06:57,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433291539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:57,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:57,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:06:57,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549350737] [2025-03-17 12:06:57,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:57,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:06:57,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:57,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:06:57,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:06:57,403 INFO L87 Difference]: Start difference. First operand 81 states and 93 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-03-17 12:06:57,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:57,493 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2025-03-17 12:06:57,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:06:57,493 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-03-17 12:06:57,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:57,494 INFO L225 Difference]: With dead ends: 80 [2025-03-17 12:06:57,494 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 12:06:57,494 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-03-17 12:06:57,494 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:57,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 186 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:57,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 12:06:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 12:06:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 75 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:06:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2025-03-17 12:06:57,500 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 26 [2025-03-17 12:06:57,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:57,500 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2025-03-17 12:06:57,500 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-03-17 12:06:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2025-03-17 12:06:57,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 12:06:57,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:57,500 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] [2025-03-17 12:06:57,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 12:06:57,500 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:06:57,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:57,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1802428231, now seen corresponding path program 1 times [2025-03-17 12:06:57,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:57,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417673609] [2025-03-17 12:06:57,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:57,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:57,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 12:06:57,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 12:06:57,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:57,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:57,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:06:57,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:57,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417673609] [2025-03-17 12:06:57,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417673609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:57,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:57,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:06:57,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031913992] [2025-03-17 12:06:57,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:57,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:06:57,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:57,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:06:57,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:06:57,593 INFO L87 Difference]: Start difference. First operand 80 states and 91 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-03-17 12:06:57,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:57,691 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2025-03-17 12:06:57,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:06:57,692 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-03-17 12:06:57,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:57,692 INFO L225 Difference]: With dead ends: 79 [2025-03-17 12:06:57,692 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 12:06:57,692 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-03-17 12:06:57,693 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:57,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 171 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:57,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 12:06:57,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-17 12:06:57,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.360655737704918) internal successors, (83), 74 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:06:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2025-03-17 12:06:57,697 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 26 [2025-03-17 12:06:57,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:57,697 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2025-03-17 12:06:57,697 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-03-17 12:06:57,698 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2025-03-17 12:06:57,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:06:57,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:57,698 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:57,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 12:06:57,698 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:06:57,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:57,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1049430094, now seen corresponding path program 1 times [2025-03-17 12:06:57,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:57,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531105533] [2025-03-17 12:06:57,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:57,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:57,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:06:57,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:06:57,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:57,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:58,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:58,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531105533] [2025-03-17 12:06:58,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531105533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:06:58,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162578347] [2025-03-17 12:06:58,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:58,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:06:58,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:06:58,006 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:06:58,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 12:06:58,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:06:58,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:06:58,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:58,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:58,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-17 12:06:58,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:06:58,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:06:58,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:06:58,120 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-03-17 12:06:58,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:06:58,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:06:58,154 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 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-17 12:06:58,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:06:58,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:06:58,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:06:58,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:06:58,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:06:58,269 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-03-17 12:06:58,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:06:58,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-03-17 12:06:58,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:06:58,395 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-03-17 12:06:58,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:06:58,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:06:59,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-17 12:06:59,460 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 92 treesize of output 90 [2025-03-17 12:06:59,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-17 12:06:59,506 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:06:59,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2025-03-17 12:06:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:06:59,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162578347] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:06:59,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:06:59,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 34 [2025-03-17 12:06:59,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005367838] [2025-03-17 12:06:59,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:06:59,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 12:06:59,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:59,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 12:06:59,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1004, Unknown=26, NotChecked=0, Total=1122 [2025-03-17 12:06:59,511 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 34 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 31 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:07:00,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:00,648 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2025-03-17 12:07:00,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 12:07:00,649 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 31 states have internal predecessors, (63), 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-03-17 12:07:00,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:00,649 INFO L225 Difference]: With dead ends: 92 [2025-03-17 12:07:00,649 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 12:07:00,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=182, Invalid=1941, Unknown=39, NotChecked=0, Total=2162 [2025-03-17 12:07:00,651 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 38 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:00,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 567 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 12:07:00,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 12:07:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2025-03-17 12:07:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 69 states have (on average 1.391304347826087) internal successors, (96), 82 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:07:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2025-03-17 12:07:00,658 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 27 [2025-03-17 12:07:00,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:00,659 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2025-03-17 12:07:00,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 31 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:07:00,659 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2025-03-17 12:07:00,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:07:00,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:00,659 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-03-17 12:07:00,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 12:07:00,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 12:07:00,860 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:07:00,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:00,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1049430445, now seen corresponding path program 1 times [2025-03-17 12:07:00,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:00,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093419979] [2025-03-17 12:07:00,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:00,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:00,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:07:00,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:07:00,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:00,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:01,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:07:01,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:01,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093419979] [2025-03-17 12:07:01,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093419979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:01,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290510508] [2025-03-17 12:07:01,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:01,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:01,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:01,132 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:01,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 12:07:01,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:07:01,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:07:01,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:01,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:01,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 12:07:01,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:01,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:07:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:07:01,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:07:01,376 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret4#1.base_20| Int)) (or (= (store |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_20| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_20|) 0)))) is different from false [2025-03-17 12:07:01,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290510508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:01,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:07:01,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2025-03-17 12:07:01,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246384561] [2025-03-17 12:07:01,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:07:01,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:07:01,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:01,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:07:01,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=91, Unknown=1, NotChecked=18, Total=132 [2025-03-17 12:07:01,380 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 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-03-17 12:07:01,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:01,577 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2025-03-17 12:07:01,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:07:01,578 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 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 27 [2025-03-17 12:07:01,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:01,578 INFO L225 Difference]: With dead ends: 93 [2025-03-17 12:07:01,578 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 12:07:01,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=91, Unknown=1, NotChecked=18, Total=132 [2025-03-17 12:07:01,579 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:01,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 249 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:07:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 12:07:01,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 12:07:01,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 75 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:07:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2025-03-17 12:07:01,585 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 27 [2025-03-17 12:07:01,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:01,585 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2025-03-17 12:07:01,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 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-03-17 12:07:01,586 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2025-03-17 12:07:01,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:07:01,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:01,586 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] [2025-03-17 12:07:01,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 12:07:01,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 12:07:01,787 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:07:01,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1321788365, now seen corresponding path program 1 times [2025-03-17 12:07:01,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:01,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625208736] [2025-03-17 12:07:01,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:01,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:01,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:07:01,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:07:01,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:01,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:02,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:02,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625208736] [2025-03-17 12:07:02,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625208736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:07:02,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:07:02,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 12:07:02,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144903678] [2025-03-17 12:07:02,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:07:02,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 12:07:02,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:02,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 12:07:02,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-17 12:07:02,235 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 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-03-17 12:07:02,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:02,405 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2025-03-17 12:07:02,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:07:02,406 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 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 30 [2025-03-17 12:07:02,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:02,407 INFO L225 Difference]: With dead ends: 81 [2025-03-17 12:07:02,407 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 12:07:02,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-17 12:07:02,408 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 26 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:02,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 251 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:07:02,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 12:07:02,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2025-03-17 12:07:02,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 62 states have (on average 1.403225806451613) internal successors, (87), 75 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:07:02,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2025-03-17 12:07:02,415 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 30 [2025-03-17 12:07:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:02,416 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2025-03-17 12:07:02,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 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-03-17 12:07:02,417 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2025-03-17 12:07:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:07:02,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:02,417 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] [2025-03-17 12:07:02,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 12:07:02,417 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:07:02,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:02,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1321788364, now seen corresponding path program 1 times [2025-03-17 12:07:02,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:02,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286551785] [2025-03-17 12:07:02,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:02,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:07:02,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:07:02,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:02,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:03,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:03,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286551785] [2025-03-17 12:07:03,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286551785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:03,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147412633] [2025-03-17 12:07:03,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:03,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:03,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:03,050 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:03,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 12:07:03,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:07:03,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:07:03,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:03,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:03,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 12:07:03,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:03,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:07:03,704 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:07:03,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:07:03,755 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-03-17 12:07:03,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:07:03,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:03,883 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 84 treesize of output 50 [2025-03-17 12:07:03,888 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 47 treesize of output 13 [2025-03-17 12:07:03,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:03,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:03,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 19 [2025-03-17 12:07:03,984 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-03-17 12:07:04,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:04,014 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:07:04,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147412633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:07:04,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:07:04,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 25 [2025-03-17 12:07:04,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134288145] [2025-03-17 12:07:04,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:07:04,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 12:07:04,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:04,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 12:07:04,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2025-03-17 12:07:04,017 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 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-03-17 12:07:04,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:04,243 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2025-03-17 12:07:04,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 12:07:04,243 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 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 30 [2025-03-17 12:07:04,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:04,246 INFO L225 Difference]: With dead ends: 80 [2025-03-17 12:07:04,246 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 12:07:04,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2025-03-17 12:07:04,247 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:04,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 330 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:07:04,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 12:07:04,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 12:07:04,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 75 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:07:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2025-03-17 12:07:04,249 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 30 [2025-03-17 12:07:04,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:04,249 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2025-03-17 12:07:04,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 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-03-17 12:07:04,249 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2025-03-17 12:07:04,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 12:07:04,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:04,252 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 12:07:04,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 12:07:04,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:04,453 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:07:04,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:04,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1099060685, now seen corresponding path program 1 times [2025-03-17 12:07:04,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:04,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66165180] [2025-03-17 12:07:04,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:04,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:04,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:07:04,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:07:04,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:04,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 12:07:04,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:04,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66165180] [2025-03-17 12:07:04,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66165180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:04,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331163078] [2025-03-17 12:07:04,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:04,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:04,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:04,569 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:04,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 12:07:04,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:07:04,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:07:04,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:04,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:04,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 12:07:04,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:04,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 12:07:04,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:07:04,753 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:07:04,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-03-17 12:07:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 12:07:04,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331163078] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:07:04,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:07:04,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-03-17 12:07:04,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675782744] [2025-03-17 12:07:04,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:07:04,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:07:04,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:04,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:07:04,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:07:04,776 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:07:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:04,954 INFO L93 Difference]: Finished difference Result 87 states and 102 transitions. [2025-03-17 12:07:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:07:04,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2025-03-17 12:07:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:04,955 INFO L225 Difference]: With dead ends: 87 [2025-03-17 12:07:04,955 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 12:07:04,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:07:04,956 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 4 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:04,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 132 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:07:04,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 12:07:04,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2025-03-17 12:07:04,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 81 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:07:04,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2025-03-17 12:07:04,970 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 38 [2025-03-17 12:07:04,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:04,970 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2025-03-17 12:07:04,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:07:04,970 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2025-03-17 12:07:04,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 12:07:04,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:04,971 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 12:07:04,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 12:07:05,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-17 12:07:05,171 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:07:05,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:05,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1099060686, now seen corresponding path program 1 times [2025-03-17 12:07:05,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:05,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964588489] [2025-03-17 12:07:05,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:05,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:05,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:07:05,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:07:05,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:05,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:07:05,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:05,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964588489] [2025-03-17 12:07:05,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964588489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:05,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398941588] [2025-03-17 12:07:05,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:05,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:05,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:05,393 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:05,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 12:07:05,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:07:05,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:07:05,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:05,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:05,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 12:07:05,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:05,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:07:05,966 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-03-17 12:07:05,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:05,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:07:06,002 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:07:06,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:07:06,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-17 12:07:06,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:07:06,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398941588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:06,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:07:06,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2025-03-17 12:07:06,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036957333] [2025-03-17 12:07:06,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:07:06,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 12:07:06,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:06,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 12:07:06,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=325, Unknown=1, NotChecked=36, Total=420 [2025-03-17 12:07:06,277 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 15 states have internal predecessors, (67), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:07:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:06,486 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2025-03-17 12:07:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:07:06,486 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 15 states have internal predecessors, (67), 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 38 [2025-03-17 12:07:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:06,487 INFO L225 Difference]: With dead ends: 111 [2025-03-17 12:07:06,489 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 12:07:06,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=470, Unknown=1, NotChecked=44, Total=600 [2025-03-17 12:07:06,490 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 44 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:06,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 316 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 312 Invalid, 0 Unknown, 96 Unchecked, 0.2s Time] [2025-03-17 12:07:06,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 12:07:06,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2025-03-17 12:07:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 97 states have internal predecessors, (118), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:07:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2025-03-17 12:07:06,499 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 38 [2025-03-17 12:07:06,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:06,499 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2025-03-17 12:07:06,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 15 states have internal predecessors, (67), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:07:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2025-03-17 12:07:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:07:06,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:06,500 INFO L218 NwaCegarLoop]: trace histogram [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-03-17 12:07:06,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 12:07:06,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:06,701 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:07:06,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:06,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1581166573, now seen corresponding path program 1 times [2025-03-17 12:07:06,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:06,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137923029] [2025-03-17 12:07:06,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:06,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:06,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:07:06,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:07:06,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:06,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:07,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:07,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137923029] [2025-03-17 12:07:07,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137923029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:07,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092433333] [2025-03-17 12:07:07,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:07,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:07,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:07,697 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:07,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 12:07:07,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:07:07,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:07:07,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:07,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:07,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-17 12:07:07,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:07,968 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:07:07,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:07:07,992 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-03-17 12:07:08,077 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:08,078 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 31 treesize of output 32 [2025-03-17 12:07:08,135 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:08,136 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-03-17 12:07:08,234 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-03-17 12:07:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:08,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:07:08,320 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-03-17 12:07:08,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 12:07:08,368 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1328) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))))) is different from false [2025-03-17 12:07:08,375 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1327 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_1327))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1328) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)))))) is different from false [2025-03-17 12:07:08,387 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1327 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_1327))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1328) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))))))) is different from false [2025-03-17 12:07:08,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:08,401 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 63 treesize of output 44 [2025-03-17 12:07:08,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:08,420 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 220 treesize of output 165 [2025-03-17 12:07:08,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:08,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 90 treesize of output 63 [2025-03-17 12:07:08,449 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 80 treesize of output 68 [2025-03-17 12:07:08,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092433333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:08,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:07:08,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 28 [2025-03-17 12:07:08,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411546357] [2025-03-17 12:07:08,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:07:08,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 12:07:08,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:08,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 12:07:08,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=950, Unknown=9, NotChecked=192, Total=1260 [2025-03-17 12:07:08,666 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 25 states have internal predecessors, (69), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:07:09,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:09,157 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2025-03-17 12:07:09,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 12:07:09,158 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 25 states have internal predecessors, (69), 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 41 [2025-03-17 12:07:09,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:09,158 INFO L225 Difference]: With dead ends: 106 [2025-03-17 12:07:09,158 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 12:07:09,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=1385, Unknown=9, NotChecked=234, Total=1806 [2025-03-17 12:07:09,159 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 18 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:09,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 523 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:07:09,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 12:07:09,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-17 12:07:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 100 states have internal predecessors, (123), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:07:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2025-03-17 12:07:09,167 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 41 [2025-03-17 12:07:09,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:09,168 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2025-03-17 12:07:09,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 25 states have internal predecessors, (69), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:07:09,168 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2025-03-17 12:07:09,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:07:09,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:09,168 INFO L218 NwaCegarLoop]: trace histogram [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-03-17 12:07:09,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 12:07:09,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-17 12:07:09,370 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:07:09,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:09,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1581166574, now seen corresponding path program 1 times [2025-03-17 12:07:09,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:09,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352233517] [2025-03-17 12:07:09,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:09,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:09,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:07:09,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:07:09,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:09,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:10,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:10,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352233517] [2025-03-17 12:07:10,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352233517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:10,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502997662] [2025-03-17 12:07:10,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:10,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:10,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:10,786 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:10,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 12:07:10,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:07:10,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:07:10,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:10,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:10,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-17 12:07:10,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:10,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:07:11,089 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:07:11,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:07:11,143 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-03-17 12:07:11,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:07:11,247 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:11,248 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-03-17 12:07:11,253 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-03-17 12:07:11,307 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:11,307 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-03-17 12:07:11,311 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-03-17 12:07:11,433 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-03-17 12:07:11,435 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-03-17 12:07:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:11,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:07:11,612 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1464) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1463) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse0)))) (forall ((v_ArrVal_1464 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1464) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse0)))))) is different from false [2025-03-17 12:07:11,632 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1464) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1463) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)))) (forall ((v_ArrVal_1464 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1464) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 4))))) is different from false [2025-03-17 12:07:11,656 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (and (forall ((v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_1461) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_1462) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) v_ArrVal_1464) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)))) (forall ((v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_1462))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_1461) .cse2 v_ArrVal_1464) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1463) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)))))))) is different from false [2025-03-17 12:07:11,677 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1461) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1462) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_1464) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)))) (forall ((v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1462))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1461) .cse3 v_ArrVal_1464) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1463) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))))))))) is different from false [2025-03-17 12:07:11,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:11,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2025-03-17 12:07:11,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:11,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2025-03-17 12:07:11,717 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 64 treesize of output 52 [2025-03-17 12:07:11,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:11,726 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 134 treesize of output 127 [2025-03-17 12:07:11,733 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 82 treesize of output 66 [2025-03-17 12:07:11,740 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 66 treesize of output 62 [2025-03-17 12:07:11,747 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 92 treesize of output 80 [2025-03-17 12:07:11,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:11,810 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 89 treesize of output 90 [2025-03-17 12:07:11,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:11,822 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 79 treesize of output 60 [2025-03-17 12:07:11,826 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:07:11,827 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:07:11,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:11,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2025-03-17 12:07:11,838 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:07:11,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:11,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-17 12:07:11,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502997662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:11,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:07:11,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 30 [2025-03-17 12:07:11,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757337705] [2025-03-17 12:07:11,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:07:11,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 12:07:11,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:11,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 12:07:11,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1209, Unknown=4, NotChecked=292, Total=1640 [2025-03-17 12:07:11,970 INFO L87 Difference]: Start difference. First operand 106 states and 131 transitions. Second operand has 31 states, 30 states have (on average 2.433333333333333) internal successors, (73), 27 states have internal predecessors, (73), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:07:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:12,718 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2025-03-17 12:07:12,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 12:07:12,718 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.433333333333333) internal successors, (73), 27 states have internal predecessors, (73), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2025-03-17 12:07:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:12,719 INFO L225 Difference]: With dead ends: 106 [2025-03-17 12:07:12,719 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 12:07:12,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=203, Invalid=1701, Unknown=4, NotChecked=348, Total=2256 [2025-03-17 12:07:12,720 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 16 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:12,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 578 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 12:07:12,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 12:07:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-17 12:07:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 100 states have internal predecessors, (122), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:07:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2025-03-17 12:07:12,728 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 130 transitions. Word has length 41 [2025-03-17 12:07:12,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:12,728 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 130 transitions. [2025-03-17 12:07:12,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.433333333333333) internal successors, (73), 27 states have internal predecessors, (73), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:07:12,728 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 130 transitions. [2025-03-17 12:07:12,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 12:07:12,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:12,729 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-17 12:07:12,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 12:07:12,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 12:07:12,933 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:07:12,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:12,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1771518601, now seen corresponding path program 1 times [2025-03-17 12:07:12,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:12,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346586067] [2025-03-17 12:07:12,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:12,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 12:07:12,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 12:07:12,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:12,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 12:07:13,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:13,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346586067] [2025-03-17 12:07:13,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346586067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:13,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056484353] [2025-03-17 12:07:13,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:13,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:13,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:13,065 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:13,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 12:07:13,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 12:07:13,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 12:07:13,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:13,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:13,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 12:07:13,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 12:07:13,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:07:13,369 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:07:13,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-03-17 12:07:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 12:07:13,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056484353] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:07:13,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:07:13,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2025-03-17 12:07:13,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097997250] [2025-03-17 12:07:13,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:07:13,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:07:13,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:13,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:07:13,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:07:13,400 INFO L87 Difference]: Start difference. First operand 106 states and 130 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:07:13,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:13,604 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2025-03-17 12:07:13,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:07:13,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-03-17 12:07:13,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:13,606 INFO L225 Difference]: With dead ends: 115 [2025-03-17 12:07:13,606 INFO L226 Difference]: Without dead ends: 115 [2025-03-17 12:07:13,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:07:13,606 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:13,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 158 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:07:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-17 12:07:13,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2025-03-17 12:07:13,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.425531914893617) internal successors, (134), 107 states have internal predecessors, (134), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:07:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 142 transitions. [2025-03-17 12:07:13,614 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 142 transitions. Word has length 42 [2025-03-17 12:07:13,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:13,614 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 142 transitions. [2025-03-17 12:07:13,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:07:13,614 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 142 transitions. [2025-03-17 12:07:13,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 12:07:13,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:13,615 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-17 12:07:13,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 12:07:13,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-17 12:07:13,824 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:07:13,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:13,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1771518602, now seen corresponding path program 1 times [2025-03-17 12:07:13,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:13,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102918581] [2025-03-17 12:07:13,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:13,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:13,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 12:07:13,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 12:07:13,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:13,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:07:14,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:14,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102918581] [2025-03-17 12:07:14,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102918581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:14,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886909987] [2025-03-17 12:07:14,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:14,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:14,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:14,092 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:14,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 12:07:14,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 12:07:14,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 12:07:14,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:14,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:14,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-17 12:07:14,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:14,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:07:14,384 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-03-17 12:07:14,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:14,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:07:14,434 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:07:14,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:07:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-17 12:07:14,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:07:14,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886909987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:14,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:07:14,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 19 [2025-03-17 12:07:14,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967945951] [2025-03-17 12:07:14,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:07:14,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 12:07:14,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:14,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 12:07:14,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=494, Unknown=1, NotChecked=44, Total=600 [2025-03-17 12:07:14,797 INFO L87 Difference]: Start difference. First operand 113 states and 142 transitions. Second operand has 20 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 17 states have internal predecessors, (74), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:07:15,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:15,320 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2025-03-17 12:07:15,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 12:07:15,320 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 17 states have internal predecessors, (74), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2025-03-17 12:07:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:15,321 INFO L225 Difference]: With dead ends: 139 [2025-03-17 12:07:15,323 INFO L226 Difference]: Without dead ends: 139 [2025-03-17 12:07:15,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=1060, Unknown=1, NotChecked=66, Total=1260 [2025-03-17 12:07:15,324 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 67 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:15,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 384 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 561 Invalid, 0 Unknown, 116 Unchecked, 0.3s Time] [2025-03-17 12:07:15,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-17 12:07:15,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 113. [2025-03-17 12:07:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.372340425531915) internal successors, (129), 107 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:07:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2025-03-17 12:07:15,334 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 42 [2025-03-17 12:07:15,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:15,334 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2025-03-17 12:07:15,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 17 states have internal predecessors, (74), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:07:15,335 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2025-03-17 12:07:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 12:07:15,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:15,335 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 12:07:15,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 12:07:15,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 12:07:15,536 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:07:15,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:15,536 INFO L85 PathProgramCache]: Analyzing trace with hash -716797910, now seen corresponding path program 1 times [2025-03-17 12:07:15,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:15,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104105499] [2025-03-17 12:07:15,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:15,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:15,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:07:15,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:07:15,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:15,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:07:16,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:16,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104105499] [2025-03-17 12:07:16,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104105499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:16,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43217657] [2025-03-17 12:07:16,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:16,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:16,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:16,139 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:16,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 12:07:16,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:07:16,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:07:16,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:16,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:16,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 12:07:16,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:16,387 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:07:16,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:07:16,403 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-03-17 12:07:16,447 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:16,448 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 31 treesize of output 32 [2025-03-17 12:07:16,480 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:16,480 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-03-17 12:07:16,488 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-03-17 12:07:16,496 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base 1))) is different from true [2025-03-17 12:07:16,513 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:07:16,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 12:07:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2025-03-17 12:07:16,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:07:16,675 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-03-17 12:07:16,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 12:07:16,712 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1900 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (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_1900) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))))) is different from false [2025-03-17 12:07:16,724 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1899 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_1899)) (.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1900) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) .cse1)))) is different from false [2025-03-17 12:07:16,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:16,768 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 63 treesize of output 44 [2025-03-17 12:07:16,770 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 244 treesize of output 190 [2025-03-17 12:07:16,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-17 12:07:16,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 12:07:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:16,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43217657] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:07:16,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:07:16,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 14] total 31 [2025-03-17 12:07:16,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866004811] [2025-03-17 12:07:16,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:07:16,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 12:07:16,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:16,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 12:07:16,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=715, Unknown=17, NotChecked=168, Total=992 [2025-03-17 12:07:16,847 INFO L87 Difference]: Start difference. First operand 113 states and 137 transitions. Second operand has 32 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 27 states have internal predecessors, (85), 3 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 12:07:17,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:17,251 INFO L93 Difference]: Finished difference Result 111 states and 133 transitions. [2025-03-17 12:07:17,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 12:07:17,252 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 27 states have internal predecessors, (85), 3 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 44 [2025-03-17 12:07:17,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:17,256 INFO L225 Difference]: With dead ends: 111 [2025-03-17 12:07:17,256 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 12:07:17,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=1038, Unknown=17, NotChecked=204, Total=1406 [2025-03-17 12:07:17,256 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:17,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 544 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 541 Invalid, 0 Unknown, 109 Unchecked, 0.3s Time] [2025-03-17 12:07:17,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 12:07:17,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-17 12:07:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 105 states have internal predecessors, (125), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:07:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 133 transitions. [2025-03-17 12:07:17,264 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 133 transitions. Word has length 44 [2025-03-17 12:07:17,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:17,265 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 133 transitions. [2025-03-17 12:07:17,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 27 states have internal predecessors, (85), 3 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 12:07:17,265 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 133 transitions. [2025-03-17 12:07:17,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 12:07:17,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:17,265 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 12:07:17,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 12:07:17,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:17,466 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:07:17,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:17,466 INFO L85 PathProgramCache]: Analyzing trace with hash -716797909, now seen corresponding path program 1 times [2025-03-17 12:07:17,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:17,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435457247] [2025-03-17 12:07:17,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:17,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:17,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:07:17,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:07:17,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:17,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:18,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:18,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435457247] [2025-03-17 12:07:18,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435457247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:18,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779146364] [2025-03-17 12:07:18,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:18,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:18,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:18,357 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:18,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 12:07:18,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:07:18,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:07:18,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:18,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:18,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 12:07:18,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:18,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:07:18,603 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:07:18,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:07:18,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:07:18,634 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-03-17 12:07:18,719 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:18,720 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-03-17 12:07:18,722 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-03-17 12:07:18,800 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:18,801 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-03-17 12:07:18,806 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-03-17 12:07:18,902 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-03-17 12:07:18,909 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-03-17 12:07:19,008 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-03-17 12:07:19,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:19,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:07:19,062 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:07:19,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:07:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-17 12:07:19,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:07:19,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779146364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:19,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:07:19,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2025-03-17 12:07:19,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107546051] [2025-03-17 12:07:19,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:07:19,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 12:07:19,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:19,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 12:07:19,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=967, Unknown=1, NotChecked=62, Total=1122 [2025-03-17 12:07:19,230 INFO L87 Difference]: Start difference. First operand 111 states and 133 transitions. Second operand has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 25 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:07:19,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:19,877 INFO L93 Difference]: Finished difference Result 107 states and 125 transitions. [2025-03-17 12:07:19,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 12:07:19,878 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 25 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2025-03-17 12:07:19,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:19,878 INFO L225 Difference]: With dead ends: 107 [2025-03-17 12:07:19,878 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 12:07:19,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=233, Invalid=1840, Unknown=1, NotChecked=88, Total=2162 [2025-03-17 12:07:19,879 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 46 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:19,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 587 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 605 Invalid, 0 Unknown, 56 Unchecked, 0.3s Time] [2025-03-17 12:07:19,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 12:07:19,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-17 12:07:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 101 states have internal predecessors, (117), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:07:19,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2025-03-17 12:07:19,882 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 44 [2025-03-17 12:07:19,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:19,882 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2025-03-17 12:07:19,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 25 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:07:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2025-03-17 12:07:19,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 12:07:19,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:19,883 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 12:07:19,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 12:07:20,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 12:07:20,087 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2025-03-17 12:07:20,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:20,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1627038157, now seen corresponding path program 2 times [2025-03-17 12:07:20,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:20,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194326744] [2025-03-17 12:07:20,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:07:20,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:20,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-17 12:07:20,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:07:20,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:07:20,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:21,855 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:21,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:21,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194326744] [2025-03-17 12:07:21,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194326744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:21,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812909509] [2025-03-17 12:07:21,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:07:21,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:21,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:21,858 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:21,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 12:07:22,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-17 12:07:22,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:07:22,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:07:22,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:22,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-03-17 12:07:22,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:22,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:07:22,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:07:22,217 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-03-17 12:07:22,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:07:22,250 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-03-17 12:07:22,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:07:22,300 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:07:22,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:07:22,326 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 15 [2025-03-17 12:07:22,349 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-03-17 12:07:22,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:22,550 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 12:07:22,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 67 [2025-03-17 12:07:22,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:22,586 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-03-17 12:07:22,586 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-03-17 12:07:22,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:22,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:22,883 INFO L349 Elim1Store]: treesize reduction 61, result has 19.7 percent of original size [2025-03-17 12:07:22,883 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 125 treesize of output 98 [2025-03-17 12:07:22,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:22,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:22,900 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 76 treesize of output 58 [2025-03-17 12:07:23,643 INFO L349 Elim1Store]: treesize reduction 80, result has 49.7 percent of original size [2025-03-17 12:07:23,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 137 treesize of output 155 [2025-03-17 12:07:23,714 INFO L349 Elim1Store]: treesize reduction 24, result has 70.4 percent of original size [2025-03-17 12:07:23,714 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 75 treesize of output 107 [2025-03-17 12:07:24,659 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:24,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:07:25,466 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))) (let ((.cse4 (select |c_#memory_$Pointer$#0.offset| .cse3)) (.cse2 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$#0.base| .cse3)) (.cse5 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_33| Int)) (or (forall ((v_ArrVal_2226 (Array Int Int))) (or (not (= v_ArrVal_2226 (store .cse0 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| (select v_ArrVal_2226 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|)))) (forall ((v_ArrVal_2227 (Array Int Int))) (or (= (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| .cse3 v_ArrVal_2226))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse3 v_ArrVal_2227) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 4)) 0) (not (= (store .cse4 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| (select v_ArrVal_2227 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|)) v_ArrVal_2227)))))) (< .cse5 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_33| Int)) (or (forall ((v_ArrVal_2226 (Array Int Int))) (or (forall ((v_ArrVal_2227 (Array Int Int))) (or (not (= (store .cse4 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| (select v_ArrVal_2227 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|)) v_ArrVal_2227)) (= (let ((.cse6 (store |c_#memory_$Pointer$#0.offset| .cse3 v_ArrVal_2227))) (select (select .cse6 (select (select (store |c_#memory_$Pointer$#0.base| .cse3 v_ArrVal_2226) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)) (+ (select (select .cse6 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 4))) 0))) (not (= v_ArrVal_2226 (store .cse0 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| (select v_ArrVal_2226 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|)))))) (< .cse5 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|))))))) is different from false [2025-03-17 12:07:25,591 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_create_#t~mem8#1.offset| 12))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem8#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem8#1.base|) .cse8 |c_ULTIMATE.start_create_~now~0#1.base|))) (.cse6 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse5 (select .cse3 .cse1)) (.cse4 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem8#1.base|))) (and (forall ((v_ArrVal_2222 Int) (|v_ULTIMATE.start_create_#t~mem9#1.offset_33| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem8#1.base| (store .cse7 .cse8 v_ArrVal_2222)))) (or (forall ((v_ArrVal_2226 (Array Int Int))) (or (forall ((v_ArrVal_2227 (Array Int Int))) (or (not (= v_ArrVal_2227 (store (select .cse0 .cse1) |v_ULTIMATE.start_create_#t~mem9#1.offset_33| (select v_ArrVal_2227 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|)))) (= 0 (let ((.cse2 (store .cse0 .cse1 v_ArrVal_2227))) (select (select .cse2 (select (select (store .cse3 .cse1 v_ArrVal_2226) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4)) (+ 4 (select (select .cse2 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4))))))) (not (= v_ArrVal_2226 (store .cse5 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| (select v_ArrVal_2226 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|)))))) (< (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) |v_ULTIMATE.start_create_#t~mem9#1.offset_33|)))) (forall ((v_ArrVal_2222 Int) (|v_ULTIMATE.start_create_#t~mem9#1.offset_33| Int)) (let ((.cse9 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem8#1.base| (store .cse7 .cse8 v_ArrVal_2222)))) (or (< (select (select .cse9 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) |v_ULTIMATE.start_create_#t~mem9#1.offset_33|) (forall ((v_ArrVal_2226 (Array Int Int))) (or (not (= v_ArrVal_2226 (store .cse5 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| (select v_ArrVal_2226 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|)))) (forall ((v_ArrVal_2227 (Array Int Int))) (or (not (= v_ArrVal_2227 (store (select .cse9 .cse1) |v_ULTIMATE.start_create_#t~mem9#1.offset_33| (select v_ArrVal_2227 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|)))) (= (select (let ((.cse10 (store .cse3 .cse1 v_ArrVal_2226))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4))) (+ 4 (select (select (store .cse9 .cse1 v_ArrVal_2227) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4))) 0))))))))))))) is different from false [2025-03-17 12:07:25,698 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2)) (.cse6 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse8 (select |c_#memory_$Pointer$#0.base| .cse7)) (.cse10 (select |c_#memory_$Pointer$#0.offset| .cse7))) (and (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_34| Int)) (or (< |v_ULTIMATE.start_create_#t~mem8#1.offset_34| .cse0) (forall ((v_ArrVal_2222 Int) (|v_ULTIMATE.start_create_#t~mem9#1.offset_33| Int)) (let ((.cse9 (+ 12 |v_ULTIMATE.start_create_#t~mem8#1.offset_34|))) (let ((.cse1 (store |c_#memory_$Pointer$#0.offset| .cse7 (store .cse10 .cse9 v_ArrVal_2222)))) (or (< (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) |v_ULTIMATE.start_create_#t~mem9#1.offset_33|) (forall ((v_ArrVal_2226 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse7 (store .cse8 .cse9 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (or (forall ((v_ArrVal_2227 (Array Int Int))) (or (= (let ((.cse3 (store .cse1 .cse5 v_ArrVal_2227))) (select (select .cse3 (select (select (store .cse4 .cse5 v_ArrVal_2226) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6)) (+ (select (select .cse3 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6) 4))) 0) (not (= v_ArrVal_2227 (store (select .cse1 .cse5) |v_ULTIMATE.start_create_#t~mem9#1.offset_33| (select v_ArrVal_2227 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|)))))) (not (= (store (select .cse4 .cse5) |v_ULTIMATE.start_create_#t~mem9#1.offset_33| (select v_ArrVal_2226 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|)) v_ArrVal_2226)))))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_34| Int)) (or (< |v_ULTIMATE.start_create_#t~mem8#1.offset_34| .cse0) (forall ((v_ArrVal_2222 Int) (|v_ULTIMATE.start_create_#t~mem9#1.offset_33| Int)) (let ((.cse15 (+ 12 |v_ULTIMATE.start_create_#t~mem8#1.offset_34|))) (let ((.cse14 (store |c_#memory_$Pointer$#0.offset| .cse7 (store .cse10 .cse15 v_ArrVal_2222)))) (or (forall ((v_ArrVal_2226 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#0.base| .cse7 (store .cse8 .cse15 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (or (not (= (store (select .cse11 .cse12) |v_ULTIMATE.start_create_#t~mem9#1.offset_33| (select v_ArrVal_2226 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|)) v_ArrVal_2226)) (forall ((v_ArrVal_2227 (Array Int Int))) (or (= (select (let ((.cse13 (store .cse11 .cse12 v_ArrVal_2226))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6))) (+ (select (select (store .cse14 .cse12 v_ArrVal_2227) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6) 4)) 0) (not (= v_ArrVal_2227 (store (select .cse14 .cse12) |v_ULTIMATE.start_create_#t~mem9#1.offset_33| (select v_ArrVal_2227 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|)))))))))) (< (select (select .cse14 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) |v_ULTIMATE.start_create_#t~mem9#1.offset_33|))))))))))) is different from false [2025-03-17 12:07:25,876 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse9 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 |c_ULTIMATE.start_create_#t~ret7#1.offset|))) (.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 |c_ULTIMATE.start_create_#t~ret7#1.base|)))) (let ((.cse5 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse7 (select .cse6 |c_ULTIMATE.start_create_#t~ret7#1.base|)) (.cse10 (select .cse9 |c_ULTIMATE.start_create_#t~ret7#1.base|))) (and (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_34| Int)) (or (< |v_ULTIMATE.start_create_#t~mem8#1.offset_34| |c_ULTIMATE.start_create_#t~ret7#1.offset|) (forall ((v_ArrVal_2222 Int) (|v_ULTIMATE.start_create_#t~mem9#1.offset_33| Int)) (let ((.cse8 (+ 12 |v_ULTIMATE.start_create_#t~mem8#1.offset_34|))) (let ((.cse0 (store .cse9 |c_ULTIMATE.start_create_#t~ret7#1.base| (store .cse10 .cse8 v_ArrVal_2222)))) (or (< (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) |v_ULTIMATE.start_create_#t~mem9#1.offset_33|) (forall ((v_ArrVal_2226 (Array Int Int))) (let ((.cse2 (store .cse6 |c_ULTIMATE.start_create_#t~ret7#1.base| (store .cse7 .cse8 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (or (not (= v_ArrVal_2226 (store (select .cse2 .cse3) |v_ULTIMATE.start_create_#t~mem9#1.offset_33| (select v_ArrVal_2226 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|)))) (forall ((v_ArrVal_2227 (Array Int Int))) (or (not (= (store (select .cse0 .cse3) |v_ULTIMATE.start_create_#t~mem9#1.offset_33| (select v_ArrVal_2227 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|)) v_ArrVal_2227)) (= (select (let ((.cse4 (store .cse2 .cse3 v_ArrVal_2226))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5))) (+ (select (select (store .cse0 .cse3 v_ArrVal_2227) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5) 4)) 0))))))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_34| Int)) (or (< |v_ULTIMATE.start_create_#t~mem8#1.offset_34| |c_ULTIMATE.start_create_#t~ret7#1.offset|) (forall ((v_ArrVal_2222 Int) (|v_ULTIMATE.start_create_#t~mem9#1.offset_33| Int)) (let ((.cse15 (+ 12 |v_ULTIMATE.start_create_#t~mem8#1.offset_34|))) (let ((.cse13 (store .cse9 |c_ULTIMATE.start_create_#t~ret7#1.base| (store .cse10 .cse15 v_ArrVal_2222)))) (or (forall ((v_ArrVal_2226 (Array Int Int))) (let ((.cse11 (store .cse6 |c_ULTIMATE.start_create_#t~ret7#1.base| (store .cse7 .cse15 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (or (not (= v_ArrVal_2226 (store (select .cse11 .cse12) |v_ULTIMATE.start_create_#t~mem9#1.offset_33| (select v_ArrVal_2226 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|)))) (forall ((v_ArrVal_2227 (Array Int Int))) (or (not (= (store (select .cse13 .cse12) |v_ULTIMATE.start_create_#t~mem9#1.offset_33| (select v_ArrVal_2227 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|)) v_ArrVal_2227)) (= (let ((.cse14 (store .cse13 .cse12 v_ArrVal_2227))) (select (select .cse14 (select (select (store .cse11 .cse12 v_ArrVal_2226) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5)) (+ (select (select .cse14 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5) 4))) 0))))))) (< (select (select .cse13 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) |v_ULTIMATE.start_create_#t~mem9#1.offset_33|))))))))))) is different from false [2025-03-17 12:07:26,829 INFO L349 Elim1Store]: treesize reduction 1033, result has 25.8 percent of original size [2025-03-17 12:07:26,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 119158 treesize of output 104977 [2025-03-17 12:07:28,512 INFO L349 Elim1Store]: treesize reduction 333, result has 32.6 percent of original size [2025-03-17 12:07:28,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 37 case distinctions, treesize of input 781107 treesize of output 445446 [2025-03-17 12:07:31,708 INFO L349 Elim1Store]: treesize reduction 416, result has 31.1 percent of original size [2025-03-17 12:07:31,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 46 case distinctions, treesize of input 27423 treesize of output 19942 [2025-03-17 12:07:32,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:32,806 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 14 new quantified variables, introduced 36 case distinctions, treesize of input 29388 treesize of output 22084 [2025-03-17 12:07:34,199 INFO L349 Elim1Store]: treesize reduction 617, result has 30.8 percent of original size [2025-03-17 12:07:34,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 37 case distinctions, treesize of input 20798 treesize of output 20348 [2025-03-17 12:07:35,596 INFO L349 Elim1Store]: treesize reduction 12, result has 97.7 percent of original size [2025-03-17 12:07:35,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 19614 treesize of output 19744