./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array26_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array26_pattern.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56ad35a361c83538323b9be55683beef9c8271c8f67221c1a0924c8496da71d0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:13:22,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:13:22,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 17:13:22,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:13:22,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:13:22,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:13:22,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:13:22,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:13:22,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:13:22,314 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:13:22,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:13:22,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:13:22,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:13:22,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:13:22,316 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:13:22,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:13:22,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:13:22,316 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:13:22,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 17:13:22,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:13:22,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:13:22,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:13:22,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:13:22,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:13:22,317 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:13:22,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:13:22,317 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:13:22,317 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:13:22,317 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:13:22,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:13:22,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:13:22,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:13:22,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:13:22,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:13:22,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:13:22,318 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:13:22,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:13:22,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 17:13:22,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 17:13:22,319 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:13:22,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:13:22,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:13:22,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:13:22,319 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 ! call(reach_error())) ) 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 -> 56ad35a361c83538323b9be55683beef9c8271c8f67221c1a0924c8496da71d0 [2025-02-07 17:13:22,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:13:22,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:13:22,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:13:22,570 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:13:22,570 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:13:22,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array26_pattern.c [2025-02-07 17:13:23,788 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27db4c711/cdf136d6a8674b60958b80deb1d0446b/FLAG538026723 [2025-02-07 17:13:23,999 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:13:23,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array26_pattern.c [2025-02-07 17:13:24,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27db4c711/cdf136d6a8674b60958b80deb1d0446b/FLAG538026723 [2025-02-07 17:13:24,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27db4c711/cdf136d6a8674b60958b80deb1d0446b [2025-02-07 17:13:24,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:13:24,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:13:24,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:13:24,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:13:24,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:13:24,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dbdacf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24, skipping insertion in model container [2025-02-07 17:13:24,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:13:24,488 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array26_pattern.c[1324,1337] [2025-02-07 17:13:24,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:13:24,513 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:13:24,519 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array26_pattern.c[1324,1337] [2025-02-07 17:13:24,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:13:24,539 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:13:24,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24 WrapperNode [2025-02-07 17:13:24,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:13:24,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:13:24,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:13:24,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:13:24,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,564 INFO L138 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-02-07 17:13:24,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:13:24,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:13:24,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:13:24,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:13:24,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,590 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-02-07 17:13:24,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,596 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:13:24,603 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:13:24,603 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:13:24,604 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:13:24,604 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:13:24,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:24,630 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-02-07 17:13:24,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 17:13:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:13:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 17:13:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 17:13:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 17:13:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 17:13:24,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 17:13:24,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:13:24,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:13:24,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 17:13:24,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 17:13:24,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 17:13:24,694 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:13:24,695 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:13:24,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45: call ULTIMATE.dealloc(main_~#array~0#1.base, main_~#array~0#1.offset);havoc main_~#array~0#1.base, main_~#array~0#1.offset; [2025-02-07 17:13:24,834 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-02-07 17:13:24,834 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:13:24,840 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:13:24,840 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:13:24,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:13:24 BoogieIcfgContainer [2025-02-07 17:13:24,841 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:13:24,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:13:24,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:13:24,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:13:24,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:13:24" (1/3) ... [2025-02-07 17:13:24,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf9efc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:13:24, skipping insertion in model container [2025-02-07 17:13:24,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (2/3) ... [2025-02-07 17:13:24,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf9efc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:13:24, skipping insertion in model container [2025-02-07 17:13:24,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:13:24" (3/3) ... [2025-02-07 17:13:24,847 INFO L128 eAbstractionObserver]: Analyzing ICFG array26_pattern.c [2025-02-07 17:13:24,857 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:13:24,858 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array26_pattern.c that has 1 procedures, 17 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-07 17:13:24,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:13:24,906 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=LoopHeads, 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;@545efe90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:13:24,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:13:24,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 17:13:24,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:24,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:24,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:24,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:24,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2077304463, now seen corresponding path program 1 times [2025-02-07 17:13:24,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:24,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96363600] [2025-02-07 17:13:24,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:24,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:24,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 17:13:24,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 17:13:24,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:24,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:13:25,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:25,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96363600] [2025-02-07 17:13:25,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96363600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:13:25,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:13:25,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 17:13:25,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421039049] [2025-02-07 17:13:25,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:13:25,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 17:13:25,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:25,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 17:13:25,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 17:13:25,038 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:25,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:25,048 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2025-02-07 17:13:25,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 17:13:25,050 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-02-07 17:13:25,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:25,054 INFO L225 Difference]: With dead ends: 32 [2025-02-07 17:13:25,054 INFO L226 Difference]: Without dead ends: 13 [2025-02-07 17:13:25,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 17:13:25,057 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:25,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:13:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-07 17:13:25,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-07 17:13:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2025-02-07 17:13:25,079 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 7 [2025-02-07 17:13:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:25,079 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-02-07 17:13:25,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2025-02-07 17:13:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 17:13:25,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:25,081 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:25,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 17:13:25,082 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:25,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:25,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2048675312, now seen corresponding path program 1 times [2025-02-07 17:13:25,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:25,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796469255] [2025-02-07 17:13:25,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:25,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:25,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 17:13:25,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 17:13:25,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:25,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:13:25,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:25,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796469255] [2025-02-07 17:13:25,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796469255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:13:25,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:13:25,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:13:25,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571872434] [2025-02-07 17:13:25,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:13:25,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:13:25,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:25,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:13:25,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:13:25,218 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:25,231 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2025-02-07 17:13:25,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:13:25,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-02-07 17:13:25,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:25,233 INFO L225 Difference]: With dead ends: 18 [2025-02-07 17:13:25,234 INFO L226 Difference]: Without dead ends: 15 [2025-02-07 17:13:25,234 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-02-07 17:13:25,235 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:25,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 36 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:13:25,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-07 17:13:25,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-07 17:13:25,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2025-02-07 17:13:25,242 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 21 transitions. Word has length 7 [2025-02-07 17:13:25,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:25,242 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-02-07 17:13:25,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2025-02-07 17:13:25,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 17:13:25,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:25,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:25,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 17:13:25,244 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:25,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:25,244 INFO L85 PathProgramCache]: Analyzing trace with hash -511235052, now seen corresponding path program 1 times [2025-02-07 17:13:25,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:25,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219328629] [2025-02-07 17:13:25,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:25,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:25,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 17:13:25,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 17:13:25,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:25,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:25,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:13:25,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:25,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219328629] [2025-02-07 17:13:25,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219328629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:13:25,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:13:25,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:13:25,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611315510] [2025-02-07 17:13:25,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:13:25,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:13:25,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:25,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:13:25,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:13:25,363 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:25,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:25,418 INFO L93 Difference]: Finished difference Result 36 states and 54 transitions. [2025-02-07 17:13:25,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:13:25,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-07 17:13:25,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:25,419 INFO L225 Difference]: With dead ends: 36 [2025-02-07 17:13:25,419 INFO L226 Difference]: Without dead ends: 23 [2025-02-07 17:13:25,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:13:25,420 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:25,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 15 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:13:25,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-07 17:13:25,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2025-02-07 17:13:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:25,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2025-02-07 17:13:25,428 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 10 [2025-02-07 17:13:25,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:25,428 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2025-02-07 17:13:25,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2025-02-07 17:13:25,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 17:13:25,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:25,429 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:25,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 17:13:25,429 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:25,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:25,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2074478779, now seen corresponding path program 1 times [2025-02-07 17:13:25,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:25,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908495087] [2025-02-07 17:13:25,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:25,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:25,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 17:13:25,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 17:13:25,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:25,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 17:13:25,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:25,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908495087] [2025-02-07 17:13:25,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908495087] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:13:25,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:13:25,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:13:25,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041316537] [2025-02-07 17:13:25,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:13:25,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:13:25,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:25,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:13:25,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:13:25,532 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-02-07 17:13:25,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:25,590 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. [2025-02-07 17:13:25,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:13:25,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 12 [2025-02-07 17:13:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:25,591 INFO L225 Difference]: With dead ends: 40 [2025-02-07 17:13:25,592 INFO L226 Difference]: Without dead ends: 24 [2025-02-07 17:13:25,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:13:25,593 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:25,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 13 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:13:25,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-07 17:13:25,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-02-07 17:13:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2025-02-07 17:13:25,601 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 12 [2025-02-07 17:13:25,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:25,601 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-02-07 17:13:25,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-02-07 17:13:25,601 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2025-02-07 17:13:25,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 17:13:25,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:25,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:25,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 17:13:25,602 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:25,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:25,602 INFO L85 PathProgramCache]: Analyzing trace with hash 289856207, now seen corresponding path program 1 times [2025-02-07 17:13:25,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:25,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413026402] [2025-02-07 17:13:25,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:25,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:25,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 17:13:25,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 17:13:25,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:25,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 17:13:25,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:25,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413026402] [2025-02-07 17:13:25,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413026402] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:25,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678514147] [2025-02-07 17:13:25,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:25,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:25,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:25,729 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-02-07 17:13:25,730 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-02-07 17:13:25,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 17:13:25,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 17:13:25,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:25,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:25,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-07 17:13:25,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:25,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:13:25,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:13:25,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:26,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2025-02-07 17:13:26,136 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 59 treesize of output 55 [2025-02-07 17:13:26,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:13:26,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678514147] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:26,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:26,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-02-07 17:13:26,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762321486] [2025-02-07 17:13:26,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:26,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-07 17:13:26,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:26,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-07 17:13:26,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-02-07 17:13:26,253 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 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-02-07 17:13:26,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:26,922 INFO L93 Difference]: Finished difference Result 72 states and 107 transitions. [2025-02-07 17:13:26,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-07 17:13:26,923 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 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) Word has length 15 [2025-02-07 17:13:26,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:26,925 INFO L225 Difference]: With dead ends: 72 [2025-02-07 17:13:26,926 INFO L226 Difference]: Without dead ends: 60 [2025-02-07 17:13:26,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=1100, Unknown=0, NotChecked=0, Total=1406 [2025-02-07 17:13:26,928 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 63 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:26,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 25 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 17:13:26,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-07 17:13:26,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 30. [2025-02-07 17:13:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:26,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-02-07 17:13:26,940 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2025-02-07 17:13:26,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:26,940 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-02-07 17:13:26,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 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-02-07 17:13:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2025-02-07 17:13:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 17:13:26,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:26,940 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:26,948 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-02-07 17:13:27,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:27,146 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:27,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1839512235, now seen corresponding path program 2 times [2025-02-07 17:13:27,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:27,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281720211] [2025-02-07 17:13:27,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:13:27,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:27,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-07 17:13:27,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 17:13:27,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:13:27,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 17:13:27,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:27,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281720211] [2025-02-07 17:13:27,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281720211] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:27,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065453003] [2025-02-07 17:13:27,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:13:27,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:27,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:27,262 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-02-07 17:13:27,264 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-02-07 17:13:27,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-07 17:13:27,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 17:13:27,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:13:27,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:27,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:13:27,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 17:13:27,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 17:13:27,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065453003] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:27,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:27,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2025-02-07 17:13:27,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660555146] [2025-02-07 17:13:27,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:27,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 17:13:27,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:27,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 17:13:27,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-02-07 17:13:27,417 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 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-02-07 17:13:27,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:27,602 INFO L93 Difference]: Finished difference Result 82 states and 115 transitions. [2025-02-07 17:13:27,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 17:13:27,602 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 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 19 [2025-02-07 17:13:27,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:27,603 INFO L225 Difference]: With dead ends: 82 [2025-02-07 17:13:27,603 INFO L226 Difference]: Without dead ends: 64 [2025-02-07 17:13:27,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2025-02-07 17:13:27,604 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 68 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:27,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 18 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:13:27,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-07 17:13:27,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 51. [2025-02-07 17:13:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2025-02-07 17:13:27,615 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 19 [2025-02-07 17:13:27,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:27,616 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2025-02-07 17:13:27,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 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-02-07 17:13:27,616 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2025-02-07 17:13:27,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 17:13:27,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:27,617 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:27,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 17:13:27,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:27,817 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:27,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:27,818 INFO L85 PathProgramCache]: Analyzing trace with hash -278314547, now seen corresponding path program 1 times [2025-02-07 17:13:27,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:27,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882095829] [2025-02-07 17:13:27,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:27,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:27,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 17:13:27,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 17:13:27,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:27,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-07 17:13:27,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:27,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882095829] [2025-02-07 17:13:27,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882095829] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:27,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134962207] [2025-02-07 17:13:27,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:27,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:27,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:27,972 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-02-07 17:13:27,973 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-02-07 17:13:28,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 17:13:28,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 17:13:28,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:28,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:28,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-07 17:13:28,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-07 17:13:28,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-07 17:13:28,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134962207] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:28,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:28,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 7] total 12 [2025-02-07 17:13:28,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090358623] [2025-02-07 17:13:28,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:28,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 17:13:28,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:28,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 17:13:28,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-02-07 17:13:28,254 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:28,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:28,621 INFO L93 Difference]: Finished difference Result 176 states and 249 transitions. [2025-02-07 17:13:28,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-07 17:13:28,621 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-07 17:13:28,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:28,622 INFO L225 Difference]: With dead ends: 176 [2025-02-07 17:13:28,622 INFO L226 Difference]: Without dead ends: 131 [2025-02-07 17:13:28,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2025-02-07 17:13:28,623 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 72 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:28,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 28 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:13:28,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-07 17:13:28,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 106. [2025-02-07 17:13:28,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.3333333333333333) internal successors, (140), 105 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 140 transitions. [2025-02-07 17:13:28,645 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 140 transitions. Word has length 33 [2025-02-07 17:13:28,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:28,645 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 140 transitions. [2025-02-07 17:13:28,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:28,645 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 140 transitions. [2025-02-07 17:13:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-07 17:13:28,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:28,646 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:28,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 17:13:28,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:28,852 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:28,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:28,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1084558851, now seen corresponding path program 2 times [2025-02-07 17:13:28,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:28,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205457543] [2025-02-07 17:13:28,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:13:28,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:28,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-07 17:13:28,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 17:13:28,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:13:28,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 17:13:28,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [180306407] [2025-02-07 17:13:28,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:13:28,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:28,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:28,882 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-02-07 17:13:28,884 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-02-07 17:13:28,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-07 17:13:28,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 17:13:28,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:13:28,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:28,994 WARN L254 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-02-07 17:13:28,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:29,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:13:29,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 17:13:29,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:29,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:29,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:29,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2025-02-07 17:13:29,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:29,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:29,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:29,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:13:29,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:29,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2025-02-07 17:13:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:13:29,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:31,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 471 treesize of output 455 [2025-02-07 17:13:31,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:31,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 959662395 treesize of output 919816541 [2025-02-07 17:13:47,095 WARN L286 SmtUtils]: Spent 15.63s on a formula simplification. DAG size of input: 10252 DAG size of output: 1376 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)