./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce0605531f746c66e356003878f3ab7c5ad817345595a3b6cf97d30480630cbb --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:22:48,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:22:48,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:22:48,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:22:48,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:22:48,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:22:48,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:22:48,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:22:48,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:22:48,979 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:22:48,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:22:48,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:22:48,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:22:48,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:22:48,979 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:22:48,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:22:48,980 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:22:48,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:22:48,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:22:48,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:22:48,980 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:22:48,980 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:22:48,980 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:22:48,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:22:48,980 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:22:48,980 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:22:48,981 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:22:48,981 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:22:48,981 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:22:48,985 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:22:48,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:22:48,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:22:48,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:22:48,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:48,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:22:48,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:22:48,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:22:48,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:22:48,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:48,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:22:48,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:22:48,985 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:22:48,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:22:48,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:22:48,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:22:48,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:22:48,985 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce0605531f746c66e356003878f3ab7c5ad817345595a3b6cf97d30480630cbb [2025-04-29 11:22:49,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:22:49,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:22:49,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:22:49,223 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:22:49,223 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:22:49,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls.c [2025-04-29 11:22:50,550 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/417dc6880/92959d97b5ab448ab97801ddccbdf714/FLAG1154d3033 [2025-04-29 11:22:50,779 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:22:50,780 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-ext/tree_of_cslls.c [2025-04-29 11:22:50,782 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:22:50,782 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:22:50,789 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/417dc6880/92959d97b5ab448ab97801ddccbdf714/FLAG1154d3033 [2025-04-29 11:22:51,601 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/417dc6880/92959d97b5ab448ab97801ddccbdf714 [2025-04-29 11:22:51,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:22:51,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:22:51,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:22:51,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:22:51,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:22:51,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:22:51" (1/1) ... [2025-04-29 11:22:51,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@af2ef0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:51, skipping insertion in model container [2025-04-29 11:22:51,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:22:51" (1/1) ... [2025-04-29 11:22:51,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:22:51,773 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:22:51,780 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:22:51,819 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:22:51,828 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:22:51,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:51 WrapperNode [2025-04-29 11:22:51,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:22:51,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:22:51,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:22:51,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:22:51,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:51" (1/1) ... [2025-04-29 11:22:51,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:51" (1/1) ... [2025-04-29 11:22:51,861 INFO L138 Inliner]: procedures = 10, calls = 59, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 211 [2025-04-29 11:22:51,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:22:51,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:22:51,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:22:51,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:22:51,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:51" (1/1) ... [2025-04-29 11:22:51,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:51" (1/1) ... [2025-04-29 11:22:51,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:51" (1/1) ... [2025-04-29 11:22:51,890 INFO L175 MemorySlicer]: Split 47 memory accesses to 1 slices as follows [47]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 17 writes are split as follows [17]. [2025-04-29 11:22:51,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:51" (1/1) ... [2025-04-29 11:22:51,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:51" (1/1) ... [2025-04-29 11:22:51,898 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:51" (1/1) ... [2025-04-29 11:22:51,899 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:51" (1/1) ... [2025-04-29 11:22:51,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:51" (1/1) ... [2025-04-29 11:22:51,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:51" (1/1) ... [2025-04-29 11:22:51,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:51" (1/1) ... [2025-04-29 11:22:51,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:22:51,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:22:51,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:22:51,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:22:51,908 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:51" (1/1) ... [2025-04-29 11:22:51,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:51,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:51,933 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-04-29 11:22:51,935 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-04-29 11:22:51,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:22:51,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:22:51,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:22:51,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:22:51,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:22:51,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:22:52,034 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:22:52,035 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:22:52,506 INFO L? ?]: Removed 233 outVars from TransFormulas that were not future-live. [2025-04-29 11:22:52,506 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:22:52,517 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:22:52,520 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2025-04-29 11:22:52,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:22:52 BoogieIcfgContainer [2025-04-29 11:22:52,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:22:52,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:22:52,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:22:52,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:22:52,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:22:51" (1/3) ... [2025-04-29 11:22:52,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1278d57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:22:52, skipping insertion in model container [2025-04-29 11:22:52,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:51" (2/3) ... [2025-04-29 11:22:52,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1278d57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:22:52, skipping insertion in model container [2025-04-29 11:22:52,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:22:52" (3/3) ... [2025-04-29 11:22:52,527 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_of_cslls.c [2025-04-29 11:22:52,539 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:22:52,541 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_of_cslls.c that has 1 procedures, 215 locations, 237 edges, 1 initial locations, 7 loop locations, and 104 error locations. [2025-04-29 11:22:52,575 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:22:52,583 INFO L340 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;@4580bf9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:22:52,583 INFO L341 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2025-04-29 11:22:52,587 INFO L278 IsEmpty]: Start isEmpty. Operand has 215 states, 110 states have (on average 2.1545454545454548) internal successors, (237), 214 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:52,591 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-04-29 11:22:52,592 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:52,592 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-04-29 11:22:52,592 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:22:52,597 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:52,597 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2025-04-29 11:22:52,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:52,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163305038] [2025-04-29 11:22:52,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:52,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:52,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 11:22:52,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 11:22:52,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:52,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:52,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:52,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163305038] [2025-04-29 11:22:52,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163305038] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:52,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:52,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:22:52,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041775916] [2025-04-29 11:22:52,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:52,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:52,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:52,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:52,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:52,787 INFO L87 Difference]: Start difference. First operand has 215 states, 110 states have (on average 2.1545454545454548) internal successors, (237), 214 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:53,024 INFO L93 Difference]: Finished difference Result 283 states and 306 transitions. [2025-04-29 11:22:53,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:53,026 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-04-29 11:22:53,026 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:53,031 INFO L225 Difference]: With dead ends: 283 [2025-04-29 11:22:53,031 INFO L226 Difference]: Without dead ends: 281 [2025-04-29 11:22:53,033 INFO L436 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-04-29 11:22:53,034 INFO L437 NwaCegarLoop]: 158 mSDtfsCounter, 192 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:53,035 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 206 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:53,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-04-29 11:22:53,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 204. [2025-04-29 11:22:53,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 109 states have (on average 2.018348623853211) internal successors, (220), 203 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 220 transitions. [2025-04-29 11:22:53,071 INFO L79 Accepts]: Start accepts. Automaton has 204 states and 220 transitions. Word has length 3 [2025-04-29 11:22:53,071 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:53,071 INFO L485 AbstractCegarLoop]: Abstraction has 204 states and 220 transitions. [2025-04-29 11:22:53,071 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,072 INFO L278 IsEmpty]: Start isEmpty. Operand 204 states and 220 transitions. [2025-04-29 11:22:53,072 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-04-29 11:22:53,072 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:53,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-04-29 11:22:53,072 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:22:53,072 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:22:53,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:53,073 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2025-04-29 11:22:53,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:53,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572025010] [2025-04-29 11:22:53,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:53,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:53,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 11:22:53,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 11:22:53,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:53,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:53,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:53,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:53,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572025010] [2025-04-29 11:22:53,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572025010] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:53,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:53,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:22:53,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592738612] [2025-04-29 11:22:53,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:53,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:53,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:53,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:53,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:53,150 INFO L87 Difference]: Start difference. First operand 204 states and 220 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:53,268 INFO L93 Difference]: Finished difference Result 202 states and 218 transitions. [2025-04-29 11:22:53,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:53,268 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-04-29 11:22:53,268 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:53,269 INFO L225 Difference]: With dead ends: 202 [2025-04-29 11:22:53,269 INFO L226 Difference]: Without dead ends: 202 [2025-04-29 11:22:53,270 INFO L436 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-04-29 11:22:53,270 INFO L437 NwaCegarLoop]: 215 mSDtfsCounter, 2 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:53,271 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 330 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-04-29 11:22:53,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-04-29 11:22:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 109 states have (on average 2.0) internal successors, (218), 201 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 218 transitions. [2025-04-29 11:22:53,281 INFO L79 Accepts]: Start accepts. Automaton has 202 states and 218 transitions. Word has length 3 [2025-04-29 11:22:53,281 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:53,283 INFO L485 AbstractCegarLoop]: Abstraction has 202 states and 218 transitions. [2025-04-29 11:22:53,283 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,283 INFO L278 IsEmpty]: Start isEmpty. Operand 202 states and 218 transitions. [2025-04-29 11:22:53,283 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:22:53,283 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:53,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:22:53,284 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:22:53,284 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:22:53,284 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:53,285 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2025-04-29 11:22:53,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:53,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179269887] [2025-04-29 11:22:53,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:53,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:53,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:22:53,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:22:53,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:53,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:53,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:53,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179269887] [2025-04-29 11:22:53,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179269887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:53,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:53,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:53,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523821717] [2025-04-29 11:22:53,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:53,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:53,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:53,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:53,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:53,447 INFO L87 Difference]: Start difference. First operand 202 states and 218 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:53,710 INFO L93 Difference]: Finished difference Result 355 states and 385 transitions. [2025-04-29 11:22:53,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:22:53,711 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:22:53,711 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:53,713 INFO L225 Difference]: With dead ends: 355 [2025-04-29 11:22:53,713 INFO L226 Difference]: Without dead ends: 355 [2025-04-29 11:22:53,713 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:53,714 INFO L437 NwaCegarLoop]: 124 mSDtfsCounter, 470 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:53,714 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 209 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-04-29 11:22:53,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 195. [2025-04-29 11:22:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 109 states have (on average 1.9357798165137614) internal successors, (211), 194 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 211 transitions. [2025-04-29 11:22:53,721 INFO L79 Accepts]: Start accepts. Automaton has 195 states and 211 transitions. Word has length 6 [2025-04-29 11:22:53,721 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:53,721 INFO L485 AbstractCegarLoop]: Abstraction has 195 states and 211 transitions. [2025-04-29 11:22:53,721 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,721 INFO L278 IsEmpty]: Start isEmpty. Operand 195 states and 211 transitions. [2025-04-29 11:22:53,721 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:22:53,721 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:53,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:53,721 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:22:53,721 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:22:53,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:53,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924364, now seen corresponding path program 1 times [2025-04-29 11:22:53,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:53,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029364033] [2025-04-29 11:22:53,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:53,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:53,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:22:53,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:22:53,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:53,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:53,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:53,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029364033] [2025-04-29 11:22:53,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029364033] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:53,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:53,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:22:53,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287151050] [2025-04-29 11:22:53,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:53,844 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:53,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:53,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:53,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:53,845 INFO L87 Difference]: Start difference. First operand 195 states and 211 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:54,039 INFO L93 Difference]: Finished difference Result 194 states and 210 transitions. [2025-04-29 11:22:54,039 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:54,039 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 11:22:54,039 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:54,040 INFO L225 Difference]: With dead ends: 194 [2025-04-29 11:22:54,040 INFO L226 Difference]: Without dead ends: 194 [2025-04-29 11:22:54,040 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:54,040 INFO L437 NwaCegarLoop]: 205 mSDtfsCounter, 3 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:54,041 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 528 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:54,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-04-29 11:22:54,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-04-29 11:22:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 109 states have (on average 1.926605504587156) internal successors, (210), 193 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 210 transitions. [2025-04-29 11:22:54,045 INFO L79 Accepts]: Start accepts. Automaton has 194 states and 210 transitions. Word has length 10 [2025-04-29 11:22:54,045 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:54,045 INFO L485 AbstractCegarLoop]: Abstraction has 194 states and 210 transitions. [2025-04-29 11:22:54,045 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,045 INFO L278 IsEmpty]: Start isEmpty. Operand 194 states and 210 transitions. [2025-04-29 11:22:54,045 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:22:54,045 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:54,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:54,046 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:22:54,046 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:22:54,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:54,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924365, now seen corresponding path program 1 times [2025-04-29 11:22:54,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:54,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599031126] [2025-04-29 11:22:54,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:54,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:54,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:22:54,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:22:54,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:54,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:54,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:54,204 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599031126] [2025-04-29 11:22:54,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599031126] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:54,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:54,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:22:54,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538796457] [2025-04-29 11:22:54,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:54,204 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:54,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:54,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:54,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:54,205 INFO L87 Difference]: Start difference. First operand 194 states and 210 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:54,402 INFO L93 Difference]: Finished difference Result 193 states and 209 transitions. [2025-04-29 11:22:54,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:54,402 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 11:22:54,402 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:54,403 INFO L225 Difference]: With dead ends: 193 [2025-04-29 11:22:54,403 INFO L226 Difference]: Without dead ends: 193 [2025-04-29 11:22:54,403 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:54,404 INFO L437 NwaCegarLoop]: 205 mSDtfsCounter, 2 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:54,404 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 552 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-29 11:22:54,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-04-29 11:22:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 109 states have (on average 1.9174311926605505) internal successors, (209), 192 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 209 transitions. [2025-04-29 11:22:54,413 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 209 transitions. Word has length 10 [2025-04-29 11:22:54,413 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:54,414 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 209 transitions. [2025-04-29 11:22:54,414 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,414 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 209 transitions. [2025-04-29 11:22:54,414 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:22:54,414 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:54,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:54,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:22:54,414 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:22:54,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:54,415 INFO L85 PathProgramCache]: Analyzing trace with hash 191727319, now seen corresponding path program 1 times [2025-04-29 11:22:54,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:54,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150619626] [2025-04-29 11:22:54,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:54,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:54,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:22:54,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:22:54,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:54,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:54,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:54,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150619626] [2025-04-29 11:22:54,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150619626] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:54,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:54,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:22:54,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781751450] [2025-04-29 11:22:54,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:54,588 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:22:54,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:54,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:22:54,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:22:54,589 INFO L87 Difference]: Start difference. First operand 193 states and 209 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:54,983 INFO L93 Difference]: Finished difference Result 357 states and 395 transitions. [2025-04-29 11:22:54,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:22:54,983 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-29 11:22:54,983 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:54,984 INFO L225 Difference]: With dead ends: 357 [2025-04-29 11:22:54,984 INFO L226 Difference]: Without dead ends: 357 [2025-04-29 11:22:54,985 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:22:54,985 INFO L437 NwaCegarLoop]: 154 mSDtfsCounter, 471 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:54,985 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 805 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:22:54,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-04-29 11:22:54,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 198. [2025-04-29 11:22:54,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 114 states have (on average 1.894736842105263) internal successors, (216), 197 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 216 transitions. [2025-04-29 11:22:54,994 INFO L79 Accepts]: Start accepts. Automaton has 198 states and 216 transitions. Word has length 16 [2025-04-29 11:22:54,994 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:54,994 INFO L485 AbstractCegarLoop]: Abstraction has 198 states and 216 transitions. [2025-04-29 11:22:54,994 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,995 INFO L278 IsEmpty]: Start isEmpty. Operand 198 states and 216 transitions. [2025-04-29 11:22:54,995 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:22:54,995 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:54,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:54,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:22:54,995 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:22:54,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:54,995 INFO L85 PathProgramCache]: Analyzing trace with hash 191727320, now seen corresponding path program 1 times [2025-04-29 11:22:54,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:54,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676935478] [2025-04-29 11:22:54,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:54,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:55,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:22:55,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:22:55,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:55,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:55,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:55,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676935478] [2025-04-29 11:22:55,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676935478] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:55,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:55,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:22:55,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418790712] [2025-04-29 11:22:55,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:55,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:22:55,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:55,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:22:55,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:22:55,323 INFO L87 Difference]: Start difference. First operand 198 states and 216 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:55,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:55,898 INFO L93 Difference]: Finished difference Result 356 states and 394 transitions. [2025-04-29 11:22:55,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:22:55,898 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-29 11:22:55,899 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:55,900 INFO L225 Difference]: With dead ends: 356 [2025-04-29 11:22:55,900 INFO L226 Difference]: Without dead ends: 356 [2025-04-29 11:22:55,900 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:22:55,901 INFO L437 NwaCegarLoop]: 138 mSDtfsCounter, 465 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:55,901 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 670 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 11:22:55,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-04-29 11:22:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 198. [2025-04-29 11:22:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 114 states have (on average 1.8859649122807018) internal successors, (215), 197 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 215 transitions. [2025-04-29 11:22:55,906 INFO L79 Accepts]: Start accepts. Automaton has 198 states and 215 transitions. Word has length 16 [2025-04-29 11:22:55,906 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:55,906 INFO L485 AbstractCegarLoop]: Abstraction has 198 states and 215 transitions. [2025-04-29 11:22:55,906 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:55,906 INFO L278 IsEmpty]: Start isEmpty. Operand 198 states and 215 transitions. [2025-04-29 11:22:55,907 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:22:55,908 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:55,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:55,908 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:22:55,908 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:22:55,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:55,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1648579604, now seen corresponding path program 1 times [2025-04-29 11:22:55,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:55,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350529073] [2025-04-29 11:22:55,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:55,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:55,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:22:55,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:22:55,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:55,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:55,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:55,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350529073] [2025-04-29 11:22:55,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350529073] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:55,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:55,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:22:55,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788690159] [2025-04-29 11:22:55,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:55,948 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:55,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:55,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:55,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:55,949 INFO L87 Difference]: Start difference. First operand 198 states and 215 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:56,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:56,048 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2025-04-29 11:22:56,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:56,049 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-29 11:22:56,050 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:56,050 INFO L225 Difference]: With dead ends: 195 [2025-04-29 11:22:56,050 INFO L226 Difference]: Without dead ends: 195 [2025-04-29 11:22:56,051 INFO L436 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-04-29 11:22:56,051 INFO L437 NwaCegarLoop]: 185 mSDtfsCounter, 23 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:56,052 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 279 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-04-29 11:22:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-04-29 11:22:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 114 states have (on average 1.8596491228070176) internal successors, (212), 194 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 212 transitions. [2025-04-29 11:22:56,057 INFO L79 Accepts]: Start accepts. Automaton has 195 states and 212 transitions. Word has length 17 [2025-04-29 11:22:56,057 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:56,057 INFO L485 AbstractCegarLoop]: Abstraction has 195 states and 212 transitions. [2025-04-29 11:22:56,057 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:56,057 INFO L278 IsEmpty]: Start isEmpty. Operand 195 states and 212 transitions. [2025-04-29 11:22:56,057 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:22:56,057 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:56,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:56,058 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:22:56,058 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:22:56,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:56,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1648579605, now seen corresponding path program 1 times [2025-04-29 11:22:56,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:56,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908985491] [2025-04-29 11:22:56,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:56,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:56,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:22:56,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:22:56,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:56,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:56,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:56,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:56,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908985491] [2025-04-29 11:22:56,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908985491] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:56,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:56,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:22:56,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587092052] [2025-04-29 11:22:56,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:56,118 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:56,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:56,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:56,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:56,119 INFO L87 Difference]: Start difference. First operand 195 states and 212 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:56,205 INFO L93 Difference]: Finished difference Result 193 states and 210 transitions. [2025-04-29 11:22:56,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:56,206 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-29 11:22:56,206 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:56,206 INFO L225 Difference]: With dead ends: 193 [2025-04-29 11:22:56,206 INFO L226 Difference]: Without dead ends: 193 [2025-04-29 11:22:56,207 INFO L436 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-04-29 11:22:56,208 INFO L437 NwaCegarLoop]: 190 mSDtfsCounter, 16 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:56,208 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 292 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:56,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-29 11:22:56,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-04-29 11:22:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 114 states have (on average 1.8421052631578947) internal successors, (210), 192 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:56,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 210 transitions. [2025-04-29 11:22:56,212 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 210 transitions. Word has length 17 [2025-04-29 11:22:56,212 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:56,212 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 210 transitions. [2025-04-29 11:22:56,212 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:56,212 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 210 transitions. [2025-04-29 11:22:56,212 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:22:56,212 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:56,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:56,213 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:22:56,213 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:22:56,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:56,213 INFO L85 PathProgramCache]: Analyzing trace with hash -354432464, now seen corresponding path program 1 times [2025-04-29 11:22:56,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:56,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305184828] [2025-04-29 11:22:56,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:56,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:56,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:22:56,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:22:56,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:56,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:56,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:56,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305184828] [2025-04-29 11:22:56,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305184828] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:56,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:56,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:56,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676070687] [2025-04-29 11:22:56,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:56,246 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:56,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:56,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:56,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:56,247 INFO L87 Difference]: Start difference. First operand 193 states and 210 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:56,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:56,433 INFO L93 Difference]: Finished difference Result 254 states and 282 transitions. [2025-04-29 11:22:56,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:56,433 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:22:56,434 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:56,434 INFO L225 Difference]: With dead ends: 254 [2025-04-29 11:22:56,434 INFO L226 Difference]: Without dead ends: 254 [2025-04-29 11:22:56,434 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:56,435 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 268 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:56,435 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 175 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:56,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-04-29 11:22:56,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 182. [2025-04-29 11:22:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 118 states have (on average 1.7203389830508475) internal successors, (203), 181 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 203 transitions. [2025-04-29 11:22:56,438 INFO L79 Accepts]: Start accepts. Automaton has 182 states and 203 transitions. Word has length 18 [2025-04-29 11:22:56,438 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:56,438 INFO L485 AbstractCegarLoop]: Abstraction has 182 states and 203 transitions. [2025-04-29 11:22:56,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:56,439 INFO L278 IsEmpty]: Start isEmpty. Operand 182 states and 203 transitions. [2025-04-29 11:22:56,439 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:22:56,439 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:56,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:56,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:22:56,439 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:22:56,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:56,440 INFO L85 PathProgramCache]: Analyzing trace with hash -354432463, now seen corresponding path program 1 times [2025-04-29 11:22:56,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:56,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761427569] [2025-04-29 11:22:56,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:56,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:56,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:22:56,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:22:56,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:56,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:56,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:56,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761427569] [2025-04-29 11:22:56,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761427569] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:56,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:56,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:22:56,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293683695] [2025-04-29 11:22:56,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:56,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:56,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:56,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:56,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:56,511 INFO L87 Difference]: Start difference. First operand 182 states and 203 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:56,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:56,773 INFO L93 Difference]: Finished difference Result 421 states and 478 transitions. [2025-04-29 11:22:56,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:22:56,774 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:22:56,774 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:56,775 INFO L225 Difference]: With dead ends: 421 [2025-04-29 11:22:56,775 INFO L226 Difference]: Without dead ends: 421 [2025-04-29 11:22:56,775 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:22:56,776 INFO L437 NwaCegarLoop]: 139 mSDtfsCounter, 665 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:56,776 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 325 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-04-29 11:22:56,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 330. [2025-04-29 11:22:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 266 states have (on average 1.7255639097744362) internal successors, (459), 329 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 459 transitions. [2025-04-29 11:22:56,786 INFO L79 Accepts]: Start accepts. Automaton has 330 states and 459 transitions. Word has length 18 [2025-04-29 11:22:56,787 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:56,787 INFO L485 AbstractCegarLoop]: Abstraction has 330 states and 459 transitions. [2025-04-29 11:22:56,787 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:56,787 INFO L278 IsEmpty]: Start isEmpty. Operand 330 states and 459 transitions. [2025-04-29 11:22:56,788 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:22:56,788 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:56,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:56,788 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:22:56,788 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:22:56,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:56,789 INFO L85 PathProgramCache]: Analyzing trace with hash -354422129, now seen corresponding path program 1 times [2025-04-29 11:22:56,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:56,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617521306] [2025-04-29 11:22:56,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:56,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:56,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:22:56,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:22:56,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:56,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:56,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:56,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:56,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617521306] [2025-04-29 11:22:56,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617521306] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:56,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:56,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:56,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148874829] [2025-04-29 11:22:56,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:56,812 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:56,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:56,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:56,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:56,813 INFO L87 Difference]: Start difference. First operand 330 states and 459 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:56,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:56,831 INFO L93 Difference]: Finished difference Result 405 states and 538 transitions. [2025-04-29 11:22:56,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:56,831 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:22:56,831 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:56,833 INFO L225 Difference]: With dead ends: 405 [2025-04-29 11:22:56,833 INFO L226 Difference]: Without dead ends: 405 [2025-04-29 11:22:56,833 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:56,834 INFO L437 NwaCegarLoop]: 222 mSDtfsCounter, 170 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:56,834 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 302 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:56,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-04-29 11:22:56,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 371. [2025-04-29 11:22:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 307 states have (on average 1.752442996742671) internal successors, (538), 370 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 538 transitions. [2025-04-29 11:22:56,845 INFO L79 Accepts]: Start accepts. Automaton has 371 states and 538 transitions. Word has length 18 [2025-04-29 11:22:56,845 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:56,845 INFO L485 AbstractCegarLoop]: Abstraction has 371 states and 538 transitions. [2025-04-29 11:22:56,845 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:56,845 INFO L278 IsEmpty]: Start isEmpty. Operand 371 states and 538 transitions. [2025-04-29 11:22:56,846 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:22:56,846 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:56,847 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] [2025-04-29 11:22:56,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:22:56,847 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:22:56,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:56,847 INFO L85 PathProgramCache]: Analyzing trace with hash -116033059, now seen corresponding path program 1 times [2025-04-29 11:22:56,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:56,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631156023] [2025-04-29 11:22:56,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:56,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:56,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:22:56,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:22:56,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:56,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:56,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:56,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631156023] [2025-04-29 11:22:56,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631156023] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:56,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:56,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:22:56,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523952823] [2025-04-29 11:22:56,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:56,954 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:22:56,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:56,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:22:56,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:22:56,954 INFO L87 Difference]: Start difference. First operand 371 states and 538 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:57,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:57,231 INFO L93 Difference]: Finished difference Result 505 states and 739 transitions. [2025-04-29 11:22:57,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:22:57,231 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:22:57,231 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:57,233 INFO L225 Difference]: With dead ends: 505 [2025-04-29 11:22:57,233 INFO L226 Difference]: Without dead ends: 505 [2025-04-29 11:22:57,233 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:22:57,233 INFO L437 NwaCegarLoop]: 147 mSDtfsCounter, 180 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:57,233 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 693 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-04-29 11:22:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 370. [2025-04-29 11:22:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 307 states have (on average 1.749185667752443) internal successors, (537), 369 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 537 transitions. [2025-04-29 11:22:57,240 INFO L79 Accepts]: Start accepts. Automaton has 370 states and 537 transitions. Word has length 20 [2025-04-29 11:22:57,240 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:57,240 INFO L485 AbstractCegarLoop]: Abstraction has 370 states and 537 transitions. [2025-04-29 11:22:57,240 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:57,240 INFO L278 IsEmpty]: Start isEmpty. Operand 370 states and 537 transitions. [2025-04-29 11:22:57,241 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:22:57,241 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:57,241 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] [2025-04-29 11:22:57,241 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:22:57,241 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:22:57,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:57,241 INFO L85 PathProgramCache]: Analyzing trace with hash -116033058, now seen corresponding path program 1 times [2025-04-29 11:22:57,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:57,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940037965] [2025-04-29 11:22:57,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:57,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:57,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:22:57,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:22:57,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:57,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:57,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:57,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:57,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940037965] [2025-04-29 11:22:57,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940037965] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:57,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:57,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 11:22:57,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133709765] [2025-04-29 11:22:57,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:57,490 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:22:57,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:57,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:22:57,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:22:57,491 INFO L87 Difference]: Start difference. First operand 370 states and 537 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:58,016 INFO L93 Difference]: Finished difference Result 657 states and 935 transitions. [2025-04-29 11:22:58,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:22:58,016 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:22:58,016 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:58,018 INFO L225 Difference]: With dead ends: 657 [2025-04-29 11:22:58,018 INFO L226 Difference]: Without dead ends: 657 [2025-04-29 11:22:58,019 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:22:58,019 INFO L437 NwaCegarLoop]: 149 mSDtfsCounter, 309 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:58,019 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1215 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:22:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-04-29 11:22:58,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 374. [2025-04-29 11:22:58,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 311 states have (on average 1.7395498392282958) internal successors, (541), 373 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 541 transitions. [2025-04-29 11:22:58,042 INFO L79 Accepts]: Start accepts. Automaton has 374 states and 541 transitions. Word has length 20 [2025-04-29 11:22:58,042 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:58,042 INFO L485 AbstractCegarLoop]: Abstraction has 374 states and 541 transitions. [2025-04-29 11:22:58,042 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,042 INFO L278 IsEmpty]: Start isEmpty. Operand 374 states and 541 transitions. [2025-04-29 11:22:58,043 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:22:58,043 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:58,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:58,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:22:58,043 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:22:58,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:58,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1458623087, now seen corresponding path program 1 times [2025-04-29 11:22:58,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:58,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928815473] [2025-04-29 11:22:58,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:58,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:58,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:22:58,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:22:58,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:58,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:58,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:58,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928815473] [2025-04-29 11:22:58,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928815473] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:58,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:58,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:58,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966941817] [2025-04-29 11:22:58,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:58,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:58,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:58,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:58,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:58,070 INFO L87 Difference]: Start difference. First operand 374 states and 541 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:58,079 INFO L93 Difference]: Finished difference Result 378 states and 545 transitions. [2025-04-29 11:22:58,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:58,080 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-29 11:22:58,081 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:58,082 INFO L225 Difference]: With dead ends: 378 [2025-04-29 11:22:58,082 INFO L226 Difference]: Without dead ends: 378 [2025-04-29 11:22:58,084 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:58,084 INFO L437 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:58,084 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 368 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-04-29 11:22:58,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2025-04-29 11:22:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 315 states have (on average 1.7301587301587302) internal successors, (545), 377 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 545 transitions. [2025-04-29 11:22:58,092 INFO L79 Accepts]: Start accepts. Automaton has 378 states and 545 transitions. Word has length 23 [2025-04-29 11:22:58,092 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:58,093 INFO L485 AbstractCegarLoop]: Abstraction has 378 states and 545 transitions. [2025-04-29 11:22:58,093 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,093 INFO L278 IsEmpty]: Start isEmpty. Operand 378 states and 545 transitions. [2025-04-29 11:22:58,095 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:22:58,095 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:58,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:58,095 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:22:58,095 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:22:58,096 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:58,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1625453258, now seen corresponding path program 1 times [2025-04-29 11:22:58,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:58,096 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924564978] [2025-04-29 11:22:58,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:58,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:58,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:22:58,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:22:58,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:58,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:58,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:58,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924564978] [2025-04-29 11:22:58,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924564978] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:58,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:58,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:58,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791770333] [2025-04-29 11:22:58,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:58,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:58,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:58,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:58,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:58,131 INFO L87 Difference]: Start difference. First operand 378 states and 545 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:58,147 INFO L93 Difference]: Finished difference Result 375 states and 526 transitions. [2025-04-29 11:22:58,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:58,148 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-29 11:22:58,148 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:58,149 INFO L225 Difference]: With dead ends: 375 [2025-04-29 11:22:58,149 INFO L226 Difference]: Without dead ends: 375 [2025-04-29 11:22:58,149 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:58,150 INFO L437 NwaCegarLoop]: 190 mSDtfsCounter, 5 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:58,150 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 363 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-04-29 11:22:58,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2025-04-29 11:22:58,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 304 states have (on average 1.7138157894736843) internal successors, (521), 366 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 521 transitions. [2025-04-29 11:22:58,158 INFO L79 Accepts]: Start accepts. Automaton has 367 states and 521 transitions. Word has length 25 [2025-04-29 11:22:58,158 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:58,158 INFO L485 AbstractCegarLoop]: Abstraction has 367 states and 521 transitions. [2025-04-29 11:22:58,158 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,158 INFO L278 IsEmpty]: Start isEmpty. Operand 367 states and 521 transitions. [2025-04-29 11:22:58,158 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:22:58,158 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:58,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:58,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:22:58,159 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:22:58,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:58,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1582542525, now seen corresponding path program 1 times [2025-04-29 11:22:58,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:58,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479273156] [2025-04-29 11:22:58,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:58,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:58,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:22:58,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:22:58,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:58,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:58,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:58,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479273156] [2025-04-29 11:22:58,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479273156] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:58,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:58,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:58,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739809798] [2025-04-29 11:22:58,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:58,183 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:58,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:58,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:58,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:58,183 INFO L87 Difference]: Start difference. First operand 367 states and 521 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:58,192 INFO L93 Difference]: Finished difference Result 370 states and 524 transitions. [2025-04-29 11:22:58,192 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:58,192 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-29 11:22:58,192 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:58,193 INFO L225 Difference]: With dead ends: 370 [2025-04-29 11:22:58,193 INFO L226 Difference]: Without dead ends: 370 [2025-04-29 11:22:58,193 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:58,194 INFO L437 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:58,194 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 368 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:58,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-04-29 11:22:58,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-04-29 11:22:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 307 states have (on average 1.706840390879479) internal successors, (524), 369 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 524 transitions. [2025-04-29 11:22:58,202 INFO L79 Accepts]: Start accepts. Automaton has 370 states and 524 transitions. Word has length 26 [2025-04-29 11:22:58,203 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:58,203 INFO L485 AbstractCegarLoop]: Abstraction has 370 states and 524 transitions. [2025-04-29 11:22:58,203 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,203 INFO L278 IsEmpty]: Start isEmpty. Operand 370 states and 524 transitions. [2025-04-29 11:22:58,204 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:22:58,204 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:58,204 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:58,204 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:22:58,204 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:22:58,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:58,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1245483444, now seen corresponding path program 1 times [2025-04-29 11:22:58,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:58,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285677474] [2025-04-29 11:22:58,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:58,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:58,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:22:58,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:22:58,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:58,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:58,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:58,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285677474] [2025-04-29 11:22:58,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285677474] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:58,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372918172] [2025-04-29 11:22:58,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:58,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:58,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:58,516 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-04-29 11:22:58,518 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-04-29 11:22:58,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:22:58,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:22:58,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:58,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:58,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-29 11:22:58,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:58,621 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:22:58,658 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:22:58,658 INFO L354 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-04-29 11:22:58,685 INFO L354 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-04-29 11:22:58,743 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:22:58,744 INFO L354 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-04-29 11:22:58,765 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:22:58,766 INFO L354 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-04-29 11:22:58,801 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2025-04-29 11:22:58,836 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:22:58,836 INFO L354 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-04-29 11:22:58,861 INFO L325 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-04-29 11:22:58,862 INFO L354 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 1 case distinctions, treesize of input 18 treesize of output 20 [2025-04-29 11:22:58,882 INFO L354 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-04-29 11:22:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:58,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:58,940 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_378) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) 1)) is different from false [2025-04-29 11:22:58,949 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_377))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_378)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) 1)) is different from false [2025-04-29 11:22:58,959 INFO L325 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-04-29 11:22:58,959 INFO L354 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 33 treesize of output 32 [2025-04-29 11:22:58,964 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_377))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_378)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem6#1.base|)) is different from false [2025-04-29 11:22:58,970 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_377))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_378)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) is different from false [2025-04-29 11:22:59,123 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:22:59,124 INFO L354 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 69 treesize of output 50 [2025-04-29 11:22:59,126 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:22:59,129 INFO L354 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 442 treesize of output 352 [2025-04-29 11:22:59,142 INFO L354 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-04-29 11:22:59,144 INFO L354 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-04-29 11:22:59,149 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:22:59,149 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:22:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-29 11:22:59,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372918172] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:59,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:59,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 27 [2025-04-29 11:22:59,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527368459] [2025-04-29 11:22:59,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:59,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-29 11:22:59,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:59,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-29 11:22:59,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=467, Unknown=20, NotChecked=188, Total=756 [2025-04-29 11:22:59,175 INFO L87 Difference]: Start difference. First operand 370 states and 524 transitions. Second operand has 28 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 28 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:59,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:59,991 INFO L93 Difference]: Finished difference Result 595 states and 820 transitions. [2025-04-29 11:22:59,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:22:59,992 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 28 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-29 11:22:59,992 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:59,994 INFO L225 Difference]: With dead ends: 595 [2025-04-29 11:22:59,994 INFO L226 Difference]: Without dead ends: 595 [2025-04-29 11:22:59,994 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=799, Unknown=20, NotChecked=252, Total=1260 [2025-04-29 11:22:59,995 INFO L437 NwaCegarLoop]: 147 mSDtfsCounter, 727 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1151 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:59,995 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1881 Invalid, 2428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1247 Invalid, 0 Unknown, 1151 Unchecked, 0.6s Time] [2025-04-29 11:22:59,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-04-29 11:23:00,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 369. [2025-04-29 11:23:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 307 states have (on average 1.703583061889251) internal successors, (523), 368 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 523 transitions. [2025-04-29 11:23:00,003 INFO L79 Accepts]: Start accepts. Automaton has 369 states and 523 transitions. Word has length 26 [2025-04-29 11:23:00,003 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:00,003 INFO L485 AbstractCegarLoop]: Abstraction has 369 states and 523 transitions. [2025-04-29 11:23:00,003 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 28 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:00,003 INFO L278 IsEmpty]: Start isEmpty. Operand 369 states and 523 transitions. [2025-04-29 11:23:00,003 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:23:00,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:00,004 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:00,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:23:00,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-29 11:23:00,208 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:23:00,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:00,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1245483443, now seen corresponding path program 1 times [2025-04-29 11:23:00,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:00,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934597732] [2025-04-29 11:23:00,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:00,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:00,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:23:00,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:23:00,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:00,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:00,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:00,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934597732] [2025-04-29 11:23:00,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934597732] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:00,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996183824] [2025-04-29 11:23:00,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:00,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:00,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:00,755 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-04-29 11:23:00,758 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-04-29 11:23:00,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:23:00,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:23:00,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:00,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:00,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-29 11:23:00,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:00,837 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:23:00,853 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:23:00,860 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:23:00,861 INFO L354 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-04-29 11:23:00,901 INFO L354 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-04-29 11:23:00,907 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:23:00,986 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:00,986 INFO L354 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-04-29 11:23:00,992 INFO L354 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-04-29 11:23:01,058 INFO L325 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2025-04-29 11:23:01,058 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2025-04-29 11:23:01,068 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-29 11:23:01,117 INFO L354 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 40 treesize of output 31 [2025-04-29 11:23:01,125 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:23:01,201 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:01,202 INFO L354 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-04-29 11:23:01,206 INFO L354 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-04-29 11:23:01,261 INFO L325 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-04-29 11:23:01,261 INFO L354 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 1 case distinctions, treesize of input 18 treesize of output 20 [2025-04-29 11:23:01,299 INFO L354 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-04-29 11:23:01,303 INFO L354 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-04-29 11:23:01,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:01,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:01,534 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_ArrVal_453 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_453))) (or (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_454))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (<= (+ (select (select (store .cse0 .cse1 v_ArrVal_455) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) 4) (select (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| 4) (select (select (store .cse3 .cse1 v_ArrVal_456) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)))))) (< (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) 0)))) (forall ((v_ArrVal_453 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_453))) (or (forall ((v_ArrVal_454 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (<= 0 (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_454) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_455) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (< (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) 0)))))) is different from false [2025-04-29 11:23:02,140 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:02,141 INFO L354 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 222 treesize of output 193 [2025-04-29 11:23:02,151 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:02,152 INFO L354 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 184 treesize of output 155 [2025-04-29 11:23:02,159 INFO L354 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 2270 treesize of output 2132 [2025-04-29 11:23:02,190 INFO L354 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 6855 treesize of output 6663 [2025-04-29 11:23:02,217 INFO L354 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 487 treesize of output 475 [2025-04-29 11:23:02,225 INFO L354 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 475 treesize of output 463 [2025-04-29 11:23:02,232 INFO L354 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 463 treesize of output 451 [2025-04-29 11:23:02,240 INFO L354 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 451 treesize of output 443 [2025-04-29 11:23:02,250 INFO L354 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 443 treesize of output 419 [2025-04-29 11:23:02,259 INFO L354 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 419 treesize of output 403 [2025-04-29 11:23:02,311 INFO L325 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2025-04-29 11:23:02,311 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 416 treesize of output 448 [2025-04-29 11:23:02,331 INFO L354 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 399 treesize of output 391 [2025-04-29 11:23:02,340 INFO L354 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 391 treesize of output 379 [2025-04-29 11:23:02,349 INFO L354 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 379 treesize of output 371 [2025-04-29 11:23:02,362 INFO L354 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 371 treesize of output 355 [2025-04-29 11:23:02,371 INFO L354 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 355 treesize of output 339 [2025-04-29 11:23:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-29 11:23:06,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996183824] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:06,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:06,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 33 [2025-04-29 11:23:06,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662744105] [2025-04-29 11:23:06,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:06,705 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-29 11:23:06,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:06,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-29 11:23:06,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=912, Unknown=2, NotChecked=62, Total=1122 [2025-04-29 11:23:06,707 INFO L87 Difference]: Start difference. First operand 369 states and 523 transitions. Second operand has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:08,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:08,461 INFO L93 Difference]: Finished difference Result 594 states and 819 transitions. [2025-04-29 11:23:08,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:23:08,461 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-29 11:23:08,461 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:08,463 INFO L225 Difference]: With dead ends: 594 [2025-04-29 11:23:08,463 INFO L226 Difference]: Without dead ends: 594 [2025-04-29 11:23:08,464 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=299, Invalid=1343, Unknown=2, NotChecked=78, Total=1722 [2025-04-29 11:23:08,464 INFO L437 NwaCegarLoop]: 130 mSDtfsCounter, 1194 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 334 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:08,464 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 1564 Invalid, 2604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2216 Invalid, 0 Unknown, 334 Unchecked, 1.4s Time] [2025-04-29 11:23:08,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-04-29 11:23:08,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 368. [2025-04-29 11:23:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 307 states have (on average 1.700325732899023) internal successors, (522), 367 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 522 transitions. [2025-04-29 11:23:08,471 INFO L79 Accepts]: Start accepts. Automaton has 368 states and 522 transitions. Word has length 26 [2025-04-29 11:23:08,471 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:08,471 INFO L485 AbstractCegarLoop]: Abstraction has 368 states and 522 transitions. [2025-04-29 11:23:08,471 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:08,471 INFO L278 IsEmpty]: Start isEmpty. Operand 368 states and 522 transitions. [2025-04-29 11:23:08,471 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:23:08,472 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:08,472 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-04-29 11:23:08,481 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-04-29 11:23:08,672 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:08,672 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:23:08,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:08,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1650677872, now seen corresponding path program 1 times [2025-04-29 11:23:08,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:08,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25882668] [2025-04-29 11:23:08,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:08,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:08,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:23:08,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:23:08,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:08,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:08,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:08,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:08,938 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25882668] [2025-04-29 11:23:08,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25882668] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:08,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:08,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:23:08,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232637516] [2025-04-29 11:23:08,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:08,939 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:23:08,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:08,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:23:08,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:23:08,939 INFO L87 Difference]: Start difference. First operand 368 states and 522 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:09,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:09,349 INFO L93 Difference]: Finished difference Result 611 states and 799 transitions. [2025-04-29 11:23:09,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:23:09,349 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-29 11:23:09,349 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:09,351 INFO L225 Difference]: With dead ends: 611 [2025-04-29 11:23:09,351 INFO L226 Difference]: Without dead ends: 611 [2025-04-29 11:23:09,351 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:23:09,352 INFO L437 NwaCegarLoop]: 164 mSDtfsCounter, 575 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:09,352 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 971 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:23:09,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-04-29 11:23:09,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 458. [2025-04-29 11:23:09,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 397 states have (on average 1.6775818639798488) internal successors, (666), 457 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 666 transitions. [2025-04-29 11:23:09,362 INFO L79 Accepts]: Start accepts. Automaton has 458 states and 666 transitions. Word has length 27 [2025-04-29 11:23:09,362 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:09,362 INFO L485 AbstractCegarLoop]: Abstraction has 458 states and 666 transitions. [2025-04-29 11:23:09,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:09,362 INFO L278 IsEmpty]: Start isEmpty. Operand 458 states and 666 transitions. [2025-04-29 11:23:09,362 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:23:09,362 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:09,363 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-04-29 11:23:09,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:23:09,363 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:23:09,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:09,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1306981328, now seen corresponding path program 1 times [2025-04-29 11:23:09,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:09,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339797132] [2025-04-29 11:23:09,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:09,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:09,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:23:09,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:23:09,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:09,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:09,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:09,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339797132] [2025-04-29 11:23:09,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339797132] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:09,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:09,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:23:09,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725724553] [2025-04-29 11:23:09,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:09,521 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:23:09,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:09,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:23:09,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:23:09,521 INFO L87 Difference]: Start difference. First operand 458 states and 666 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:10,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:10,005 INFO L93 Difference]: Finished difference Result 674 states and 941 transitions. [2025-04-29 11:23:10,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:23:10,006 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-29 11:23:10,006 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:10,008 INFO L225 Difference]: With dead ends: 674 [2025-04-29 11:23:10,008 INFO L226 Difference]: Without dead ends: 674 [2025-04-29 11:23:10,008 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:23:10,009 INFO L437 NwaCegarLoop]: 135 mSDtfsCounter, 899 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:10,009 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 924 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:23:10,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-04-29 11:23:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 467. [2025-04-29 11:23:10,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 406 states have (on average 1.667487684729064) internal successors, (677), 466 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 677 transitions. [2025-04-29 11:23:10,017 INFO L79 Accepts]: Start accepts. Automaton has 467 states and 677 transitions. Word has length 27 [2025-04-29 11:23:10,017 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:10,017 INFO L485 AbstractCegarLoop]: Abstraction has 467 states and 677 transitions. [2025-04-29 11:23:10,017 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:10,017 INFO L278 IsEmpty]: Start isEmpty. Operand 467 states and 677 transitions. [2025-04-29 11:23:10,017 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:23:10,017 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:10,017 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-04-29 11:23:10,018 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:23:10,018 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:23:10,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:10,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1306981327, now seen corresponding path program 1 times [2025-04-29 11:23:10,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:10,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271565050] [2025-04-29 11:23:10,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:10,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:10,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:23:10,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:23:10,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:10,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:10,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:10,335 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271565050] [2025-04-29 11:23:10,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271565050] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:10,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:10,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:23:10,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675243243] [2025-04-29 11:23:10,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:10,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:23:10,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:10,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:23:10,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:23:10,336 INFO L87 Difference]: Start difference. First operand 467 states and 677 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:10,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:10,876 INFO L93 Difference]: Finished difference Result 535 states and 745 transitions. [2025-04-29 11:23:10,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:23:10,879 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-29 11:23:10,879 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:10,881 INFO L225 Difference]: With dead ends: 535 [2025-04-29 11:23:10,881 INFO L226 Difference]: Without dead ends: 535 [2025-04-29 11:23:10,881 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:23:10,882 INFO L437 NwaCegarLoop]: 130 mSDtfsCounter, 699 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:10,882 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 845 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:23:10,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-04-29 11:23:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 467. [2025-04-29 11:23:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 406 states have (on average 1.6650246305418719) internal successors, (676), 466 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 676 transitions. [2025-04-29 11:23:10,893 INFO L79 Accepts]: Start accepts. Automaton has 467 states and 676 transitions. Word has length 27 [2025-04-29 11:23:10,893 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:10,893 INFO L485 AbstractCegarLoop]: Abstraction has 467 states and 676 transitions. [2025-04-29 11:23:10,893 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:10,893 INFO L278 IsEmpty]: Start isEmpty. Operand 467 states and 676 transitions. [2025-04-29 11:23:10,893 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:23:10,893 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:10,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:10,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:23:10,893 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:23:10,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:10,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1311422610, now seen corresponding path program 1 times [2025-04-29 11:23:10,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:10,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53785860] [2025-04-29 11:23:10,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:10,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:10,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:23:10,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:23:10,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:10,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:10,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:10,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53785860] [2025-04-29 11:23:10,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53785860] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:10,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:10,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:23:10,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325714833] [2025-04-29 11:23:10,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:10,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:10,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:10,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:10,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:10,926 INFO L87 Difference]: Start difference. First operand 467 states and 676 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:11,002 INFO L93 Difference]: Finished difference Result 462 states and 671 transitions. [2025-04-29 11:23:11,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:11,002 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-29 11:23:11,002 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:11,003 INFO L225 Difference]: With dead ends: 462 [2025-04-29 11:23:11,003 INFO L226 Difference]: Without dead ends: 462 [2025-04-29 11:23:11,004 INFO L436 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-04-29 11:23:11,004 INFO L437 NwaCegarLoop]: 168 mSDtfsCounter, 8 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:11,004 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 265 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:11,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-04-29 11:23:11,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2025-04-29 11:23:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 406 states have (on average 1.6527093596059113) internal successors, (671), 461 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:11,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 671 transitions. [2025-04-29 11:23:11,010 INFO L79 Accepts]: Start accepts. Automaton has 462 states and 671 transitions. Word has length 28 [2025-04-29 11:23:11,010 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:11,010 INFO L485 AbstractCegarLoop]: Abstraction has 462 states and 671 transitions. [2025-04-29 11:23:11,010 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:11,010 INFO L278 IsEmpty]: Start isEmpty. Operand 462 states and 671 transitions. [2025-04-29 11:23:11,010 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:23:11,010 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:11,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:11,010 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:23:11,010 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:23:11,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:11,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1311422609, now seen corresponding path program 1 times [2025-04-29 11:23:11,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:11,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893588548] [2025-04-29 11:23:11,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:11,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:11,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:23:11,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:23:11,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:11,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:11,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:11,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893588548] [2025-04-29 11:23:11,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893588548] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:11,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:11,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:23:11,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503296911] [2025-04-29 11:23:11,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:11,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:11,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:11,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:11,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:11,057 INFO L87 Difference]: Start difference. First operand 462 states and 671 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:11,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:11,141 INFO L93 Difference]: Finished difference Result 460 states and 669 transitions. [2025-04-29 11:23:11,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:11,142 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-29 11:23:11,142 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:11,143 INFO L225 Difference]: With dead ends: 460 [2025-04-29 11:23:11,143 INFO L226 Difference]: Without dead ends: 460 [2025-04-29 11:23:11,143 INFO L436 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-04-29 11:23:11,144 INFO L437 NwaCegarLoop]: 172 mSDtfsCounter, 5 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:11,144 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 263 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:11,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-04-29 11:23:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2025-04-29 11:23:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 406 states have (on average 1.6477832512315271) internal successors, (669), 459 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:11,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 669 transitions. [2025-04-29 11:23:11,150 INFO L79 Accepts]: Start accepts. Automaton has 460 states and 669 transitions. Word has length 28 [2025-04-29 11:23:11,150 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:11,150 INFO L485 AbstractCegarLoop]: Abstraction has 460 states and 669 transitions. [2025-04-29 11:23:11,151 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:11,151 INFO L278 IsEmpty]: Start isEmpty. Operand 460 states and 669 transitions. [2025-04-29 11:23:11,151 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:23:11,151 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:11,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:11,151 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-29 11:23:11,151 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:23:11,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:11,151 INFO L85 PathProgramCache]: Analyzing trace with hash -807259654, now seen corresponding path program 1 times [2025-04-29 11:23:11,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:11,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159955195] [2025-04-29 11:23:11,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:11,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:11,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:23:11,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:23:11,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:11,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:11,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:11,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:11,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159955195] [2025-04-29 11:23:11,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159955195] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:11,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:11,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:23:11,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832640444] [2025-04-29 11:23:11,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:11,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:23:11,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:11,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:23:11,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:23:11,349 INFO L87 Difference]: Start difference. First operand 460 states and 669 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:11,703 INFO L93 Difference]: Finished difference Result 567 states and 745 transitions. [2025-04-29 11:23:11,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:23:11,703 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-29 11:23:11,703 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:11,704 INFO L225 Difference]: With dead ends: 567 [2025-04-29 11:23:11,704 INFO L226 Difference]: Without dead ends: 567 [2025-04-29 11:23:11,705 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:23:11,705 INFO L437 NwaCegarLoop]: 162 mSDtfsCounter, 433 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:11,705 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 926 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:23:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-04-29 11:23:11,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 431. [2025-04-29 11:23:11,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 377 states have (on average 1.6525198938992043) internal successors, (623), 430 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:11,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 623 transitions. [2025-04-29 11:23:11,715 INFO L79 Accepts]: Start accepts. Automaton has 431 states and 623 transitions. Word has length 28 [2025-04-29 11:23:11,715 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:11,715 INFO L485 AbstractCegarLoop]: Abstraction has 431 states and 623 transitions. [2025-04-29 11:23:11,715 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:11,715 INFO L278 IsEmpty]: Start isEmpty. Operand 431 states and 623 transitions. [2025-04-29 11:23:11,715 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:23:11,715 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:11,715 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:11,715 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-29 11:23:11,715 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:23:11,715 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:11,716 INFO L85 PathProgramCache]: Analyzing trace with hash -544779445, now seen corresponding path program 1 times [2025-04-29 11:23:11,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:11,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139506777] [2025-04-29 11:23:11,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:11,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:11,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:23:11,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:23:11,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:11,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:11,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:11,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:11,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139506777] [2025-04-29 11:23:11,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139506777] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:11,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:11,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:23:11,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736325958] [2025-04-29 11:23:11,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:11,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:23:11,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:11,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:23:11,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:23:11,781 INFO L87 Difference]: Start difference. First operand 431 states and 623 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:11,965 INFO L93 Difference]: Finished difference Result 517 states and 768 transitions. [2025-04-29 11:23:11,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:23:11,966 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-29 11:23:11,966 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:11,967 INFO L225 Difference]: With dead ends: 517 [2025-04-29 11:23:11,967 INFO L226 Difference]: Without dead ends: 517 [2025-04-29 11:23:11,967 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:23:11,967 INFO L437 NwaCegarLoop]: 149 mSDtfsCounter, 40 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:11,967 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 547 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:11,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-04-29 11:23:11,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 445. [2025-04-29 11:23:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 391 states have (on average 1.6368286445012787) internal successors, (640), 444 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:11,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 640 transitions. [2025-04-29 11:23:11,974 INFO L79 Accepts]: Start accepts. Automaton has 445 states and 640 transitions. Word has length 29 [2025-04-29 11:23:11,974 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:11,974 INFO L485 AbstractCegarLoop]: Abstraction has 445 states and 640 transitions. [2025-04-29 11:23:11,974 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:11,974 INFO L278 IsEmpty]: Start isEmpty. Operand 445 states and 640 transitions. [2025-04-29 11:23:11,975 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:23:11,975 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:11,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:11,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-29 11:23:11,975 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:23:11,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:11,975 INFO L85 PathProgramCache]: Analyzing trace with hash -544594747, now seen corresponding path program 1 times [2025-04-29 11:23:11,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:11,975 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060436046] [2025-04-29 11:23:11,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:11,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:11,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:23:11,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:23:11,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:11,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:12,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:12,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060436046] [2025-04-29 11:23:12,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060436046] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:12,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:12,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:23:12,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155760243] [2025-04-29 11:23:12,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:12,232 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:23:12,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:12,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:23:12,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:23:12,232 INFO L87 Difference]: Start difference. First operand 445 states and 640 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:12,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:12,693 INFO L93 Difference]: Finished difference Result 564 states and 778 transitions. [2025-04-29 11:23:12,693 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:23:12,693 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-29 11:23:12,694 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:12,695 INFO L225 Difference]: With dead ends: 564 [2025-04-29 11:23:12,695 INFO L226 Difference]: Without dead ends: 564 [2025-04-29 11:23:12,695 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:23:12,696 INFO L437 NwaCegarLoop]: 142 mSDtfsCounter, 530 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:12,696 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 683 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:23:12,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-04-29 11:23:12,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 401. [2025-04-29 11:23:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 347 states have (on average 1.622478386167147) internal successors, (563), 400 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 563 transitions. [2025-04-29 11:23:12,701 INFO L79 Accepts]: Start accepts. Automaton has 401 states and 563 transitions. Word has length 29 [2025-04-29 11:23:12,701 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:12,701 INFO L485 AbstractCegarLoop]: Abstraction has 401 states and 563 transitions. [2025-04-29 11:23:12,701 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:12,702 INFO L278 IsEmpty]: Start isEmpty. Operand 401 states and 563 transitions. [2025-04-29 11:23:12,702 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:23:12,702 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:12,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:12,702 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-29 11:23:12,702 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:23:12,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:12,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1893013455, now seen corresponding path program 1 times [2025-04-29 11:23:12,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:12,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939552850] [2025-04-29 11:23:12,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:12,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:12,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:23:12,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:23:12,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:12,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:12,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:12,737 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939552850] [2025-04-29 11:23:12,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939552850] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:12,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:12,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:23:12,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843342425] [2025-04-29 11:23:12,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:12,737 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:23:12,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:12,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:23:12,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:12,738 INFO L87 Difference]: Start difference. First operand 401 states and 563 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:12,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:12,903 INFO L93 Difference]: Finished difference Result 400 states and 559 transitions. [2025-04-29 11:23:12,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:23:12,903 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-29 11:23:12,903 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:12,904 INFO L225 Difference]: With dead ends: 400 [2025-04-29 11:23:12,904 INFO L226 Difference]: Without dead ends: 400 [2025-04-29 11:23:12,904 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:23:12,904 INFO L437 NwaCegarLoop]: 161 mSDtfsCounter, 17 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:12,904 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 408 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-04-29 11:23:12,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-04-29 11:23:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 347 states have (on average 1.6109510086455332) internal successors, (559), 399 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 559 transitions. [2025-04-29 11:23:12,909 INFO L79 Accepts]: Start accepts. Automaton has 400 states and 559 transitions. Word has length 30 [2025-04-29 11:23:12,909 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:12,909 INFO L485 AbstractCegarLoop]: Abstraction has 400 states and 559 transitions. [2025-04-29 11:23:12,909 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:12,909 INFO L278 IsEmpty]: Start isEmpty. Operand 400 states and 559 transitions. [2025-04-29 11:23:12,909 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:23:12,909 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:12,910 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:12,910 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-29 11:23:12,910 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:23:12,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:12,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1893013456, now seen corresponding path program 1 times [2025-04-29 11:23:12,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:12,910 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153147487] [2025-04-29 11:23:12,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:12,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:12,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:23:12,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:23:12,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:12,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:12,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:12,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:12,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153147487] [2025-04-29 11:23:12,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153147487] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:12,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:12,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:23:12,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236868169] [2025-04-29 11:23:12,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:12,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:23:12,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:12,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:23:12,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:12,972 INFO L87 Difference]: Start difference. First operand 400 states and 559 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:13,163 INFO L93 Difference]: Finished difference Result 399 states and 555 transitions. [2025-04-29 11:23:13,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:23:13,163 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-29 11:23:13,163 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:13,164 INFO L225 Difference]: With dead ends: 399 [2025-04-29 11:23:13,164 INFO L226 Difference]: Without dead ends: 399 [2025-04-29 11:23:13,164 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:23:13,165 INFO L437 NwaCegarLoop]: 161 mSDtfsCounter, 17 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:13,165 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 398 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:13,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-04-29 11:23:13,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2025-04-29 11:23:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 347 states have (on average 1.5994236311239194) internal successors, (555), 398 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 555 transitions. [2025-04-29 11:23:13,169 INFO L79 Accepts]: Start accepts. Automaton has 399 states and 555 transitions. Word has length 30 [2025-04-29 11:23:13,169 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:13,169 INFO L485 AbstractCegarLoop]: Abstraction has 399 states and 555 transitions. [2025-04-29 11:23:13,169 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:13,169 INFO L278 IsEmpty]: Start isEmpty. Operand 399 states and 555 transitions. [2025-04-29 11:23:13,169 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:23:13,169 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:13,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:13,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-29 11:23:13,169 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:23:13,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:13,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1893016208, now seen corresponding path program 1 times [2025-04-29 11:23:13,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:13,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942922835] [2025-04-29 11:23:13,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:13,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:13,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:23:13,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:23:13,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:13,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:13,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:13,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:13,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942922835] [2025-04-29 11:23:13,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942922835] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:13,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:13,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:23:13,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133443485] [2025-04-29 11:23:13,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:13,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:23:13,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:13,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:23:13,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:23:13,320 INFO L87 Difference]: Start difference. First operand 399 states and 555 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:13,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:13,668 INFO L93 Difference]: Finished difference Result 557 states and 763 transitions. [2025-04-29 11:23:13,668 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:23:13,668 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-29 11:23:13,668 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:13,670 INFO L225 Difference]: With dead ends: 557 [2025-04-29 11:23:13,670 INFO L226 Difference]: Without dead ends: 557 [2025-04-29 11:23:13,670 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:23:13,670 INFO L437 NwaCegarLoop]: 140 mSDtfsCounter, 552 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:13,670 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 711 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:23:13,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-04-29 11:23:13,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 402. [2025-04-29 11:23:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 350 states have (on average 1.5971428571428572) internal successors, (559), 401 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 559 transitions. [2025-04-29 11:23:13,675 INFO L79 Accepts]: Start accepts. Automaton has 402 states and 559 transitions. Word has length 30 [2025-04-29 11:23:13,675 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:13,675 INFO L485 AbstractCegarLoop]: Abstraction has 402 states and 559 transitions. [2025-04-29 11:23:13,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:13,675 INFO L278 IsEmpty]: Start isEmpty. Operand 402 states and 559 transitions. [2025-04-29 11:23:13,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:23:13,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:13,675 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] [2025-04-29 11:23:13,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-29 11:23:13,676 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-04-29 11:23:13,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:13,676 INFO L85 PathProgramCache]: Analyzing trace with hash 781229779, now seen corresponding path program 1 times [2025-04-29 11:23:13,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:13,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994703941] [2025-04-29 11:23:13,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:13,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:13,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:23:13,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:23:13,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:13,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:13,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:13,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994703941] [2025-04-29 11:23:13,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994703941] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:13,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773260905] [2025-04-29 11:23:13,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:13,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:13,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:13,803 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-04-29 11:23:13,805 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-04-29 11:23:13,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:23:13,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:23:13,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:13,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:13,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-29 11:23:13,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:13,889 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:23:13,909 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:23:13,909 INFO L354 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-04-29 11:23:13,925 INFO L354 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-04-29 11:23:13,930 INFO L354 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-04-29 11:23:13,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:23:13,999 INFO L354 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 64 treesize of output 36 [2025-04-29 11:23:14,002 INFO L354 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-04-29 11:23:14,031 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:23:14,032 INFO L354 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-04-29 11:23:14,120 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2025-04-29 11:23:14,123 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:23:14,198 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:14,199 INFO L354 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-04-29 11:23:14,203 INFO L354 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-04-29 11:23:14,280 INFO L325 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2025-04-29 11:23:14,281 INFO L354 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 1 case distinctions, treesize of input 20 treesize of output 25 [2025-04-29 11:23:14,306 INFO L325 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2025-04-29 11:23:14,306 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2025-04-29 11:23:14,360 INFO L354 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 40 treesize of output 31 [2025-04-29 11:23:14,363 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:23:14,414 INFO L354 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-04-29 11:23:14,417 INFO L354 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-04-29 11:23:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:14,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:14,447 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_775) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_774) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)))) (forall ((v_ArrVal_775 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_775) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))))) is different from false [2025-04-29 11:23:14,739 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:14,740 INFO L354 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 219 treesize of output 223 [2025-04-29 11:23:15,125 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:15,126 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 213 treesize of output 735 Killed by 15