./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:22:02,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:22:02,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:22:02,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:22:02,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:22:02,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:22:02,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:22:02,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:22:02,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:22:02,880 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:22:02,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:22:02,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:22:02,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:22:02,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:22:02,882 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:22:02,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:22:02,883 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:22:02,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:22:02,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:22:02,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:22:02,883 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:22:02,883 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:22:02,883 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:22:02,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:22:02,884 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:22:02,884 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:22:02,884 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:22:02,884 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:22:02,884 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:22:02,884 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:22:02,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:22:02,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:22:02,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:22:02,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:22:02,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:22:02,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:22:02,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:22:02,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:22:02,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:22:02,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:22:02,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:22:02,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:22:02,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:22:02,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:22:02,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:22:02,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:22:02,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:22:02,887 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c [2025-01-09 22:22:03,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:22:03,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:22:03,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:22:03,170 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:22:03,170 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:22:03,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2025-01-09 22:22:04,482 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6863393d/5d37906ba8764fd8b41dddb7aed7209b/FLAG2b23329d6 [2025-01-09 22:22:04,786 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:22:04,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2025-01-09 22:22:04,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6863393d/5d37906ba8764fd8b41dddb7aed7209b/FLAG2b23329d6 [2025-01-09 22:22:05,039 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6863393d/5d37906ba8764fd8b41dddb7aed7209b [2025-01-09 22:22:05,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:22:05,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:22:05,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:22:05,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:22:05,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:22:05,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:22:05" (1/1) ... [2025-01-09 22:22:05,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69bca6d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:05, skipping insertion in model container [2025-01-09 22:22:05,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:22:05" (1/1) ... [2025-01-09 22:22:05,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:22:05,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:22:05,406 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:22:05,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:22:05,487 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:22:05,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:05 WrapperNode [2025-01-09 22:22:05,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:22:05,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:22:05,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:22:05,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:22:05,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:05" (1/1) ... [2025-01-09 22:22:05,510 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:05" (1/1) ... [2025-01-09 22:22:05,537 INFO L138 Inliner]: procedures = 123, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 215 [2025-01-09 22:22:05,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:22:05,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:22:05,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:22:05,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:22:05,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:05" (1/1) ... [2025-01-09 22:22:05,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:05" (1/1) ... [2025-01-09 22:22:05,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:05" (1/1) ... [2025-01-09 22:22:05,576 INFO L175 MemorySlicer]: Split 49 memory accesses to 2 slices as follows [2, 47]. 96 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 17 writes are split as follows [0, 17]. [2025-01-09 22:22:05,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:05" (1/1) ... [2025-01-09 22:22:05,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:05" (1/1) ... [2025-01-09 22:22:05,591 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:05" (1/1) ... [2025-01-09 22:22:05,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:05" (1/1) ... [2025-01-09 22:22:05,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:05" (1/1) ... [2025-01-09 22:22:05,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:05" (1/1) ... [2025-01-09 22:22:05,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:05" (1/1) ... [2025-01-09 22:22:05,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:22:05,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:22:05,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:22:05,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:22:05,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:05" (1/1) ... [2025-01-09 22:22:05,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:22:05,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:05,628 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:22:05,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:22:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:22:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:22:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:22:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:22:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:22:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:22:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:22:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:22:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:22:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:22:05,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:22:05,777 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:22:05,778 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:22:06,325 INFO L? ?]: Removed 233 outVars from TransFormulas that were not future-live. [2025-01-09 22:22:06,326 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:22:06,345 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:22:06,345 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2025-01-09 22:22:06,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:22:06 BoogieIcfgContainer [2025-01-09 22:22:06,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:22:06,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:22:06,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:22:06,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:22:06,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:22:05" (1/3) ... [2025-01-09 22:22:06,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1237f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:22:06, skipping insertion in model container [2025-01-09 22:22:06,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:05" (2/3) ... [2025-01-09 22:22:06,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1237f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:22:06, skipping insertion in model container [2025-01-09 22:22:06,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:22:06" (3/3) ... [2025-01-09 22:22:06,354 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_of_cslls.i [2025-01-09 22:22:06,368 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:22:06,370 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_of_cslls.i that has 1 procedures, 215 locations, 1 initial locations, 7 loop locations, and 104 error locations. [2025-01-09 22:22:06,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:22:06,426 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2b2eaff8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:22:06,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2025-01-09 22:22:06,430 INFO L276 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-01-09 22:22:06,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-09 22:22:06,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:06,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-09 22:22:06,438 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:06,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:06,444 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2025-01-09 22:22:06,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:06,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502614180] [2025-01-09 22:22:06,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:06,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:06,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 22:22:06,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 22:22:06,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:06,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:06,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:06,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:06,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502614180] [2025-01-09 22:22:06,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502614180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:06,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:06,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:06,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023409616] [2025-01-09 22:22:06,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:06,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:06,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:06,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:06,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:06,700 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-01-09 22:22:07,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:07,011 INFO L93 Difference]: Finished difference Result 283 states and 306 transitions. [2025-01-09 22:22:07,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:07,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-09 22:22:07,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:07,025 INFO L225 Difference]: With dead ends: 283 [2025-01-09 22:22:07,025 INFO L226 Difference]: Without dead ends: 281 [2025-01-09 22:22:07,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:07,030 INFO L435 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.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:07,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 206 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:22:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-01-09 22:22:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 204. [2025-01-09 22:22:07,062 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-01-09 22:22:07,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 220 transitions. [2025-01-09 22:22:07,069 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 220 transitions. Word has length 3 [2025-01-09 22:22:07,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:07,069 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 220 transitions. [2025-01-09 22:22:07,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 220 transitions. [2025-01-09 22:22:07,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-09 22:22:07,069 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:07,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-09 22:22:07,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:22:07,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:07,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:07,071 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2025-01-09 22:22:07,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:07,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527541355] [2025-01-09 22:22:07,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:07,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:07,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 22:22:07,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 22:22:07,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:07,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:07,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:07,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527541355] [2025-01-09 22:22:07,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527541355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:07,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:07,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:07,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679599179] [2025-01-09 22:22:07,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:07,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:07,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:07,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:07,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:07,159 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-01-09 22:22:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:07,304 INFO L93 Difference]: Finished difference Result 202 states and 218 transitions. [2025-01-09 22:22:07,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:07,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-09 22:22:07,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:07,306 INFO L225 Difference]: With dead ends: 202 [2025-01-09 22:22:07,306 INFO L226 Difference]: Without dead ends: 202 [2025-01-09 22:22:07,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:07,307 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 2 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:07,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 329 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:07,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-09 22:22:07,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-01-09 22:22:07,321 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-01-09 22:22:07,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 218 transitions. [2025-01-09 22:22:07,324 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 218 transitions. Word has length 3 [2025-01-09 22:22:07,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:07,324 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 218 transitions. [2025-01-09 22:22:07,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:07,325 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 218 transitions. [2025-01-09 22:22:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:22:07,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:07,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:22:07,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:22:07,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:07,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:07,326 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2025-01-09 22:22:07,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:07,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671667929] [2025-01-09 22:22:07,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:07,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:07,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:22:07,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:22:07,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:07,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:07,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:07,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671667929] [2025-01-09 22:22:07,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671667929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:07,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:07,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:22:07,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292070526] [2025-01-09 22:22:07,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:07,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:22:07,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:07,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:22:07,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:22:07,580 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-01-09 22:22:07,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:07,947 INFO L93 Difference]: Finished difference Result 355 states and 385 transitions. [2025-01-09 22:22:07,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:22:07,947 INFO L78 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-01-09 22:22:07,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:07,949 INFO L225 Difference]: With dead ends: 355 [2025-01-09 22:22:07,949 INFO L226 Difference]: Without dead ends: 355 [2025-01-09 22:22:07,949 INFO L434 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-01-09 22:22:07,950 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 470 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:07,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 208 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:22:07,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-01-09 22:22:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 195. [2025-01-09 22:22:07,965 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-01-09 22:22:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 211 transitions. [2025-01-09 22:22:07,966 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 211 transitions. Word has length 6 [2025-01-09 22:22:07,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:07,966 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 211 transitions. [2025-01-09 22:22:07,966 INFO L472 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-01-09 22:22:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 211 transitions. [2025-01-09 22:22:07,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:22:07,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:07,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:07,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:22:07,967 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:07,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:07,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924364, now seen corresponding path program 1 times [2025-01-09 22:22:07,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:07,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053761065] [2025-01-09 22:22:07,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:07,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:07,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:22:07,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:22:08,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:08,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:08,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:08,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053761065] [2025-01-09 22:22:08,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053761065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:08,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:08,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:22:08,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343065624] [2025-01-09 22:22:08,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:08,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:22:08,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:08,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:22:08,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:08,155 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-01-09 22:22:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:08,407 INFO L93 Difference]: Finished difference Result 194 states and 210 transitions. [2025-01-09 22:22:08,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:22:08,407 INFO L78 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-01-09 22:22:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:08,409 INFO L225 Difference]: With dead ends: 194 [2025-01-09 22:22:08,409 INFO L226 Difference]: Without dead ends: 194 [2025-01-09 22:22:08,409 INFO L434 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-01-09 22:22:08,410 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 3 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-01-09 22:22:08,412 INFO L436 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-01-09 22:22:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-01-09 22:22:08,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-01-09 22:22:08,420 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-01-09 22:22:08,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 210 transitions. [2025-01-09 22:22:08,421 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 210 transitions. Word has length 10 [2025-01-09 22:22:08,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:08,421 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 210 transitions. [2025-01-09 22:22:08,421 INFO L472 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-01-09 22:22:08,421 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 210 transitions. [2025-01-09 22:22:08,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:22:08,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:08,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:08,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:22:08,422 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:08,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:08,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924365, now seen corresponding path program 1 times [2025-01-09 22:22:08,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:08,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650020701] [2025-01-09 22:22:08,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:08,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:08,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:22:08,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:22:08,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:08,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:08,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:08,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650020701] [2025-01-09 22:22:08,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650020701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:08,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:08,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:22:08,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203381840] [2025-01-09 22:22:08,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:08,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:22:08,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:08,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:22:08,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:08,635 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-01-09 22:22:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:08,865 INFO L93 Difference]: Finished difference Result 193 states and 209 transitions. [2025-01-09 22:22:08,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:22:08,866 INFO L78 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-01-09 22:22:08,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:08,866 INFO L225 Difference]: With dead ends: 193 [2025-01-09 22:22:08,867 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 22:22:08,867 INFO L434 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-01-09 22:22:08,868 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 2 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:08,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 549 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:22:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 22:22:08,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-01-09 22:22:08,872 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-01-09 22:22:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 209 transitions. [2025-01-09 22:22:08,873 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 209 transitions. Word has length 10 [2025-01-09 22:22:08,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:08,873 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 209 transitions. [2025-01-09 22:22:08,873 INFO L472 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-01-09 22:22:08,874 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 209 transitions. [2025-01-09 22:22:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:22:08,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:08,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:08,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:22:08,875 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:08,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:08,875 INFO L85 PathProgramCache]: Analyzing trace with hash 191727319, now seen corresponding path program 1 times [2025-01-09 22:22:08,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:08,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493106011] [2025-01-09 22:22:08,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:08,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:08,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:22:08,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:22:08,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:08,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:09,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:09,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493106011] [2025-01-09 22:22:09,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493106011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:09,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:09,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:22:09,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943119438] [2025-01-09 22:22:09,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:09,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:22:09,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:09,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:22:09,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:22:09,210 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-01-09 22:22:09,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:09,759 INFO L93 Difference]: Finished difference Result 357 states and 395 transitions. [2025-01-09 22:22:09,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:22:09,760 INFO L78 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-01-09 22:22:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:09,762 INFO L225 Difference]: With dead ends: 357 [2025-01-09 22:22:09,762 INFO L226 Difference]: Without dead ends: 357 [2025-01-09 22:22:09,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:22:09,763 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 380 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:09,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 827 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:22:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-01-09 22:22:09,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 198. [2025-01-09 22:22:09,768 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-01-09 22:22:09,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 216 transitions. [2025-01-09 22:22:09,773 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 216 transitions. Word has length 16 [2025-01-09 22:22:09,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:09,773 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 216 transitions. [2025-01-09 22:22:09,773 INFO L472 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-01-09 22:22:09,773 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 216 transitions. [2025-01-09 22:22:09,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:22:09,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:09,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:09,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:22:09,775 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:09,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:09,775 INFO L85 PathProgramCache]: Analyzing trace with hash 191727320, now seen corresponding path program 1 times [2025-01-09 22:22:09,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:09,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025397095] [2025-01-09 22:22:09,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:09,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:09,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:22:09,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:22:09,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:09,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:10,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:10,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025397095] [2025-01-09 22:22:10,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025397095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:10,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:10,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:22:10,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308429540] [2025-01-09 22:22:10,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:10,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:22:10,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:10,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:22:10,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:22:10,283 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-01-09 22:22:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:10,752 INFO L93 Difference]: Finished difference Result 279 states and 310 transitions. [2025-01-09 22:22:10,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:22:10,753 INFO L78 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-01-09 22:22:10,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:10,754 INFO L225 Difference]: With dead ends: 279 [2025-01-09 22:22:10,754 INFO L226 Difference]: Without dead ends: 279 [2025-01-09 22:22:10,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:22:10,755 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 566 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:10,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 486 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:22:10,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-01-09 22:22:10,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 198. [2025-01-09 22:22:10,762 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-01-09 22:22:10,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 215 transitions. [2025-01-09 22:22:10,763 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 215 transitions. Word has length 16 [2025-01-09 22:22:10,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:10,764 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 215 transitions. [2025-01-09 22:22:10,764 INFO L472 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-01-09 22:22:10,764 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 215 transitions. [2025-01-09 22:22:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:22:10,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:10,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:10,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:22:10,765 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:10,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:10,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1648579604, now seen corresponding path program 1 times [2025-01-09 22:22:10,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:10,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755514373] [2025-01-09 22:22:10,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:10,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:10,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:22:10,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:22:10,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:10,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:10,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:10,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755514373] [2025-01-09 22:22:10,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755514373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:10,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:10,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:10,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496096721] [2025-01-09 22:22:10,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:10,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:10,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:10,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:10,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:10,816 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-01-09 22:22:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:10,959 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2025-01-09 22:22:10,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:10,959 INFO L78 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-01-09 22:22:10,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:10,960 INFO L225 Difference]: With dead ends: 195 [2025-01-09 22:22:10,961 INFO L226 Difference]: Without dead ends: 195 [2025-01-09 22:22:10,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:10,961 INFO L435 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-01-09 22:22:10,962 INFO L436 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-01-09 22:22:10,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-01-09 22:22:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-01-09 22:22:10,965 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-01-09 22:22:10,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 212 transitions. [2025-01-09 22:22:10,967 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 212 transitions. Word has length 17 [2025-01-09 22:22:10,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:10,967 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 212 transitions. [2025-01-09 22:22:10,967 INFO L472 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-01-09 22:22:10,968 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 212 transitions. [2025-01-09 22:22:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:22:10,968 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:10,968 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:10,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:22:10,968 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:10,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:10,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1648579605, now seen corresponding path program 1 times [2025-01-09 22:22:10,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:10,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151988068] [2025-01-09 22:22:10,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:10,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:10,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:22:10,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:22:10,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:10,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:11,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:11,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:11,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151988068] [2025-01-09 22:22:11,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151988068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:11,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:11,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:11,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790260313] [2025-01-09 22:22:11,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:11,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:11,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:11,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:11,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:11,066 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-01-09 22:22:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:11,183 INFO L93 Difference]: Finished difference Result 193 states and 210 transitions. [2025-01-09 22:22:11,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:11,184 INFO L78 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-01-09 22:22:11,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:11,185 INFO L225 Difference]: With dead ends: 193 [2025-01-09 22:22:11,185 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 22:22:11,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:11,186 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 16 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:11,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 291 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 22:22:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-01-09 22:22:11,190 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-01-09 22:22:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 210 transitions. [2025-01-09 22:22:11,191 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 210 transitions. Word has length 17 [2025-01-09 22:22:11,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:11,192 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 210 transitions. [2025-01-09 22:22:11,192 INFO L472 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-01-09 22:22:11,192 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 210 transitions. [2025-01-09 22:22:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:22:11,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:11,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:11,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:22:11,193 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:11,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:11,194 INFO L85 PathProgramCache]: Analyzing trace with hash -354432464, now seen corresponding path program 1 times [2025-01-09 22:22:11,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:11,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937788793] [2025-01-09 22:22:11,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:11,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:11,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:22:11,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:22:11,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:11,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:11,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:11,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937788793] [2025-01-09 22:22:11,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937788793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:11,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:11,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:22:11,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333166607] [2025-01-09 22:22:11,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:11,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:22:11,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:11,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:22:11,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:22:11,240 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-01-09 22:22:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:11,497 INFO L93 Difference]: Finished difference Result 254 states and 282 transitions. [2025-01-09 22:22:11,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:22:11,497 INFO L78 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-01-09 22:22:11,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:11,499 INFO L225 Difference]: With dead ends: 254 [2025-01-09 22:22:11,499 INFO L226 Difference]: Without dead ends: 254 [2025-01-09 22:22:11,499 INFO L434 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-01-09 22:22:11,500 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 268 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-01-09 22:22:11,500 INFO L436 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-01-09 22:22:11,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-01-09 22:22:11,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 182. [2025-01-09 22:22:11,506 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-01-09 22:22:11,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 203 transitions. [2025-01-09 22:22:11,509 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 203 transitions. Word has length 18 [2025-01-09 22:22:11,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:11,509 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 203 transitions. [2025-01-09 22:22:11,510 INFO L472 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-01-09 22:22:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 203 transitions. [2025-01-09 22:22:11,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:22:11,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:11,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:11,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:22:11,510 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:11,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:11,511 INFO L85 PathProgramCache]: Analyzing trace with hash -354432463, now seen corresponding path program 1 times [2025-01-09 22:22:11,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:11,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737697465] [2025-01-09 22:22:11,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:11,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:11,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:22:11,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:22:11,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:11,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:11,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:11,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:11,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737697465] [2025-01-09 22:22:11,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737697465] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:11,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:11,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:22:11,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142413964] [2025-01-09 22:22:11,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:11,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:22:11,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:11,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:22:11,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:11,611 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-01-09 22:22:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:11,996 INFO L93 Difference]: Finished difference Result 421 states and 478 transitions. [2025-01-09 22:22:11,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:22:11,996 INFO L78 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-01-09 22:22:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:11,998 INFO L225 Difference]: With dead ends: 421 [2025-01-09 22:22:11,998 INFO L226 Difference]: Without dead ends: 421 [2025-01-09 22:22:11,999 INFO L434 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-01-09 22:22:11,999 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 506 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:12,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 326 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:22:12,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-01-09 22:22:12,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 330. [2025-01-09 22:22:12,007 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-01-09 22:22:12,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 459 transitions. [2025-01-09 22:22:12,008 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 459 transitions. Word has length 18 [2025-01-09 22:22:12,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:12,009 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 459 transitions. [2025-01-09 22:22:12,009 INFO L472 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-01-09 22:22:12,009 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 459 transitions. [2025-01-09 22:22:12,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:22:12,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:12,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:12,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:22:12,010 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:12,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:12,010 INFO L85 PathProgramCache]: Analyzing trace with hash -354422129, now seen corresponding path program 1 times [2025-01-09 22:22:12,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:12,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26445548] [2025-01-09 22:22:12,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:12,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:12,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:22:12,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:22:12,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:12,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:12,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:12,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:12,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26445548] [2025-01-09 22:22:12,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26445548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:12,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:12,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:22:12,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322727885] [2025-01-09 22:22:12,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:12,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:12,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:12,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:12,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:12,041 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-01-09 22:22:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:12,062 INFO L93 Difference]: Finished difference Result 405 states and 538 transitions. [2025-01-09 22:22:12,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:12,063 INFO L78 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-01-09 22:22:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:12,064 INFO L225 Difference]: With dead ends: 405 [2025-01-09 22:22:12,064 INFO L226 Difference]: Without dead ends: 405 [2025-01-09 22:22:12,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:12,065 INFO L435 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-01-09 22:22:12,065 INFO L436 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-01-09 22:22:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-01-09 22:22:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 371. [2025-01-09 22:22:12,072 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-01-09 22:22:12,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 538 transitions. [2025-01-09 22:22:12,074 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 538 transitions. Word has length 18 [2025-01-09 22:22:12,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:12,074 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 538 transitions. [2025-01-09 22:22:12,074 INFO L472 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-01-09 22:22:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 538 transitions. [2025-01-09 22:22:12,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:22:12,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:12,075 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-01-09 22:22:12,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:22:12,075 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:12,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:12,075 INFO L85 PathProgramCache]: Analyzing trace with hash -116033059, now seen corresponding path program 1 times [2025-01-09 22:22:12,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:12,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326112589] [2025-01-09 22:22:12,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:12,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:12,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:22:12,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:22:12,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:12,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:12,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:12,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326112589] [2025-01-09 22:22:12,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326112589] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:12,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:12,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:22:12,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603746069] [2025-01-09 22:22:12,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:12,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:22:12,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:12,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:22:12,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:22:12,201 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-01-09 22:22:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:12,622 INFO L93 Difference]: Finished difference Result 505 states and 739 transitions. [2025-01-09 22:22:12,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:22:12,623 INFO L78 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-01-09 22:22:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:12,625 INFO L225 Difference]: With dead ends: 505 [2025-01-09 22:22:12,625 INFO L226 Difference]: Without dead ends: 505 [2025-01-09 22:22:12,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:22:12,625 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 174 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:12,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 807 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:22:12,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-01-09 22:22:12,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 370. [2025-01-09 22:22:12,635 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-01-09 22:22:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 537 transitions. [2025-01-09 22:22:12,636 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 537 transitions. Word has length 20 [2025-01-09 22:22:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:12,637 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 537 transitions. [2025-01-09 22:22:12,637 INFO L472 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-01-09 22:22:12,637 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 537 transitions. [2025-01-09 22:22:12,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:22:12,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:12,639 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-01-09 22:22:12,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:22:12,639 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:12,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:12,640 INFO L85 PathProgramCache]: Analyzing trace with hash -116033058, now seen corresponding path program 1 times [2025-01-09 22:22:12,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:12,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044844036] [2025-01-09 22:22:12,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:12,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:12,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:22:12,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:22:12,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:12,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:12,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:12,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:12,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044844036] [2025-01-09 22:22:12,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044844036] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:12,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:12,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:22:12,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873619782] [2025-01-09 22:22:12,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:12,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:22:12,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:12,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:22:12,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:22:12,846 INFO L87 Difference]: Start difference. First operand 370 states and 537 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-01-09 22:22:13,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:13,402 INFO L93 Difference]: Finished difference Result 504 states and 738 transitions. [2025-01-09 22:22:13,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:22:13,402 INFO L78 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-01-09 22:22:13,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:13,405 INFO L225 Difference]: With dead ends: 504 [2025-01-09 22:22:13,405 INFO L226 Difference]: Without dead ends: 504 [2025-01-09 22:22:13,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:22:13,406 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 172 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:13,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 714 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:22:13,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-01-09 22:22:13,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 369. [2025-01-09 22:22:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 307 states have (on average 1.745928338762215) internal successors, (536), 368 states have internal predecessors, (536), 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-01-09 22:22:13,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 536 transitions. [2025-01-09 22:22:13,419 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 536 transitions. Word has length 20 [2025-01-09 22:22:13,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:13,420 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 536 transitions. [2025-01-09 22:22:13,420 INFO L472 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-01-09 22:22:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 536 transitions. [2025-01-09 22:22:13,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:22:13,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:13,422 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-01-09 22:22:13,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:22:13,422 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:13,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:13,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1458623087, now seen corresponding path program 1 times [2025-01-09 22:22:13,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:13,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204177317] [2025-01-09 22:22:13,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:13,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:13,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:22:13,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:22:13,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:13,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:13,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:13,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204177317] [2025-01-09 22:22:13,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204177317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:13,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:13,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:22:13,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710769588] [2025-01-09 22:22:13,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:13,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:13,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:13,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:13,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:13,461 INFO L87 Difference]: Start difference. First operand 369 states and 536 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-01-09 22:22:13,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:13,472 INFO L93 Difference]: Finished difference Result 373 states and 540 transitions. [2025-01-09 22:22:13,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:13,472 INFO L78 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-01-09 22:22:13,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:13,475 INFO L225 Difference]: With dead ends: 373 [2025-01-09 22:22:13,475 INFO L226 Difference]: Without dead ends: 373 [2025-01-09 22:22:13,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:13,475 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 366 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-01-09 22:22:13,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 366 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:22:13,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-09 22:22:13,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-01-09 22:22:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 311 states have (on average 1.7363344051446945) internal successors, (540), 372 states have internal predecessors, (540), 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-01-09 22:22:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 540 transitions. [2025-01-09 22:22:13,488 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 540 transitions. Word has length 23 [2025-01-09 22:22:13,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:13,488 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 540 transitions. [2025-01-09 22:22:13,488 INFO L472 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-01-09 22:22:13,488 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 540 transitions. [2025-01-09 22:22:13,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:22:13,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:13,490 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-01-09 22:22:13,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:22:13,490 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:13,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:13,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1625453258, now seen corresponding path program 1 times [2025-01-09 22:22:13,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:13,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481977669] [2025-01-09 22:22:13,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:13,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:13,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:22:13,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:22:13,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:13,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:13,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:13,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:13,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481977669] [2025-01-09 22:22:13,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481977669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:13,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:13,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:22:13,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133749111] [2025-01-09 22:22:13,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:13,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:13,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:13,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:13,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:13,548 INFO L87 Difference]: Start difference. First operand 373 states and 540 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-01-09 22:22:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:13,569 INFO L93 Difference]: Finished difference Result 370 states and 521 transitions. [2025-01-09 22:22:13,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:13,570 INFO L78 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-01-09 22:22:13,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:13,571 INFO L225 Difference]: With dead ends: 370 [2025-01-09 22:22:13,571 INFO L226 Difference]: Without dead ends: 370 [2025-01-09 22:22:13,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:13,572 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 5 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 361 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-01-09 22:22:13,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 361 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:22:13,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-01-09 22:22:13,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2025-01-09 22:22:13,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 300 states have (on average 1.72) internal successors, (516), 361 states have internal predecessors, (516), 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-01-09 22:22:13,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 516 transitions. [2025-01-09 22:22:13,583 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 516 transitions. Word has length 25 [2025-01-09 22:22:13,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:13,583 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 516 transitions. [2025-01-09 22:22:13,583 INFO L472 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-01-09 22:22:13,584 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 516 transitions. [2025-01-09 22:22:13,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:22:13,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:13,585 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-01-09 22:22:13,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:22:13,586 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:13,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:13,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1582542525, now seen corresponding path program 1 times [2025-01-09 22:22:13,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:13,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155339596] [2025-01-09 22:22:13,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:13,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:13,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:22:13,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:22:13,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:13,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:13,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:13,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155339596] [2025-01-09 22:22:13,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155339596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:13,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:13,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:22:13,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488990208] [2025-01-09 22:22:13,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:13,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:13,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:13,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:13,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:13,629 INFO L87 Difference]: Start difference. First operand 362 states and 516 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-01-09 22:22:13,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:13,640 INFO L93 Difference]: Finished difference Result 365 states and 519 transitions. [2025-01-09 22:22:13,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:13,641 INFO L78 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-01-09 22:22:13,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:13,642 INFO L225 Difference]: With dead ends: 365 [2025-01-09 22:22:13,643 INFO L226 Difference]: Without dead ends: 365 [2025-01-09 22:22:13,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:13,643 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 366 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-01-09 22:22:13,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 366 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:22:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-01-09 22:22:13,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-01-09 22:22:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 303 states have (on average 1.7128712871287128) internal successors, (519), 364 states have internal predecessors, (519), 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-01-09 22:22:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 519 transitions. [2025-01-09 22:22:13,651 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 519 transitions. Word has length 26 [2025-01-09 22:22:13,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:13,651 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 519 transitions. [2025-01-09 22:22:13,651 INFO L472 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-01-09 22:22:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 519 transitions. [2025-01-09 22:22:13,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:22:13,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:13,652 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-01-09 22:22:13,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:22:13,652 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:13,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:13,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1245483444, now seen corresponding path program 1 times [2025-01-09 22:22:13,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:13,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507381743] [2025-01-09 22:22:13,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:13,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:13,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:22:13,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:22:13,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:13,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:14,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:14,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507381743] [2025-01-09 22:22:14,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507381743] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:14,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095910498] [2025-01-09 22:22:14,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:14,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:14,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:14,004 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:14,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:22:14,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:22:14,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:22:14,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:14,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:14,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 22:22:14,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:14,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:22:14,191 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:22:14,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:22:14,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:22:14,280 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:22:14,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2025-01-09 22:22:14,307 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:22:14,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:22:14,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2025-01-09 22:22:14,447 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:22:14,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-09 22:22:14,484 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-01-09 22:22:14,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2025-01-09 22:22:14,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-09 22:22:14,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:14,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:22:14,644 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_517) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) 1)) is different from false [2025-01-09 22:22:14,657 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_516 (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$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_516))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_517)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) 1)) is different from false [2025-01-09 22:22:14,673 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-01-09 22:22:14,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-01-09 22:22:14,679 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_516))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_517)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) is different from false [2025-01-09 22:22:14,688 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_516))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_517)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)))) is different from false [2025-01-09 22:22:14,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:14,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 50 [2025-01-09 22:22:14,884 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:14,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 580 treesize of output 454 [2025-01-09 22:22:14,903 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:22:14,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-01-09 22:22:14,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-01-09 22:22:14,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:22:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-01-09 22:22:14,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095910498] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:22:14,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:22:14,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 13] total 26 [2025-01-09 22:22:14,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813187705] [2025-01-09 22:22:14,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:22:14,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 22:22:14,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:14,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 22:22:14,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=16, NotChecked=180, Total=702 [2025-01-09 22:22:14,946 INFO L87 Difference]: Start difference. First operand 365 states and 519 transitions. Second operand has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 27 states have internal predecessors, (72), 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-01-09 22:22:16,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:16,041 INFO L93 Difference]: Finished difference Result 590 states and 815 transitions. [2025-01-09 22:22:16,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:22:16,042 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 27 states have internal predecessors, (72), 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-01-09 22:22:16,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:16,044 INFO L225 Difference]: With dead ends: 590 [2025-01-09 22:22:16,044 INFO L226 Difference]: Without dead ends: 590 [2025-01-09 22:22:16,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=16, NotChecked=220, Total=992 [2025-01-09 22:22:16,045 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 849 mSDsluCounter, 2017 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 2164 SdHoareTripleChecker+Invalid, 2539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1147 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:16,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 2164 Invalid, 2539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1358 Invalid, 0 Unknown, 1147 Unchecked, 0.9s Time] [2025-01-09 22:22:16,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-01-09 22:22:16,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 364. [2025-01-09 22:22:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 303 states have (on average 1.7095709570957096) internal successors, (518), 363 states have internal predecessors, (518), 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-01-09 22:22:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 518 transitions. [2025-01-09 22:22:16,056 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 518 transitions. Word has length 26 [2025-01-09 22:22:16,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:16,056 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 518 transitions. [2025-01-09 22:22:16,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 27 states have internal predecessors, (72), 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-01-09 22:22:16,056 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 518 transitions. [2025-01-09 22:22:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:22:16,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:16,057 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-01-09 22:22:16,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 22:22:16,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 22:22:16,261 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:16,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:16,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1245483443, now seen corresponding path program 1 times [2025-01-09 22:22:16,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:16,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367741125] [2025-01-09 22:22:16,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:16,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:16,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:22:16,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:22:16,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:16,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:16,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:16,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:16,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367741125] [2025-01-09 22:22:16,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367741125] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:16,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7760982] [2025-01-09 22:22:16,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:16,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:16,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:16,769 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:16,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:22:16,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:22:16,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:22:16,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:16,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:16,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 22:22:16,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:16,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:22:16,929 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:22:16,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:22:16,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:22:16,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:22:17,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:22:17,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 34 [2025-01-09 22:22:17,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-09 22:22:17,105 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:22:17,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:22:17,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-01-09 22:22:17,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:22:17,344 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:22:17,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 61 [2025-01-09 22:22:17,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2025-01-09 22:22:17,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:22:17,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-09 22:22:17,410 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 22:22:17,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-01-09 22:22:17,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 22:22:17,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:22:17,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:17,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:22:17,854 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0))) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_616 Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_612))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (or (< .cse0 0) (< 0 (+ (select (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse0 v_ArrVal_616))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) 1))))))) (forall ((v_ArrVal_612 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_612))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (or (< .cse4 0) (forall ((v_ArrVal_613 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_616 Int)) (or (forall ((v_ArrVal_617 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_613))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (<= (+ (select (select (store .cse5 .cse6 (store (select .cse5 .cse6) .cse4 v_ArrVal_616)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_617) (select (select (store .cse7 .cse6 v_ArrVal_615) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0)))))))))) is different from false [2025-01-09 22:22:17,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:17,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 281 [2025-01-09 22:22:17,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:17,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 253 treesize of output 271 [2025-01-09 22:22:18,174 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (or (forall ((v_prenex_8 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_8) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 0)) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_615 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_615)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem9#1.base|))) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_616 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_612))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (or (< .cse2 0) (< 0 (+ (select (select (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse2 v_ArrVal_616))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 1)))))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_11 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_8))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (or (< .cse5 0) (< (select (select (let ((.cse7 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse5 v_prenex_11))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| 1)))))))) is different from false [2025-01-09 22:22:18,209 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_615 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_615)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (forall ((v_prenex_8 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_8) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) 0))) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_616 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_612))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (or (< .cse2 0) (< 0 (+ (select (select (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse2 v_ArrVal_616))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) 1)))))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_11 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_8))) (let ((.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (or (< (select (select (let ((.cse6 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_prenex_11))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) 1)) (< .cse7 0))))))) is different from false [2025-01-09 22:22:19,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:19,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 533 treesize of output 444 [2025-01-09 22:22:19,580 INFO L349 Elim1Store]: treesize reduction 57, result has 61.5 percent of original size [2025-01-09 22:22:19,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 500 treesize of output 409 [2025-01-09 22:22:19,632 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-09 22:22:19,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 7558 treesize of output 7538 [2025-01-09 22:22:19,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 773 treesize of output 733 [2025-01-09 22:22:19,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 733 treesize of output 673 [2025-01-09 22:22:19,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:19,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 52254 treesize of output 48751 [2025-01-09 22:22:20,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2709 treesize of output 2613 [2025-01-09 22:22:20,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2623 treesize of output 2543 [2025-01-09 22:22:20,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2681 treesize of output 2557 [2025-01-09 22:22:20,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:20,551 INFO L378 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 2548 treesize of output 2588 [2025-01-09 22:22:20,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2581 treesize of output 2457 [2025-01-09 22:22:20,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3323 treesize of output 2963 [2025-01-09 22:22:21,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2031 treesize of output 2023 [2025-01-09 22:22:21,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2167 treesize of output 2047 [2025-01-09 22:22:21,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2111 treesize of output 2047 [2025-01-09 22:22:21,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2047 treesize of output 2043 [2025-01-09 22:22:21,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2119 treesize of output 1995 [2025-01-09 22:22:52,611 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-09 22:22:52,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2025-01-09 22:22:52,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-01-09 22:22:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-01-09 22:22:52,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7760982] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:22:52,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:22:52,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 34 [2025-01-09 22:22:52,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490212427] [2025-01-09 22:22:52,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:22:52,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 22:22:52,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:52,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 22:22:52,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=858, Unknown=13, NotChecked=186, Total=1190 [2025-01-09 22:22:52,700 INFO L87 Difference]: Start difference. First operand 364 states and 518 transitions. Second operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 35 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-01-09 22:22:55,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:55,287 INFO L93 Difference]: Finished difference Result 589 states and 814 transitions. [2025-01-09 22:22:55,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:22:55,287 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 35 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-01-09 22:22:55,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:55,289 INFO L225 Difference]: With dead ends: 589 [2025-01-09 22:22:55,289 INFO L226 Difference]: Without dead ends: 589 [2025-01-09 22:22:55,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=225, Invalid=1106, Unknown=13, NotChecked=216, Total=1560 [2025-01-09 22:22:55,290 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 687 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 2238 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 3140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 870 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:55,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 2211 Invalid, 3140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2238 Invalid, 0 Unknown, 870 Unchecked, 2.3s Time] [2025-01-09 22:22:55,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-01-09 22:22:55,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 358. [2025-01-09 22:22:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 298 states have (on average 1.7147651006711409) internal successors, (511), 357 states have internal predecessors, (511), 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-01-09 22:22:55,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 511 transitions. [2025-01-09 22:22:55,298 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 511 transitions. Word has length 26 [2025-01-09 22:22:55,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:55,298 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 511 transitions. [2025-01-09 22:22:55,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 35 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-01-09 22:22:55,299 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 511 transitions. [2025-01-09 22:22:55,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:22:55,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:55,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:55,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 22:22:55,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:55,500 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:55,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:55,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1650677872, now seen corresponding path program 1 times [2025-01-09 22:22:55,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:55,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109070028] [2025-01-09 22:22:55,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:55,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:55,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:22:55,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:22:55,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:55,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:55,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:55,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:55,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109070028] [2025-01-09 22:22:55,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109070028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:55,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:55,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:22:55,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889656931] [2025-01-09 22:22:55,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:55,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:22:55,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:55,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:22:55,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:22:55,836 INFO L87 Difference]: Start difference. First operand 358 states and 511 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-01-09 22:22:56,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:56,288 INFO L93 Difference]: Finished difference Result 607 states and 795 transitions. [2025-01-09 22:22:56,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:22:56,289 INFO L78 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-01-09 22:22:56,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:56,291 INFO L225 Difference]: With dead ends: 607 [2025-01-09 22:22:56,291 INFO L226 Difference]: Without dead ends: 607 [2025-01-09 22:22:56,291 INFO L434 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-01-09 22:22:56,291 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 575 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 966 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-01-09 22:22:56,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 966 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:22:56,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-01-09 22:22:56,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 450. [2025-01-09 22:22:56,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 390 states have (on average 1.6871794871794872) internal successors, (658), 449 states have internal predecessors, (658), 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-01-09 22:22:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 658 transitions. [2025-01-09 22:22:56,301 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 658 transitions. Word has length 27 [2025-01-09 22:22:56,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:56,301 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 658 transitions. [2025-01-09 22:22:56,301 INFO L472 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-01-09 22:22:56,301 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 658 transitions. [2025-01-09 22:22:56,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:22:56,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:56,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:56,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 22:22:56,302 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:56,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:56,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1306981328, now seen corresponding path program 1 times [2025-01-09 22:22:56,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:56,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689800891] [2025-01-09 22:22:56,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:56,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:56,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:22:56,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:22:56,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:56,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:56,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:56,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689800891] [2025-01-09 22:22:56,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689800891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:56,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:56,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:22:56,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594690206] [2025-01-09 22:22:56,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:56,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:22:56,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:56,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:22:56,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:22:56,534 INFO L87 Difference]: Start difference. First operand 450 states and 658 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-01-09 22:22:57,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:57,096 INFO L93 Difference]: Finished difference Result 670 states and 937 transitions. [2025-01-09 22:22:57,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:22:57,097 INFO L78 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-01-09 22:22:57,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:57,100 INFO L225 Difference]: With dead ends: 670 [2025-01-09 22:22:57,100 INFO L226 Difference]: Without dead ends: 670 [2025-01-09 22:22:57,100 INFO L434 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-01-09 22:22:57,101 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 897 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:57,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 849 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:22:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-01-09 22:22:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 459. [2025-01-09 22:22:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 399 states have (on average 1.6766917293233083) internal successors, (669), 458 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-01-09 22:22:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 669 transitions. [2025-01-09 22:22:57,110 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 669 transitions. Word has length 27 [2025-01-09 22:22:57,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:57,111 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 669 transitions. [2025-01-09 22:22:57,111 INFO L472 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-01-09 22:22:57,111 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 669 transitions. [2025-01-09 22:22:57,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:22:57,112 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:57,112 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:57,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 22:22:57,112 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:57,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:57,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1306981327, now seen corresponding path program 1 times [2025-01-09 22:22:57,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:57,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110872451] [2025-01-09 22:22:57,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:57,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:57,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:22:57,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:22:57,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:57,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:57,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:57,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110872451] [2025-01-09 22:22:57,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110872451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:57,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:57,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:22:57,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015759416] [2025-01-09 22:22:57,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:57,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:22:57,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:57,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:22:57,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:22:57,379 INFO L87 Difference]: Start difference. First operand 459 states and 669 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 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-01-09 22:22:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:57,957 INFO L93 Difference]: Finished difference Result 661 states and 928 transitions. [2025-01-09 22:22:57,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:22:57,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 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-01-09 22:22:57,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:57,959 INFO L225 Difference]: With dead ends: 661 [2025-01-09 22:22:57,959 INFO L226 Difference]: Without dead ends: 661 [2025-01-09 22:22:57,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:22:57,961 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 541 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:57,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 573 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:22:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-01-09 22:22:57,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 459. [2025-01-09 22:22:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 399 states have (on average 1.6741854636591478) internal successors, (668), 458 states have internal predecessors, (668), 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-01-09 22:22:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 668 transitions. [2025-01-09 22:22:57,971 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 668 transitions. Word has length 27 [2025-01-09 22:22:57,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:57,971 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 668 transitions. [2025-01-09 22:22:57,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 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-01-09 22:22:57,972 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 668 transitions. [2025-01-09 22:22:57,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:22:57,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:57,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:57,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 22:22:57,972 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:57,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:57,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1311422610, now seen corresponding path program 1 times [2025-01-09 22:22:57,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:57,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688048053] [2025-01-09 22:22:57,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:57,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:57,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:22:57,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:22:57,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:57,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:58,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:58,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688048053] [2025-01-09 22:22:58,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688048053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:58,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:58,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:58,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951999986] [2025-01-09 22:22:58,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:58,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:58,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:58,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:58,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:58,018 INFO L87 Difference]: Start difference. First operand 459 states and 668 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-01-09 22:22:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:58,115 INFO L93 Difference]: Finished difference Result 454 states and 663 transitions. [2025-01-09 22:22:58,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:58,115 INFO L78 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-01-09 22:22:58,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:58,117 INFO L225 Difference]: With dead ends: 454 [2025-01-09 22:22:58,117 INFO L226 Difference]: Without dead ends: 454 [2025-01-09 22:22:58,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:58,118 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 8 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 263 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-01-09 22:22:58,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 263 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:58,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-01-09 22:22:58,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2025-01-09 22:22:58,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 399 states have (on average 1.6616541353383458) internal successors, (663), 453 states have internal predecessors, (663), 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-01-09 22:22:58,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 663 transitions. [2025-01-09 22:22:58,125 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 663 transitions. Word has length 28 [2025-01-09 22:22:58,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:58,125 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 663 transitions. [2025-01-09 22:22:58,126 INFO L472 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-01-09 22:22:58,126 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 663 transitions. [2025-01-09 22:22:58,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:22:58,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:58,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:58,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 22:22:58,126 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:58,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:58,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1311422609, now seen corresponding path program 1 times [2025-01-09 22:22:58,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:58,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255149068] [2025-01-09 22:22:58,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:58,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:58,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:22:58,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:22:58,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:58,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:58,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:58,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255149068] [2025-01-09 22:22:58,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255149068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:58,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:58,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:58,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223883742] [2025-01-09 22:22:58,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:58,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:58,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:58,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:58,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:58,182 INFO L87 Difference]: Start difference. First operand 454 states and 663 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-01-09 22:22:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:58,284 INFO L93 Difference]: Finished difference Result 452 states and 661 transitions. [2025-01-09 22:22:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:58,285 INFO L78 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-01-09 22:22:58,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:58,286 INFO L225 Difference]: With dead ends: 452 [2025-01-09 22:22:58,286 INFO L226 Difference]: Without dead ends: 452 [2025-01-09 22:22:58,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:58,287 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 5 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 261 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-01-09 22:22:58,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 261 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:58,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-01-09 22:22:58,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2025-01-09 22:22:58,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 399 states have (on average 1.6566416040100251) internal successors, (661), 451 states have internal predecessors, (661), 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-01-09 22:22:58,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 661 transitions. [2025-01-09 22:22:58,294 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 661 transitions. Word has length 28 [2025-01-09 22:22:58,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:58,294 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 661 transitions. [2025-01-09 22:22:58,294 INFO L472 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-01-09 22:22:58,294 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 661 transitions. [2025-01-09 22:22:58,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:22:58,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:58,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:58,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 22:22:58,295 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:58,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:58,295 INFO L85 PathProgramCache]: Analyzing trace with hash -807259654, now seen corresponding path program 1 times [2025-01-09 22:22:58,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:58,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979889253] [2025-01-09 22:22:58,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:58,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:58,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:22:58,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:22:58,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:58,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:58,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:58,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:58,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979889253] [2025-01-09 22:22:58,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979889253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:58,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:58,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:22:58,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683211806] [2025-01-09 22:22:58,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:58,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:22:58,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:58,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:22:58,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:22:58,561 INFO L87 Difference]: Start difference. First operand 452 states and 661 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-01-09 22:22:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:59,177 INFO L93 Difference]: Finished difference Result 563 states and 741 transitions. [2025-01-09 22:22:59,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:22:59,177 INFO L78 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-01-09 22:22:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:59,179 INFO L225 Difference]: With dead ends: 563 [2025-01-09 22:22:59,179 INFO L226 Difference]: Without dead ends: 563 [2025-01-09 22:22:59,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:22:59,180 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 335 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:59,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1295 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:22:59,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-01-09 22:22:59,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 423. [2025-01-09 22:22:59,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 370 states have (on average 1.662162162162162) internal successors, (615), 422 states have internal predecessors, (615), 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-01-09 22:22:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 615 transitions. [2025-01-09 22:22:59,188 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 615 transitions. Word has length 28 [2025-01-09 22:22:59,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:59,188 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 615 transitions. [2025-01-09 22:22:59,192 INFO L472 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-01-09 22:22:59,192 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 615 transitions. [2025-01-09 22:22:59,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:22:59,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:59,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:59,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 22:22:59,193 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:59,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:59,193 INFO L85 PathProgramCache]: Analyzing trace with hash -544779445, now seen corresponding path program 1 times [2025-01-09 22:22:59,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:59,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574034351] [2025-01-09 22:22:59,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:59,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:59,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:22:59,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:22:59,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:59,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:59,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:59,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574034351] [2025-01-09 22:22:59,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574034351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:59,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:59,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:22:59,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305789072] [2025-01-09 22:22:59,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:59,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:22:59,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:59,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:22:59,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:22:59,288 INFO L87 Difference]: Start difference. First operand 423 states and 615 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-01-09 22:22:59,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:59,498 INFO L93 Difference]: Finished difference Result 509 states and 760 transitions. [2025-01-09 22:22:59,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:22:59,498 INFO L78 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-01-09 22:22:59,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:59,500 INFO L225 Difference]: With dead ends: 509 [2025-01-09 22:22:59,500 INFO L226 Difference]: Without dead ends: 509 [2025-01-09 22:22:59,500 INFO L434 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-01-09 22:22:59,501 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 79 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:59,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 462 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:22:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-01-09 22:22:59,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 437. [2025-01-09 22:22:59,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 384 states have (on average 1.6458333333333333) internal successors, (632), 436 states have internal predecessors, (632), 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-01-09 22:22:59,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 632 transitions. [2025-01-09 22:22:59,510 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 632 transitions. Word has length 29 [2025-01-09 22:22:59,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:59,510 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 632 transitions. [2025-01-09 22:22:59,510 INFO L472 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-01-09 22:22:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 632 transitions. [2025-01-09 22:22:59,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:22:59,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:59,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:59,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 22:22:59,511 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:22:59,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:59,511 INFO L85 PathProgramCache]: Analyzing trace with hash -544594747, now seen corresponding path program 1 times [2025-01-09 22:22:59,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:59,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777685480] [2025-01-09 22:22:59,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:59,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:59,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:22:59,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:22:59,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:59,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:59,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:59,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777685480] [2025-01-09 22:22:59,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777685480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:59,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:59,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 22:22:59,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327716585] [2025-01-09 22:22:59,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:59,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:22:59,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:59,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:22:59,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:22:59,786 INFO L87 Difference]: Start difference. First operand 437 states and 632 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 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-01-09 22:23:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:00,258 INFO L93 Difference]: Finished difference Result 555 states and 769 transitions. [2025-01-09 22:23:00,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:23:00,258 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 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-01-09 22:23:00,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:00,260 INFO L225 Difference]: With dead ends: 555 [2025-01-09 22:23:00,260 INFO L226 Difference]: Without dead ends: 555 [2025-01-09 22:23:00,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:23:00,260 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 312 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:00,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 998 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:23:00,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-01-09 22:23:00,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 393. [2025-01-09 22:23:00,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 340 states have (on average 1.6323529411764706) internal successors, (555), 392 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-01-09 22:23:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 555 transitions. [2025-01-09 22:23:00,267 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 555 transitions. Word has length 29 [2025-01-09 22:23:00,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:00,267 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 555 transitions. [2025-01-09 22:23:00,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 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-01-09 22:23:00,268 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 555 transitions. [2025-01-09 22:23:00,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:23:00,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:00,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:00,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 22:23:00,268 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:23:00,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:00,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1893013455, now seen corresponding path program 1 times [2025-01-09 22:23:00,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:00,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065145298] [2025-01-09 22:23:00,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:00,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:00,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:23:00,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:23:00,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:00,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:00,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:00,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065145298] [2025-01-09 22:23:00,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065145298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:00,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:00,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:23:00,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523891367] [2025-01-09 22:23:00,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:00,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:23:00,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:00,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:23:00,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:23:00,327 INFO L87 Difference]: Start difference. First operand 393 states and 555 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-01-09 22:23:00,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:00,537 INFO L93 Difference]: Finished difference Result 392 states and 551 transitions. [2025-01-09 22:23:00,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:23:00,538 INFO L78 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-01-09 22:23:00,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:00,539 INFO L225 Difference]: With dead ends: 392 [2025-01-09 22:23:00,539 INFO L226 Difference]: Without dead ends: 392 [2025-01-09 22:23:00,539 INFO L434 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-01-09 22:23:00,539 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 17 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 404 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-01-09 22:23:00,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 404 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:23:00,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-01-09 22:23:00,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-01-09 22:23:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 340 states have (on average 1.6205882352941177) internal successors, (551), 391 states have internal predecessors, (551), 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-01-09 22:23:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 551 transitions. [2025-01-09 22:23:00,546 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 551 transitions. Word has length 30 [2025-01-09 22:23:00,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:00,546 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 551 transitions. [2025-01-09 22:23:00,546 INFO L472 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-01-09 22:23:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 551 transitions. [2025-01-09 22:23:00,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:23:00,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:00,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:00,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 22:23:00,547 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:23:00,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:00,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1893013456, now seen corresponding path program 1 times [2025-01-09 22:23:00,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:00,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831729691] [2025-01-09 22:23:00,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:00,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:23:00,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:23:00,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:00,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:00,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:00,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831729691] [2025-01-09 22:23:00,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831729691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:00,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:00,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:23:00,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404463486] [2025-01-09 22:23:00,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:00,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:23:00,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:00,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:23:00,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:23:00,640 INFO L87 Difference]: Start difference. First operand 392 states and 551 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-01-09 22:23:00,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:00,895 INFO L93 Difference]: Finished difference Result 391 states and 547 transitions. [2025-01-09 22:23:00,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:23:00,895 INFO L78 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-01-09 22:23:00,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:00,896 INFO L225 Difference]: With dead ends: 391 [2025-01-09 22:23:00,896 INFO L226 Difference]: Without dead ends: 391 [2025-01-09 22:23:00,897 INFO L434 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-01-09 22:23:00,897 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 17 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 394 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-01-09 22:23:00,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 394 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:23:00,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-01-09 22:23:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2025-01-09 22:23:00,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 340 states have (on average 1.6088235294117648) internal successors, (547), 390 states have internal predecessors, (547), 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-01-09 22:23:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 547 transitions. [2025-01-09 22:23:00,909 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 547 transitions. Word has length 30 [2025-01-09 22:23:00,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:00,909 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 547 transitions. [2025-01-09 22:23:00,909 INFO L472 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-01-09 22:23:00,909 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 547 transitions. [2025-01-09 22:23:00,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:23:00,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:00,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-01-09 22:23:00,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 22:23:00,910 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:23:00,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:00,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1893016208, now seen corresponding path program 1 times [2025-01-09 22:23:00,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:00,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062537485] [2025-01-09 22:23:00,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:00,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:00,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:23:00,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:23:00,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:00,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:01,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062537485] [2025-01-09 22:23:01,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062537485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:01,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:01,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:23:01,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735879169] [2025-01-09 22:23:01,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:01,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:23:01,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:01,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:23:01,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:23:01,125 INFO L87 Difference]: Start difference. First operand 391 states and 547 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-01-09 22:23:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:01,595 INFO L93 Difference]: Finished difference Result 553 states and 759 transitions. [2025-01-09 22:23:01,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:23:01,595 INFO L78 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-01-09 22:23:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:01,597 INFO L225 Difference]: With dead ends: 553 [2025-01-09 22:23:01,597 INFO L226 Difference]: Without dead ends: 553 [2025-01-09 22:23:01,598 INFO L434 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-01-09 22:23:01,598 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 398 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:01,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 710 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:23:01,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-01-09 22:23:01,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 394. [2025-01-09 22:23:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 343 states have (on average 1.6064139941690962) internal successors, (551), 393 states have internal predecessors, (551), 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-01-09 22:23:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 551 transitions. [2025-01-09 22:23:01,605 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 551 transitions. Word has length 30 [2025-01-09 22:23:01,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:01,605 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 551 transitions. [2025-01-09 22:23:01,606 INFO L472 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-01-09 22:23:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 551 transitions. [2025-01-09 22:23:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:23:01,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:01,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:01,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 22:23:01,606 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:23:01,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:01,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1568332822, now seen corresponding path program 1 times [2025-01-09 22:23:01,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:01,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427433672] [2025-01-09 22:23:01,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:01,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:01,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:23:01,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:23:01,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:01,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:01,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:01,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427433672] [2025-01-09 22:23:01,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427433672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:01,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:01,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:23:01,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17499001] [2025-01-09 22:23:01,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:01,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:23:01,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:01,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:23:01,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:23:01,702 INFO L87 Difference]: Start difference. First operand 394 states and 551 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-01-09 22:23:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:01,805 INFO L93 Difference]: Finished difference Result 391 states and 548 transitions. [2025-01-09 22:23:01,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:23:01,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2025-01-09 22:23:01,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:01,807 INFO L225 Difference]: With dead ends: 391 [2025-01-09 22:23:01,807 INFO L226 Difference]: Without dead ends: 391 [2025-01-09 22:23:01,807 INFO L434 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-01-09 22:23:01,807 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 13 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:01,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 251 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:23:01,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-01-09 22:23:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2025-01-09 22:23:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 343 states have (on average 1.597667638483965) internal successors, (548), 390 states have internal predecessors, (548), 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-01-09 22:23:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 548 transitions. [2025-01-09 22:23:01,813 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 548 transitions. Word has length 31 [2025-01-09 22:23:01,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:01,814 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 548 transitions. [2025-01-09 22:23:01,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-01-09 22:23:01,814 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 548 transitions. [2025-01-09 22:23:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:23:01,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:01,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:01,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 22:23:01,815 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:23:01,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:01,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1446039348, now seen corresponding path program 1 times [2025-01-09 22:23:01,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:01,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20741267] [2025-01-09 22:23:01,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:01,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:01,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:23:01,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:23:01,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:01,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:01,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:01,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:01,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20741267] [2025-01-09 22:23:01,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20741267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:01,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:01,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:23:01,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168279995] [2025-01-09 22:23:01,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:01,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:23:01,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:01,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:23:01,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:23:01,989 INFO L87 Difference]: Start difference. First operand 391 states and 548 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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-01-09 22:23:02,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:02,406 INFO L93 Difference]: Finished difference Result 544 states and 750 transitions. [2025-01-09 22:23:02,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:23:02,407 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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 31 [2025-01-09 22:23:02,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:02,408 INFO L225 Difference]: With dead ends: 544 [2025-01-09 22:23:02,408 INFO L226 Difference]: Without dead ends: 544 [2025-01-09 22:23:02,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:23:02,409 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 260 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:02,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 766 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:23:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-01-09 22:23:02,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 392. [2025-01-09 22:23:02,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 344 states have (on average 1.5959302325581395) internal successors, (549), 391 states have internal predecessors, (549), 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-01-09 22:23:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 549 transitions. [2025-01-09 22:23:02,417 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 549 transitions. Word has length 31 [2025-01-09 22:23:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:02,418 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 549 transitions. [2025-01-09 22:23:02,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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-01-09 22:23:02,418 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 549 transitions. [2025-01-09 22:23:02,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:23:02,418 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:02,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:02,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 22:23:02,419 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:23:02,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:02,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1877546478, now seen corresponding path program 1 times [2025-01-09 22:23:02,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:02,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345023413] [2025-01-09 22:23:02,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:02,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:02,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:23:02,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:23:02,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:02,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:02,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:02,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345023413] [2025-01-09 22:23:02,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345023413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:02,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:02,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:23:02,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060315082] [2025-01-09 22:23:02,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:02,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:23:02,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:02,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:23:02,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:23:02,472 INFO L87 Difference]: Start difference. First operand 392 states and 549 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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-01-09 22:23:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:02,655 INFO L93 Difference]: Finished difference Result 391 states and 545 transitions. [2025-01-09 22:23:02,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:23:02,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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 32 [2025-01-09 22:23:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:02,657 INFO L225 Difference]: With dead ends: 391 [2025-01-09 22:23:02,657 INFO L226 Difference]: Without dead ends: 391 [2025-01-09 22:23:02,657 INFO L434 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-01-09 22:23:02,658 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 16 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:02,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 385 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:23:02,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-01-09 22:23:02,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2025-01-09 22:23:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 344 states have (on average 1.5843023255813953) internal successors, (545), 390 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-01-09 22:23:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 545 transitions. [2025-01-09 22:23:02,664 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 545 transitions. Word has length 32 [2025-01-09 22:23:02,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:02,664 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 545 transitions. [2025-01-09 22:23:02,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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-01-09 22:23:02,664 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 545 transitions. [2025-01-09 22:23:02,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:23:02,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:02,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:02,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 22:23:02,666 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:23:02,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:02,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1843501626, now seen corresponding path program 1 times [2025-01-09 22:23:02,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:02,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595088432] [2025-01-09 22:23:02,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:02,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:02,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:23:02,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:23:02,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:02,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:03,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:03,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595088432] [2025-01-09 22:23:03,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595088432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:03,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:03,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 22:23:03,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044331789] [2025-01-09 22:23:03,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:03,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:23:03,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:03,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:23:03,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:23:03,036 INFO L87 Difference]: Start difference. First operand 391 states and 545 transitions. Second operand has 16 states, 15 states have (on average 2.2) internal successors, (33), 16 states have internal predecessors, (33), 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-01-09 22:23:03,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:03,683 INFO L93 Difference]: Finished difference Result 540 states and 742 transitions. [2025-01-09 22:23:03,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:23:03,683 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 16 states have internal predecessors, (33), 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 33 [2025-01-09 22:23:03,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:03,685 INFO L225 Difference]: With dead ends: 540 [2025-01-09 22:23:03,685 INFO L226 Difference]: Without dead ends: 540 [2025-01-09 22:23:03,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2025-01-09 22:23:03,686 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 327 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:03,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1080 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:23:03,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-01-09 22:23:03,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 396. [2025-01-09 22:23:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 349 states have (on average 1.5787965616045845) internal successors, (551), 395 states have internal predecessors, (551), 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-01-09 22:23:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 551 transitions. [2025-01-09 22:23:03,692 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 551 transitions. Word has length 33 [2025-01-09 22:23:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:03,692 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 551 transitions. [2025-01-09 22:23:03,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 16 states have internal predecessors, (33), 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-01-09 22:23:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 551 transitions. [2025-01-09 22:23:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:23:03,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:03,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:03,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 22:23:03,694 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:23:03,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:03,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1843501627, now seen corresponding path program 1 times [2025-01-09 22:23:03,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:03,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696290811] [2025-01-09 22:23:03,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:03,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:03,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:23:03,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:23:03,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:03,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:04,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:04,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:04,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696290811] [2025-01-09 22:23:04,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696290811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:04,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:04,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 22:23:04,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118429724] [2025-01-09 22:23:04,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:04,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:23:04,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:04,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:23:04,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:23:04,013 INFO L87 Difference]: Start difference. First operand 396 states and 551 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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-01-09 22:23:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:04,660 INFO L93 Difference]: Finished difference Result 531 states and 732 transitions. [2025-01-09 22:23:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:23:04,661 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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 33 [2025-01-09 22:23:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:04,662 INFO L225 Difference]: With dead ends: 531 [2025-01-09 22:23:04,662 INFO L226 Difference]: Without dead ends: 531 [2025-01-09 22:23:04,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:23:04,663 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 281 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:04,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1158 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:23:04,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-01-09 22:23:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 391. [2025-01-09 22:23:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 344 states have (on average 1.5813953488372092) internal successors, (544), 390 states have internal predecessors, (544), 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-01-09 22:23:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 544 transitions. [2025-01-09 22:23:04,671 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 544 transitions. Word has length 33 [2025-01-09 22:23:04,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:04,671 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 544 transitions. [2025-01-09 22:23:04,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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-01-09 22:23:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 544 transitions. [2025-01-09 22:23:04,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:23:04,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:04,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:04,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 22:23:04,672 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:23:04,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:04,673 INFO L85 PathProgramCache]: Analyzing trace with hash -435889772, now seen corresponding path program 1 times [2025-01-09 22:23:04,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:04,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327775123] [2025-01-09 22:23:04,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:04,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:04,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:23:04,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:23:04,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:04,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:04,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:04,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327775123] [2025-01-09 22:23:04,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327775123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:04,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:04,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:23:04,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791730149] [2025-01-09 22:23:04,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:04,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:23:04,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:04,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:23:04,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:23:04,720 INFO L87 Difference]: Start difference. First operand 391 states and 544 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-01-09 22:23:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:04,906 INFO L93 Difference]: Finished difference Result 497 states and 649 transitions. [2025-01-09 22:23:04,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:23:04,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2025-01-09 22:23:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:04,908 INFO L225 Difference]: With dead ends: 497 [2025-01-09 22:23:04,908 INFO L226 Difference]: Without dead ends: 497 [2025-01-09 22:23:04,908 INFO L434 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-01-09 22:23:04,908 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 251 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:04,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 364 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:23:04,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-01-09 22:23:04,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 413. [2025-01-09 22:23:04,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 366 states have (on average 1.598360655737705) internal successors, (585), 412 states have internal predecessors, (585), 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-01-09 22:23:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 585 transitions. [2025-01-09 22:23:04,914 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 585 transitions. Word has length 34 [2025-01-09 22:23:04,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:04,914 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 585 transitions. [2025-01-09 22:23:04,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-01-09 22:23:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 585 transitions. [2025-01-09 22:23:04,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:23:04,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:04,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:04,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 22:23:04,916 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:23:04,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:04,916 INFO L85 PathProgramCache]: Analyzing trace with hash -766917907, now seen corresponding path program 1 times [2025-01-09 22:23:04,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:04,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664078171] [2025-01-09 22:23:04,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:04,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:04,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:23:04,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:23:04,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:04,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:05,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:05,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664078171] [2025-01-09 22:23:05,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664078171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:05,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:05,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:23:05,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718289683] [2025-01-09 22:23:05,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:05,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:23:05,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:05,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:23:05,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:23:05,006 INFO L87 Difference]: Start difference. First operand 413 states and 585 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:05,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:05,164 INFO L93 Difference]: Finished difference Result 412 states and 584 transitions. [2025-01-09 22:23:05,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:23:05,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-01-09 22:23:05,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:05,165 INFO L225 Difference]: With dead ends: 412 [2025-01-09 22:23:05,165 INFO L226 Difference]: Without dead ends: 412 [2025-01-09 22:23:05,165 INFO L434 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-01-09 22:23:05,166 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:05,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 458 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:23:05,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-01-09 22:23:05,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2025-01-09 22:23:05,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 366 states have (on average 1.5956284153005464) internal successors, (584), 411 states have internal predecessors, (584), 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-01-09 22:23:05,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 584 transitions. [2025-01-09 22:23:05,171 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 584 transitions. Word has length 35 [2025-01-09 22:23:05,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:05,172 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 584 transitions. [2025-01-09 22:23:05,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:05,172 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 584 transitions. [2025-01-09 22:23:05,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:23:05,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:05,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:05,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 22:23:05,173 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:23:05,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:05,175 INFO L85 PathProgramCache]: Analyzing trace with hash -766917906, now seen corresponding path program 1 times [2025-01-09 22:23:05,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:05,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642343323] [2025-01-09 22:23:05,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:05,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:05,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:23:05,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:23:05,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:05,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:05,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:05,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:05,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642343323] [2025-01-09 22:23:05,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642343323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:05,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:05,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:23:05,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163966336] [2025-01-09 22:23:05,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:05,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:23:05,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:05,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:23:05,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:23:05,327 INFO L87 Difference]: Start difference. First operand 412 states and 584 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:05,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:05,525 INFO L93 Difference]: Finished difference Result 411 states and 583 transitions. [2025-01-09 22:23:05,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:23:05,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-01-09 22:23:05,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:05,526 INFO L225 Difference]: With dead ends: 411 [2025-01-09 22:23:05,526 INFO L226 Difference]: Without dead ends: 411 [2025-01-09 22:23:05,526 INFO L434 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-01-09 22:23:05,527 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:05,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 428 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:23:05,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-01-09 22:23:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-01-09 22:23:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 366 states have (on average 1.592896174863388) internal successors, (583), 410 states have internal predecessors, (583), 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-01-09 22:23:05,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 583 transitions. [2025-01-09 22:23:05,531 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 583 transitions. Word has length 35 [2025-01-09 22:23:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:05,531 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 583 transitions. [2025-01-09 22:23:05,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 583 transitions. [2025-01-09 22:23:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:23:05,532 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:05,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:05,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 22:23:05,532 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:23:05,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:05,533 INFO L85 PathProgramCache]: Analyzing trace with hash -627680688, now seen corresponding path program 1 times [2025-01-09 22:23:05,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:05,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242806369] [2025-01-09 22:23:05,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:05,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:05,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:23:05,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:23:05,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:05,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:05,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:05,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242806369] [2025-01-09 22:23:05,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242806369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:05,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:05,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 22:23:05,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910130278] [2025-01-09 22:23:05,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:05,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:23:05,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:05,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:23:05,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:23:05,880 INFO L87 Difference]: Start difference. First operand 411 states and 583 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:06,745 INFO L93 Difference]: Finished difference Result 672 states and 902 transitions. [2025-01-09 22:23:06,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 22:23:06,745 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-01-09 22:23:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:06,747 INFO L225 Difference]: With dead ends: 672 [2025-01-09 22:23:06,747 INFO L226 Difference]: Without dead ends: 672 [2025-01-09 22:23:06,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=782, Unknown=0, NotChecked=0, Total=992 [2025-01-09 22:23:06,749 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 517 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:06,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 739 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 22:23:06,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-01-09 22:23:06,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 439. [2025-01-09 22:23:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 394 states have (on average 1.5913705583756346) internal successors, (627), 438 states have internal predecessors, (627), 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-01-09 22:23:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 627 transitions. [2025-01-09 22:23:06,755 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 627 transitions. Word has length 35 [2025-01-09 22:23:06,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:06,755 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 627 transitions. [2025-01-09 22:23:06,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:06,756 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 627 transitions. [2025-01-09 22:23:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:23:06,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:06,756 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:06,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 22:23:06,757 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:23:06,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:06,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1905708269, now seen corresponding path program 1 times [2025-01-09 22:23:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:06,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435589086] [2025-01-09 22:23:06,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:06,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:06,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:23:06,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:23:06,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:06,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:07,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:07,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435589086] [2025-01-09 22:23:07,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435589086] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:07,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682016278] [2025-01-09 22:23:07,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:07,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:07,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:07,135 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:23:07,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:23:07,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:23:07,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:23:07,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:07,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:07,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 22:23:07,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:07,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:23:07,437 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:23:07,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2025-01-09 22:23:07,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:23:07,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2025-01-09 22:23:07,875 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~mem50#1.base_11| Int) (|v_ULTIMATE.start_main_~tmp~0#1.base_73| Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~tmp~0#1.base_73| 1) |v_ULTIMATE.start_main_#t~mem50#1.base_11|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~mem50#1.base_11| 0) |v_ULTIMATE.start_main_~tmp~0#1.base_73| 0)) (= 0 (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~tmp~0#1.base_73|)))) is different from true [2025-01-09 22:23:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-01-09 22:23:07,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:08,054 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1337 (Array Int Int))) (= (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1337) |c_ULTIMATE.start_main_~tree~0#1.base|) 8) 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2025-01-09 22:23:08,061 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1337 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1337) |c_ULTIMATE.start_main_~tree~0#1.base|) 8) 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0))) is different from false [2025-01-09 22:23:08,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:23:08,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2025-01-09 22:23:08,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:23:08,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 50 [2025-01-09 22:23:08,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-01-09 22:23:12,122 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (store (store |c_#valid| |c_ULTIMATE.start_main_#t~malloc4#1.base| 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0)) (.cse1 (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|))) (and (or (= |c_ULTIMATE.start_main_~tree~0#1.offset| 0) (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_64 Int)) (let ((.cse0 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_65 Int)) (= .cse0 (select (store (store |c_#valid| v_arrayElimCell_65 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse0 (select (store (store |c_#valid| v_arrayElimCell_64 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse1 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_64 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| v_arrayElimCell_64 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse1 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse2 v_antiDerIndex_entry0_1)))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse3 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse3 (select .cse2 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_65 Int)) (= .cse3 (select (store (store |c_#valid| v_arrayElimCell_65 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_65 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| v_arrayElimCell_65 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) v_antiDerIndex_entry0_1))) (not .cse1)))) is different from false [2025-01-09 22:23:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:12,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682016278] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:12,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:12,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2025-01-09 22:23:12,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229372568] [2025-01-09 22:23:12,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:12,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 22:23:12,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:12,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 22:23:12,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=737, Unknown=4, NotChecked=228, Total=1056 [2025-01-09 22:23:12,507 INFO L87 Difference]: Start difference. First operand 439 states and 627 transitions. Second operand has 33 states, 32 states have (on average 3.3125) internal successors, (106), 33 states have internal predecessors, (106), 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-01-09 22:23:14,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:14,773 INFO L93 Difference]: Finished difference Result 557 states and 759 transitions. [2025-01-09 22:23:14,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:23:14,774 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.3125) internal successors, (106), 33 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 22:23:14,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:14,775 INFO L225 Difference]: With dead ends: 557 [2025-01-09 22:23:14,775 INFO L226 Difference]: Without dead ends: 556 [2025-01-09 22:23:14,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=191, Invalid=1460, Unknown=5, NotChecked=324, Total=1980 [2025-01-09 22:23:14,776 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 538 mSDsluCounter, 1670 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 3232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1293 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:14,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1802 Invalid, 3232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1912 Invalid, 0 Unknown, 1293 Unchecked, 1.4s Time] [2025-01-09 22:23:14,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-01-09 22:23:14,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 444. [2025-01-09 22:23:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 399 states have (on average 1.5839598997493733) internal successors, (632), 443 states have internal predecessors, (632), 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-01-09 22:23:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 632 transitions. [2025-01-09 22:23:14,783 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 632 transitions. Word has length 37 [2025-01-09 22:23:14,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:14,783 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 632 transitions. [2025-01-09 22:23:14,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.3125) internal successors, (106), 33 states have internal predecessors, (106), 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-01-09 22:23:14,784 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 632 transitions. [2025-01-09 22:23:14,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:23:14,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:14,784 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:14,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 22:23:14,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:14,985 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:23:14,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:14,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1905712266, now seen corresponding path program 1 times [2025-01-09 22:23:14,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:14,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374799973] [2025-01-09 22:23:14,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:14,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:14,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:23:14,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:23:14,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:14,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:15,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:15,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:15,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374799973] [2025-01-09 22:23:15,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374799973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:15,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:15,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:23:15,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159682975] [2025-01-09 22:23:15,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:15,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:23:15,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:15,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:23:15,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:23:15,021 INFO L87 Difference]: Start difference. First operand 444 states and 632 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:15,042 INFO L93 Difference]: Finished difference Result 434 states and 578 transitions. [2025-01-09 22:23:15,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:23:15,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 22:23:15,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:15,044 INFO L225 Difference]: With dead ends: 434 [2025-01-09 22:23:15,044 INFO L226 Difference]: Without dead ends: 414 [2025-01-09 22:23:15,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:23:15,044 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 30 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 325 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-01-09 22:23:15,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 325 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-01-09 22:23:15,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 395. [2025-01-09 22:23:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 350 states have (on average 1.5942857142857143) internal successors, (558), 394 states have internal predecessors, (558), 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-01-09 22:23:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 558 transitions. [2025-01-09 22:23:15,050 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 558 transitions. Word has length 37 [2025-01-09 22:23:15,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:15,050 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 558 transitions. [2025-01-09 22:23:15,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 558 transitions. [2025-01-09 22:23:15,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:23:15,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:15,051 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:15,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 22:23:15,051 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-01-09 22:23:15,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:15,052 INFO L85 PathProgramCache]: Analyzing trace with hash 827827675, now seen corresponding path program 1 times [2025-01-09 22:23:15,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:15,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932791068] [2025-01-09 22:23:15,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:15,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:15,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:23:15,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:23:15,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:15,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:15,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:15,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932791068] [2025-01-09 22:23:15,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932791068] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:15,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689784497] [2025-01-09 22:23:15,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:15,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:15,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:15,608 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:23:15,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 22:23:15,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:23:15,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:23:15,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:15,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:15,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 22:23:15,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:15,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:23:15,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:23:15,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:23:15,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 22:23:15,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-01-09 22:23:15,863 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:23:15,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 22:23:15,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2025-01-09 22:23:15,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 22:23:16,048 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:23:16,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 53 [2025-01-09 22:23:16,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 18 [2025-01-09 22:23:16,124 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:23:16,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:23:16,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2025-01-09 22:23:16,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-01-09 22:23:16,283 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:23:16,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 53 [2025-01-09 22:23:16,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 18 [2025-01-09 22:23:16,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2025-01-09 22:23:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:16,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:16,470 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1468 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1468) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (forall ((v_ArrVal_1469 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1469) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) is different from false [2025-01-09 22:23:16,481 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)))) (and (forall ((v_ArrVal_1469 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1469) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (forall ((v_ArrVal_1468 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1468) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)))) is different from false [2025-01-09 22:23:16,496 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1466 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1466))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1468)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1466 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1467) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1466) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1469) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)))) is different from false