./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.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/array-memsafety/selectionsort-alloca-1.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 1c36df5364345a00481880384557a6da7ee9f3df41e2ea49d72bfaffe4fac7a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:10:33,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:10:33,448 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:10:33,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:10:33,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:10:33,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:10:33,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:10:33,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:10:33,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:10:33,487 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:10:33,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:10:33,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:10:33,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:10:33,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:10:33,489 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:10:33,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:10:33,489 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:10:33,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:10:33,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:10:33,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:10:33,490 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:10:33,490 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:10:33,490 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:10:33,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:10:33,490 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:10:33,491 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:10:33,491 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:10:33,491 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:10:33,491 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:10:33,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:10:33,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:10:33,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:10:33,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:10:33,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:10:33,492 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:10:33,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:10:33,492 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:10:33,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:10:33,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:10:33,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:10:33,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:10:33,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:10:33,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:10:33,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:10:33,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:10:33,493 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:10:33,493 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:10:33,493 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 -> 1c36df5364345a00481880384557a6da7ee9f3df41e2ea49d72bfaffe4fac7a5 [2025-01-09 22:10:33,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:10:33,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:10:33,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:10:33,763 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:10:33,763 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:10:33,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2025-01-09 22:10:35,080 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a7367985/392608ab09584a43961191804d3b7c0f/FLAG14c89b410 [2025-01-09 22:10:35,404 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:10:35,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2025-01-09 22:10:35,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a7367985/392608ab09584a43961191804d3b7c0f/FLAG14c89b410 [2025-01-09 22:10:35,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a7367985/392608ab09584a43961191804d3b7c0f [2025-01-09 22:10:35,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:10:35,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:10:35,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:10:35,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:10:35,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:10:35,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:10:35" (1/1) ... [2025-01-09 22:10:35,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13229752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:35, skipping insertion in model container [2025-01-09 22:10:35,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:10:35" (1/1) ... [2025-01-09 22:10:35,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:10:35,710 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:10:35,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:10:35,720 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:10:35,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:10:35,777 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:10:35,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:35 WrapperNode [2025-01-09 22:10:35,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:10:35,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:10:35,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:10:35,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:10:35,786 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:10:35" (1/1) ... [2025-01-09 22:10:35,797 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:10:35" (1/1) ... [2025-01-09 22:10:35,815 INFO L138 Inliner]: procedures = 116, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-01-09 22:10:35,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:10:35,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:10:35,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:10:35,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:10:35,824 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:35" (1/1) ... [2025-01-09 22:10:35,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:35" (1/1) ... [2025-01-09 22:10:35,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:35" (1/1) ... [2025-01-09 22:10:35,839 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2025-01-09 22:10:35,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:35" (1/1) ... [2025-01-09 22:10:35,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:35" (1/1) ... [2025-01-09 22:10:35,844 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:35" (1/1) ... [2025-01-09 22:10:35,845 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:35" (1/1) ... [2025-01-09 22:10:35,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:35" (1/1) ... [2025-01-09 22:10:35,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:35" (1/1) ... [2025-01-09 22:10:35,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:35" (1/1) ... [2025-01-09 22:10:35,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:10:35,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:10:35,851 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:10:35,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:10:35,852 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:35" (1/1) ... [2025-01-09 22:10:35,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:10:35,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:10:35,878 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:10:35,880 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:10:35,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:10:35,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:10:35,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:10:35,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:10:35,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:10:35,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:10:35,978 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:10:35,980 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:10:36,180 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-01-09 22:10:36,180 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:10:36,191 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:10:36,193 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:10:36,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:10:36 BoogieIcfgContainer [2025-01-09 22:10:36,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:10:36,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:10:36,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:10:36,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:10:36,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:10:35" (1/3) ... [2025-01-09 22:10:36,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b9204a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:10:36, skipping insertion in model container [2025-01-09 22:10:36,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:35" (2/3) ... [2025-01-09 22:10:36,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b9204a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:10:36, skipping insertion in model container [2025-01-09 22:10:36,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:10:36" (3/3) ... [2025-01-09 22:10:36,204 INFO L128 eAbstractionObserver]: Analyzing ICFG selectionsort-alloca-1.i [2025-01-09 22:10:36,217 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:10:36,220 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG selectionsort-alloca-1.i that has 1 procedures, 39 locations, 1 initial locations, 3 loop locations, and 15 error locations. [2025-01-09 22:10:36,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:10:36,269 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;@46b89864, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:10:36,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-01-09 22:10:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 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:10:36,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:10:36,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:36,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:10:36,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:36,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:36,281 INFO L85 PathProgramCache]: Analyzing trace with hash 889508746, now seen corresponding path program 1 times [2025-01-09 22:10:36,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:36,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388270088] [2025-01-09 22:10:36,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:36,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:36,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:10:36,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:10:36,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:36,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:36,736 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:10:36,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:36,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388270088] [2025-01-09 22:10:36,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388270088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:10:36,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:10:36,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:10:36,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595560071] [2025-01-09 22:10:36,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:10:36,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:10:36,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:36,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:10:36,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:10:36,761 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 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 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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:10:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:36,856 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2025-01-09 22:10:36,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:10:36,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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:10:36,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:36,862 INFO L225 Difference]: With dead ends: 48 [2025-01-09 22:10:36,862 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 22:10:36,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:10:36,867 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:36,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 97 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:10:36,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 22:10:36,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2025-01-09 22:10:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.8) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 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:10:36,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2025-01-09 22:10:36,902 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 6 [2025-01-09 22:10:36,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:36,902 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-01-09 22:10:36,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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:10:36,903 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2025-01-09 22:10:36,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:10:36,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:36,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:10:36,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:10:36,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:36,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:36,904 INFO L85 PathProgramCache]: Analyzing trace with hash 889508745, now seen corresponding path program 1 times [2025-01-09 22:10:36,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:36,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846218639] [2025-01-09 22:10:36,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:36,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:36,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:10:36,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:10:36,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:36,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:36,998 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:10:36,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:36,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846218639] [2025-01-09 22:10:36,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846218639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:10:36,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:10:36,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:10:36,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038846118] [2025-01-09 22:10:36,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:10:37,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:10:37,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:37,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:10:37,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:10:37,000 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:10:37,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:37,042 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2025-01-09 22:10:37,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:10:37,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:10:37,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:37,043 INFO L225 Difference]: With dead ends: 39 [2025-01-09 22:10:37,044 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 22:10:37,044 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:10:37,045 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:37,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:10:37,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 22:10:37,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-01-09 22:10:37,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.72) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 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:10:37,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-01-09 22:10:37,051 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 6 [2025-01-09 22:10:37,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:37,051 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-01-09 22:10:37,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:10:37,052 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2025-01-09 22:10:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:10:37,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:37,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:10:37,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:10:37,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:37,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:37,056 INFO L85 PathProgramCache]: Analyzing trace with hash 889568328, now seen corresponding path program 1 times [2025-01-09 22:10:37,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:37,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557945638] [2025-01-09 22:10:37,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:37,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:37,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:10:37,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:10:37,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:37,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:37,356 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:10:37,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:37,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557945638] [2025-01-09 22:10:37,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557945638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:10:37,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:10:37,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:10:37,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013486871] [2025-01-09 22:10:37,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:10:37,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:10:37,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:37,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:10:37,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:10:37,357 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 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:10:37,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:37,416 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2025-01-09 22:10:37,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:10:37,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 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:10:37,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:37,417 INFO L225 Difference]: With dead ends: 42 [2025-01-09 22:10:37,417 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 22:10:37,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:10:37,418 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:37,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 83 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:10:37,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 22:10:37,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2025-01-09 22:10:37,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.75) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 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:10:37,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-01-09 22:10:37,421 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 6 [2025-01-09 22:10:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:37,422 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-01-09 22:10:37,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 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:10:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-01-09 22:10:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:10:37,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:37,422 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:37,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:10:37,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:37,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:37,423 INFO L85 PathProgramCache]: Analyzing trace with hash -593207060, now seen corresponding path program 1 times [2025-01-09 22:10:37,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:37,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304433449] [2025-01-09 22:10:37,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:37,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:37,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:10:37,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:10:37,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:37,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:37,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:37,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:37,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304433449] [2025-01-09 22:10:37,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304433449] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:10:37,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715112534] [2025-01-09 22:10:37,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:37,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:37,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:10:37,498 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:10:37,500 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:10:37,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:10:37,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:10:37,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:37,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:37,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 22:10:37,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:10:37,613 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:10:37,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:10:37,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715112534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:10:37,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:10:37,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-09 22:10:37,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374246642] [2025-01-09 22:10:37,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:10:37,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:10:37,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:37,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:10:37,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:10:37,615 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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:10:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:37,647 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2025-01-09 22:10:37,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:10:37,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-01-09 22:10:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:37,650 INFO L225 Difference]: With dead ends: 43 [2025-01-09 22:10:37,650 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 22:10:37,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:10:37,651 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:37,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:10:37,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 22:10:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-01-09 22:10:37,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 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:10:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-01-09 22:10:37,656 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 9 [2025-01-09 22:10:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:37,656 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-01-09 22:10:37,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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:10:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-01-09 22:10:37,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:10:37,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:37,657 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:37,667 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:10:37,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:37,858 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:37,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:37,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1181800302, now seen corresponding path program 1 times [2025-01-09 22:10:37,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:37,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488719496] [2025-01-09 22:10:37,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:37,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:37,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:10:37,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:10:37,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:37,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:38,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:38,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488719496] [2025-01-09 22:10:38,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488719496] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:10:38,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145607737] [2025-01-09 22:10:38,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:38,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:38,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:10:38,186 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:10:38,188 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:10:38,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:10:38,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:10:38,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:38,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:38,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 22:10:38,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:10:38,301 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 10 treesize of output 9 [2025-01-09 22:10:38,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:38,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:10:38,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:38,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145607737] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:10:38,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:10:38,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-01-09 22:10:38,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46396341] [2025-01-09 22:10:38,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:10:38,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:10:38,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:38,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:10:38,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:10:38,820 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 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:10:39,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:39,037 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2025-01-09 22:10:39,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:10:39,038 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 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 9 [2025-01-09 22:10:39,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:39,039 INFO L225 Difference]: With dead ends: 46 [2025-01-09 22:10:39,040 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 22:10:39,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:10:39,041 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 19 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:39,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 189 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:10:39,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 22:10:39,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2025-01-09 22:10:39,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 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:10:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-01-09 22:10:39,044 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 9 [2025-01-09 22:10:39,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:39,045 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-01-09 22:10:39,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 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:10:39,045 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-01-09 22:10:39,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:10:39,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:39,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:39,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:10:39,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:39,250 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:39,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:39,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1158852527, now seen corresponding path program 1 times [2025-01-09 22:10:39,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:39,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198615601] [2025-01-09 22:10:39,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:39,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:39,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:10:39,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:10:39,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:39,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:10:39,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:39,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198615601] [2025-01-09 22:10:39,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198615601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:10:39,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:10:39,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:10:39,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526384828] [2025-01-09 22:10:39,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:10:39,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:10:39,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:39,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:10:39,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:10:39,329 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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:10:39,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:39,380 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2025-01-09 22:10:39,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:10:39,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2025-01-09 22:10:39,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:39,381 INFO L225 Difference]: With dead ends: 35 [2025-01-09 22:10:39,381 INFO L226 Difference]: Without dead ends: 35 [2025-01-09 22:10:39,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:10:39,383 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:39,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 34 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:10:39,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-09 22:10:39,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-09 22:10:39,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 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:10:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-01-09 22:10:39,389 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 11 [2025-01-09 22:10:39,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:39,390 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-01-09 22:10:39,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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:10:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-01-09 22:10:39,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:10:39,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:39,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:39,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:10:39,391 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:39,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:39,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1158852528, now seen corresponding path program 1 times [2025-01-09 22:10:39,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:39,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845585263] [2025-01-09 22:10:39,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:39,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:39,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:10:39,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:10:39,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:39,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:10:39,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:39,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845585263] [2025-01-09 22:10:39,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845585263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:10:39,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:10:39,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:10:39,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448193715] [2025-01-09 22:10:39,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:10:39,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:10:39,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:39,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:10:39,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:10:39,440 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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:10:39,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:39,464 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2025-01-09 22:10:39,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:10:39,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2025-01-09 22:10:39,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:39,465 INFO L225 Difference]: With dead ends: 36 [2025-01-09 22:10:39,465 INFO L226 Difference]: Without dead ends: 36 [2025-01-09 22:10:39,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:10:39,466 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:39,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:10:39,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-09 22:10:39,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-09 22:10:39,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 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:10:39,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-01-09 22:10:39,468 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 11 [2025-01-09 22:10:39,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:39,469 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-01-09 22:10:39,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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:10:39,469 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-01-09 22:10:39,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:10:39,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:39,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:39,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:10:39,469 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:39,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:39,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1158887731, now seen corresponding path program 1 times [2025-01-09 22:10:39,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:39,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944211424] [2025-01-09 22:10:39,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:39,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:39,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:10:39,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:10:39,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:39,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:39,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:10:39,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:39,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944211424] [2025-01-09 22:10:39,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944211424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:10:39,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:10:39,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:10:39,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430048964] [2025-01-09 22:10:39,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:10:39,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:10:39,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:39,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:10:39,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:10:39,549 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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:10:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:39,568 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2025-01-09 22:10:39,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:10:39,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2025-01-09 22:10:39,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:39,569 INFO L225 Difference]: With dead ends: 35 [2025-01-09 22:10:39,569 INFO L226 Difference]: Without dead ends: 27 [2025-01-09 22:10:39,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:10:39,570 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:39,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 44 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:10:39,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-09 22:10:39,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-01-09 22:10:39,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 26 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:10:39,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-01-09 22:10:39,573 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 11 [2025-01-09 22:10:39,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:39,573 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-01-09 22:10:39,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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:10:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2025-01-09 22:10:39,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:10:39,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:39,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:39,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:10:39,574 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:39,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:39,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1838910898, now seen corresponding path program 1 times [2025-01-09 22:10:39,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:39,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457146957] [2025-01-09 22:10:39,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:39,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:39,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:10:39,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:10:39,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:39,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:39,651 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:10:39,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:39,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457146957] [2025-01-09 22:10:39,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457146957] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:10:39,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457347901] [2025-01-09 22:10:39,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:39,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:39,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:10:39,654 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:10:39,656 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:10:39,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:10:39,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:10:39,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:39,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:39,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 22:10:39,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:10:39,737 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:10:39,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:10:39,767 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:10:39,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457347901] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:10:39,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:10:39,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 22:10:39,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744109622] [2025-01-09 22:10:39,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:10:39,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:10:39,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:39,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:10:39,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:10:39,770 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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:10:39,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:39,799 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2025-01-09 22:10:39,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:10:39,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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 11 [2025-01-09 22:10:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:39,802 INFO L225 Difference]: With dead ends: 33 [2025-01-09 22:10:39,803 INFO L226 Difference]: Without dead ends: 32 [2025-01-09 22:10:39,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:10:39,803 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:39,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 65 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:10:39,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-09 22:10:39,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-01-09 22:10:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.375) internal successors, (33), 29 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:10:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2025-01-09 22:10:39,805 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2025-01-09 22:10:39,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:39,805 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2025-01-09 22:10:39,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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:10:39,805 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2025-01-09 22:10:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:10:39,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:39,807 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:39,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:10:40,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:40,011 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:40,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:40,011 INFO L85 PathProgramCache]: Analyzing trace with hash -624854452, now seen corresponding path program 2 times [2025-01-09 22:10:40,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:40,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810731617] [2025-01-09 22:10:40,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:10:40,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:40,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-09 22:10:40,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 14 statements. [2025-01-09 22:10:40,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:10:40,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:10:40,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:40,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810731617] [2025-01-09 22:10:40,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810731617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:10:40,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:10:40,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:10:40,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622621829] [2025-01-09 22:10:40,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:10:40,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:10:40,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:40,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:10:40,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:10:40,041 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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:10:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:40,056 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2025-01-09 22:10:40,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:10:40,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 14 [2025-01-09 22:10:40,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:40,056 INFO L225 Difference]: With dead ends: 31 [2025-01-09 22:10:40,056 INFO L226 Difference]: Without dead ends: 31 [2025-01-09 22:10:40,057 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:10:40,057 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:40,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 41 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:10:40,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-09 22:10:40,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-01-09 22:10:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.36) internal successors, (34), 30 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:10:40,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-01-09 22:10:40,059 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 14 [2025-01-09 22:10:40,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:40,059 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-01-09 22:10:40,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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:10:40,059 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-01-09 22:10:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:10:40,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:40,062 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:40,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:10:40,062 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:40,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:40,062 INFO L85 PathProgramCache]: Analyzing trace with hash -624854932, now seen corresponding path program 1 times [2025-01-09 22:10:40,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:40,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570621586] [2025-01-09 22:10:40,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:40,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:40,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:10:40,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:10:40,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:40,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:40,297 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:10:40,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:40,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570621586] [2025-01-09 22:10:40,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570621586] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:10:40,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387367939] [2025-01-09 22:10:40,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:40,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:40,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:10:40,300 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:10:40,302 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:10:40,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:10:40,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:10:40,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:40,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:40,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 22:10:40,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:10:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:40,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:10:40,563 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 24 treesize of output 20 [2025-01-09 22:10:40,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:40,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387367939] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:10:40,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:10:40,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-01-09 22:10:40,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103147371] [2025-01-09 22:10:40,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:10:40,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:10:40,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:40,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:10:40,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:10:40,638 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 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:10:40,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:40,892 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2025-01-09 22:10:40,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:10:40,892 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 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 14 [2025-01-09 22:10:40,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:40,893 INFO L225 Difference]: With dead ends: 50 [2025-01-09 22:10:40,893 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 22:10:40,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:10:40,894 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:40,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 84 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:10:40,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 22:10:40,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2025-01-09 22:10:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 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:10:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-01-09 22:10:40,897 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 14 [2025-01-09 22:10:40,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:40,897 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-01-09 22:10:40,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 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:10:40,898 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-01-09 22:10:40,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:10:40,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:40,898 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:40,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 22:10:41,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 22:10:41,105 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:41,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:41,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2104333559, now seen corresponding path program 1 times [2025-01-09 22:10:41,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:41,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143139611] [2025-01-09 22:10:41,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:41,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:41,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:10:41,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:10:41,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:41,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:10:41,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:41,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143139611] [2025-01-09 22:10:41,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143139611] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:10:41,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030407996] [2025-01-09 22:10:41,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:41,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:41,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:10:41,316 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:10:41,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:10:41,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:10:41,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:10:41,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:41,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:41,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:10:41,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:10:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:10:41,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:10:41,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030407996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:10:41,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:10:41,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-01-09 22:10:41,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440313806] [2025-01-09 22:10:41,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:10:41,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:10:41,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:41,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:10:41,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:10:41,477 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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:10:41,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:41,604 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2025-01-09 22:10:41,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:10:41,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 15 [2025-01-09 22:10:41,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:41,605 INFO L225 Difference]: With dead ends: 64 [2025-01-09 22:10:41,605 INFO L226 Difference]: Without dead ends: 64 [2025-01-09 22:10:41,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:10:41,606 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:41,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 49 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:10:41,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-09 22:10:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2025-01-09 22:10:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 62 states have internal predecessors, (79), 0 states have call successors, (0), 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:10:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2025-01-09 22:10:41,609 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 79 transitions. Word has length 15 [2025-01-09 22:10:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:41,609 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 79 transitions. [2025-01-09 22:10:41,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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:10:41,610 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2025-01-09 22:10:41,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:10:41,610 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:41,610 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:41,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 22:10:41,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 22:10:41,811 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:41,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:41,811 INFO L85 PathProgramCache]: Analyzing trace with hash 839977308, now seen corresponding path program 1 times [2025-01-09 22:10:41,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:41,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929414048] [2025-01-09 22:10:41,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:41,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:41,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:10:41,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:10:41,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:41,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:41,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:41,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:41,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929414048] [2025-01-09 22:10:41,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929414048] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:10:41,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768953123] [2025-01-09 22:10:41,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:41,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:41,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:10:41,914 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:10:41,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:10:41,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:10:41,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:10:41,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:41,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:41,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:10:41,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:10:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:42,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:10:42,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:42,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768953123] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:10:42,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:10:42,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-01-09 22:10:42,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665983043] [2025-01-09 22:10:42,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:10:42,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:10:42,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:42,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:10:42,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:10:42,103 INFO L87 Difference]: Start difference. First operand 63 states and 79 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 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:10:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:42,195 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2025-01-09 22:10:42,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:10:42,195 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 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 19 [2025-01-09 22:10:42,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:42,196 INFO L225 Difference]: With dead ends: 110 [2025-01-09 22:10:42,196 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 22:10:42,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:10:42,197 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:42,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 87 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:10:42,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 22:10:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2025-01-09 22:10:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 104 states have internal predecessors, (132), 0 states have call successors, (0), 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:10:42,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 132 transitions. [2025-01-09 22:10:42,204 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 132 transitions. Word has length 19 [2025-01-09 22:10:42,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:42,204 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 132 transitions. [2025-01-09 22:10:42,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 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:10:42,204 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2025-01-09 22:10:42,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:10:42,205 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:42,205 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:42,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 22:10:42,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 22:10:42,406 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:42,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:42,406 INFO L85 PathProgramCache]: Analyzing trace with hash -235197827, now seen corresponding path program 1 times [2025-01-09 22:10:42,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:42,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845722067] [2025-01-09 22:10:42,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:42,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:42,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:10:42,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:10:42,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:42,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:10:42,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:42,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845722067] [2025-01-09 22:10:42,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845722067] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:10:42,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208307060] [2025-01-09 22:10:42,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:42,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:42,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:10:42,569 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:10:42,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 22:10:42,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:10:42,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:10:42,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:42,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:42,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:10:42,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:10:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:10:42,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:10:42,804 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 10 treesize of output 8 [2025-01-09 22:10:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:10:42,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208307060] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:10:42,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:10:42,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-01-09 22:10:42,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133586521] [2025-01-09 22:10:42,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:10:42,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 22:10:42,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:42,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 22:10:42,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:10:42,857 INFO L87 Difference]: Start difference. First operand 105 states and 132 transitions. Second operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 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:10:43,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:43,216 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2025-01-09 22:10:43,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 22:10:43,217 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 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 21 [2025-01-09 22:10:43,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:43,218 INFO L225 Difference]: With dead ends: 115 [2025-01-09 22:10:43,218 INFO L226 Difference]: Without dead ends: 115 [2025-01-09 22:10:43,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2025-01-09 22:10:43,220 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 78 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:43,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 83 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:10:43,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-09 22:10:43,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 68. [2025-01-09 22:10:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 67 states have internal predecessors, (80), 0 states have call successors, (0), 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:10:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2025-01-09 22:10:43,224 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 21 [2025-01-09 22:10:43,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:43,224 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2025-01-09 22:10:43,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 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:10:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2025-01-09 22:10:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:10:43,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:43,224 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:43,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 22:10:43,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:43,425 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:43,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:43,425 INFO L85 PathProgramCache]: Analyzing trace with hash -239748106, now seen corresponding path program 2 times [2025-01-09 22:10:43,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:43,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040804777] [2025-01-09 22:10:43,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:10:43,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:43,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-09 22:10:43,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:10:43,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:10:43,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:10:43,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:43,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040804777] [2025-01-09 22:10:43,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040804777] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:10:43,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818058976] [2025-01-09 22:10:43,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:10:43,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:43,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:10:43,690 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:10:43,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 22:10:43,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-09 22:10:43,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:10:43,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:10:43,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:43,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 22:10:43,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:10:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:43,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:10:44,062 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 24 treesize of output 20 [2025-01-09 22:10:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:44,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818058976] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:10:44,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:10:44,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-01-09 22:10:44,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119930169] [2025-01-09 22:10:44,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:10:44,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 22:10:44,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:44,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 22:10:44,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:10:44,152 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 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:10:44,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:44,655 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2025-01-09 22:10:44,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:10:44,656 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 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 22 [2025-01-09 22:10:44,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:44,656 INFO L225 Difference]: With dead ends: 82 [2025-01-09 22:10:44,656 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 22:10:44,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 22:10:44,659 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 102 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:44,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 98 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:10:44,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 22:10:44,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 67. [2025-01-09 22:10:44,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 64 states have (on average 1.21875) internal successors, (78), 66 states have internal predecessors, (78), 0 states have call successors, (0), 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:10:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2025-01-09 22:10:44,666 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 22 [2025-01-09 22:10:44,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:44,666 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2025-01-09 22:10:44,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 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:10:44,666 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2025-01-09 22:10:44,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:10:44,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:44,667 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:44,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 22:10:44,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 22:10:44,867 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:44,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:44,868 INFO L85 PathProgramCache]: Analyzing trace with hash 2058209497, now seen corresponding path program 1 times [2025-01-09 22:10:44,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:44,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638654657] [2025-01-09 22:10:44,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:44,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:44,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:10:44,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:10:44,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:44,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:10:44,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:44,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638654657] [2025-01-09 22:10:44,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638654657] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:10:44,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977556825] [2025-01-09 22:10:44,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:44,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:44,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:10:44,971 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:10:44,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 22:10:45,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:10:45,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:10:45,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:45,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:45,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 22:10:45,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:10:45,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:10:45,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:10:45,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:10:45,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977556825] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:10:45,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:10:45,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-09 22:10:45,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138984096] [2025-01-09 22:10:45,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:10:45,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:10:45,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:45,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:10:45,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:10:45,189 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 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:10:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:45,251 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2025-01-09 22:10:45,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:10:45,251 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 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:10:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:45,252 INFO L225 Difference]: With dead ends: 59 [2025-01-09 22:10:45,252 INFO L226 Difference]: Without dead ends: 44 [2025-01-09 22:10:45,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:10:45,253 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:45,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 123 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:10:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-09 22:10:45,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-01-09 22:10:45,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 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:10:45,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-01-09 22:10:45,258 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 28 [2025-01-09 22:10:45,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:45,258 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-01-09 22:10:45,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 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:10:45,259 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-01-09 22:10:45,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:10:45,260 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:45,260 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:45,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 22:10:45,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:45,461 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:45,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:45,461 INFO L85 PathProgramCache]: Analyzing trace with hash 408904575, now seen corresponding path program 2 times [2025-01-09 22:10:45,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:45,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232010514] [2025-01-09 22:10:45,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:10:45,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:45,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 22:10:45,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:10:45,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:10:45,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:45,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:45,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232010514] [2025-01-09 22:10:45,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232010514] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:10:45,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954177328] [2025-01-09 22:10:45,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:10:45,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:45,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:10:45,610 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:10:45,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 22:10:45,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 22:10:45,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:10:45,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:10:45,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:45,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:10:45,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:10:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:45,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:10:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:45,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954177328] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:10:45,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:10:45,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-01-09 22:10:45,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986179475] [2025-01-09 22:10:45,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:10:45,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:10:45,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:45,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:10:45,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:10:45,821 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 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:10:45,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:45,989 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2025-01-09 22:10:45,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:10:45,990 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 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:10:45,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:45,990 INFO L225 Difference]: With dead ends: 54 [2025-01-09 22:10:45,990 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 22:10:45,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:10:45,991 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 60 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:45,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 97 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:10:45,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 22:10:45,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2025-01-09 22:10:45,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 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:10:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-01-09 22:10:45,993 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 31 [2025-01-09 22:10:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:45,993 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-01-09 22:10:45,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 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:10:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-01-09 22:10:45,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:10:45,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:45,998 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:46,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 22:10:46,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 22:10:46,199 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:46,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:46,199 INFO L85 PathProgramCache]: Analyzing trace with hash 867701475, now seen corresponding path program 3 times [2025-01-09 22:10:46,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:46,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036405761] [2025-01-09 22:10:46,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:10:46,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:46,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 4 equivalence classes. [2025-01-09 22:10:46,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 36 statements. [2025-01-09 22:10:46,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 22:10:46,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:46,380 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 22:10:46,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:46,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036405761] [2025-01-09 22:10:46,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036405761] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:10:46,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826069840] [2025-01-09 22:10:46,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:10:46,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:46,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:10:46,382 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:10:46,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 22:10:46,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 4 equivalence classes. [2025-01-09 22:10:46,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 36 statements. [2025-01-09 22:10:46,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 22:10:46,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:46,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 22:10:46,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:10:46,647 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 22:10:46,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:10:47,022 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 5 [2025-01-09 22:10:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 22:10:47,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826069840] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:10:47,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:10:47,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-01-09 22:10:47,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910093871] [2025-01-09 22:10:47,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:10:47,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:10:47,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:47,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:10:47,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:10:47,047 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 20 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:10:47,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:47,395 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2025-01-09 22:10:47,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:10:47,395 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 20 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 36 [2025-01-09 22:10:47,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:47,396 INFO L225 Difference]: With dead ends: 54 [2025-01-09 22:10:47,396 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 22:10:47,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2025-01-09 22:10:47,396 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:47,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 90 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:10:47,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 22:10:47,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2025-01-09 22:10:47,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 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:10:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2025-01-09 22:10:47,398 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 36 [2025-01-09 22:10:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:47,398 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2025-01-09 22:10:47,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 20 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:10:47,399 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2025-01-09 22:10:47,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:10:47,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:47,399 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:47,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 22:10:47,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 22:10:47,604 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:47,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:47,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1740938459, now seen corresponding path program 1 times [2025-01-09 22:10:47,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:47,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93158985] [2025-01-09 22:10:47,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:47,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:47,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:10:47,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:10:47,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:47,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:10:47,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:47,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93158985] [2025-01-09 22:10:47,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93158985] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:10:47,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345494019] [2025-01-09 22:10:47,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:47,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:47,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:10:47,832 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:10:47,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 22:10:47,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:10:47,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:10:47,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:47,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:47,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 22:10:47,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:10:48,174 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 22:10:48,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:10:48,289 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 30 treesize of output 26 [2025-01-09 22:10:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 22:10:48,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345494019] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:10:48,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:10:48,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2025-01-09 22:10:48,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907632459] [2025-01-09 22:10:48,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:10:48,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 22:10:48,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:48,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 22:10:48,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:10:48,404 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 23 states have internal predecessors, (104), 0 states have call successors, (0), 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:10:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:49,014 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2025-01-09 22:10:49,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 22:10:49,015 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 23 states have internal predecessors, (104), 0 states have call successors, (0), 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 41 [2025-01-09 22:10:49,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:49,015 INFO L225 Difference]: With dead ends: 116 [2025-01-09 22:10:49,015 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 22:10:49,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=410, Invalid=1482, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 22:10:49,017 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 81 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:49,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 98 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:10:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 22:10:49,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 42. [2025-01-09 22:10:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 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:10:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2025-01-09 22:10:49,020 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 41 [2025-01-09 22:10:49,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:49,021 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2025-01-09 22:10:49,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 23 states have internal predecessors, (104), 0 states have call successors, (0), 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:10:49,022 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2025-01-09 22:10:49,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:10:49,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:49,022 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:49,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-09 22:10:49,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:49,227 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:49,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:49,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1740938939, now seen corresponding path program 4 times [2025-01-09 22:10:49,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:49,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597548750] [2025-01-09 22:10:49,228 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:10:49,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:49,236 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-01-09 22:10:49,245 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 35 of 41 statements. [2025-01-09 22:10:49,245 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 22:10:49,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:10:49,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:49,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597548750] [2025-01-09 22:10:49,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597548750] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:10:49,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444456654] [2025-01-09 22:10:49,327 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:10:49,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:49,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:10:49,329 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:10:49,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 22:10:49,383 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-01-09 22:10:49,405 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 35 of 41 statements. [2025-01-09 22:10:49,405 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 22:10:49,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:49,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 22:10:49,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:10:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:10:49,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:10:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:10:49,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444456654] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:10:49,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:10:49,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2025-01-09 22:10:49,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624338720] [2025-01-09 22:10:49,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:10:49,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:10:49,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:49,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:10:49,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:10:49,509 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 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:10:49,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:49,582 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2025-01-09 22:10:49,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:10:49,583 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 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 41 [2025-01-09 22:10:49,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:49,584 INFO L225 Difference]: With dead ends: 85 [2025-01-09 22:10:49,584 INFO L226 Difference]: Without dead ends: 64 [2025-01-09 22:10:49,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:10:49,584 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:49,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 102 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:10:49,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-09 22:10:49,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2025-01-09 22:10:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:10:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2025-01-09 22:10:49,586 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 41 [2025-01-09 22:10:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:49,586 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-01-09 22:10:49,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 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:10:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2025-01-09 22:10:49,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 22:10:49,587 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:49,587 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:49,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 22:10:49,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:49,788 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:49,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:49,788 INFO L85 PathProgramCache]: Analyzing trace with hash -451206231, now seen corresponding path program 5 times [2025-01-09 22:10:49,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:49,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244299661] [2025-01-09 22:10:49,788 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 22:10:49,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:49,796 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 46 statements into 5 equivalence classes. [2025-01-09 22:10:49,823 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:10:49,823 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-01-09 22:10:49,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 35 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:10:49,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:49,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244299661] [2025-01-09 22:10:49,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244299661] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:10:49,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376825102] [2025-01-09 22:10:49,935 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 22:10:49,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:49,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:10:49,939 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:10:49,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 22:10:49,994 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 46 statements into 5 equivalence classes. [2025-01-09 22:10:50,027 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:10:50,028 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-01-09 22:10:50,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:50,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:10:50,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:10:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 31 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:10:50,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:10:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 35 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:10:50,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376825102] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:10:50,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:10:50,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2025-01-09 22:10:50,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544491932] [2025-01-09 22:10:50,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:10:50,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 22:10:50,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:50,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 22:10:50,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2025-01-09 22:10:50,330 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 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:10:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:50,529 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2025-01-09 22:10:50,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:10:50,530 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 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 46 [2025-01-09 22:10:50,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:50,530 INFO L225 Difference]: With dead ends: 80 [2025-01-09 22:10:50,530 INFO L226 Difference]: Without dead ends: 61 [2025-01-09 22:10:50,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 22:10:50,531 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:50,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 145 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:10:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-09 22:10:50,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2025-01-09 22:10:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 0 states have call successors, (0), 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:10:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2025-01-09 22:10:50,533 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 46 [2025-01-09 22:10:50,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:50,533 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2025-01-09 22:10:50,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 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:10:50,537 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2025-01-09 22:10:50,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:10:50,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:50,537 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:50,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-09 22:10:50,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-09 22:10:50,738 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-09 22:10:50,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:50,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1277845297, now seen corresponding path program 6 times [2025-01-09 22:10:50,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:50,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566788313] [2025-01-09 22:10:50,739 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 22:10:50,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:50,749 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 5 equivalence classes. [2025-01-09 22:10:50,760 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 49 statements. [2025-01-09 22:10:50,761 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-09 22:10:50,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 22:10:51,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:51,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566788313] [2025-01-09 22:10:51,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566788313] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:10:51,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208674064] [2025-01-09 22:10:51,007 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 22:10:51,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:51,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:10:51,009 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:10:51,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 22:10:51,068 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 5 equivalence classes. [2025-01-09 22:10:51,104 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 49 statements. [2025-01-09 22:10:51,104 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-09 22:10:51,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:51,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:10:51,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:10:51,151 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 10 treesize of output 9 [2025-01-09 22:10:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 22:10:52,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:10:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 22:10:53,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208674064] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:10:53,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:10:53,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2025-01-09 22:10:53,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909889386] [2025-01-09 22:10:53,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:10:53,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 22:10:53,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:53,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 22:10:53,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2025-01-09 22:10:53,112 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 28 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 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:10:53,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:53,624 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2025-01-09 22:10:53,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:10:53,625 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 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 49 [2025-01-09 22:10:53,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:53,625 INFO L225 Difference]: With dead ends: 65 [2025-01-09 22:10:53,625 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 22:10:53,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 22:10:53,627 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 44 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:53,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 87 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:10:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 22:10:53,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 22:10:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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:10:53,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 22:10:53,628 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2025-01-09 22:10:53,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:53,628 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 22:10:53,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 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:10:53,628 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 22:10:53,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 22:10:53,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2025-01-09 22:10:53,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2025-01-09 22:10:53,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2025-01-09 22:10:53,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2025-01-09 22:10:53,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-01-09 22:10:53,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-01-09 22:10:53,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2025-01-09 22:10:53,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-01-09 22:10:53,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-01-09 22:10:53,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2025-01-09 22:10:53,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-01-09 22:10:53,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-01-09 22:10:53,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 15 remaining) [2025-01-09 22:10:53,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2025-01-09 22:10:53,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2025-01-09 22:10:53,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-09 22:10:53,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:53,836 INFO L422 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:53,838 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:10:53,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:10:53 BoogieIcfgContainer [2025-01-09 22:10:53,840 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:10:53,840 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:10:53,840 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:10:53,840 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:10:53,841 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:10:36" (3/4) ... [2025-01-09 22:10:53,843 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 22:10:53,850 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-09 22:10:53,850 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 22:10:53,850 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 22:10:53,850 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 22:10:53,928 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 22:10:53,929 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 22:10:53,929 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:10:53,932 INFO L158 Benchmark]: Toolchain (without parser) took 18489.60ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 113.9MB in the beginning and 165.5MB in the end (delta: -51.7MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2025-01-09 22:10:53,932 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:10:53,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.58ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 97.0MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:10:53,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.55ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 95.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:10:53,933 INFO L158 Benchmark]: Boogie Preprocessor took 33.52ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:10:53,933 INFO L158 Benchmark]: RCFGBuilder took 341.82ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 79.8MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:10:53,933 INFO L158 Benchmark]: TraceAbstraction took 17644.85ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 79.3MB in the beginning and 171.2MB in the end (delta: -91.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:10:53,933 INFO L158 Benchmark]: Witness Printer took 88.79ms. Allocated memory is still 218.1MB. Free memory was 171.2MB in the beginning and 165.5MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:10:53,934 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.58ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 97.0MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.55ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 95.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.52ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 341.82ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 79.8MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17644.85ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 79.3MB in the beginning and 171.2MB in the end (delta: -91.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 88.79ms. Allocated memory is still 218.1MB. Free memory was 171.2MB in the beginning and 165.5MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 22, TraceHistogramMax: 5, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 661 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 661 mSDsluCounter, 1926 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1475 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3228 IncrementalHoareTripleChecker+Invalid, 3301 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 451 mSDtfsCounter, 3228 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 955 GetRequests, 616 SyntacticMatches, 21 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1852 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=13, InterpolantAutomatonStates: 206, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 191 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 849 NumberOfCodeBlocks, 767 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 1167 ConstructedInterpolants, 33 QuantifiedInterpolants, 12895 SizeOfPredicates, 54 NumberOfNonLiveVariables, 1679 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 50 InterpolantComputations, 9 PerfectInterpolantSequences, 497/871 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 22:10:53,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE