./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array27_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array27_pattern.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e2a4cc1bd1815c470836bbbcc9d3775eac69b651b7231d974ae63a065851dd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:38:57,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:38:57,322 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:38:57,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:38:57,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:38:57,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:38:57,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:38:57,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:38:57,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:38:57,352 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:38:57,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:38:57,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:38:57,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:38:57,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:38:57,353 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:38:57,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:38:57,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:38:57,354 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:38:57,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:38:57,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:38:57,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:38:57,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:38:57,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:38:57,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:38:57,354 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:38:57,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:38:57,354 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:38:57,354 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:38:57,355 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:38:57,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:38:57,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:38:57,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:38:57,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:38:57,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:38:57,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:38:57,356 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:38:57,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:38:57,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:38:57,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:38:57,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:38:57,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:38:57,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:38:57,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:38:57,356 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 8e2a4cc1bd1815c470836bbbcc9d3775eac69b651b7231d974ae63a065851dd1 [2025-03-08 00:38:57,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:38:57,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:38:57,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:38:57,566 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:38:57,566 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:38:57,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array27_pattern.c [2025-03-08 00:38:58,722 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ef06f78a/b4b7bf7111924f2e8d7d97185ef75b7d/FLAG12de8bfe9 [2025-03-08 00:38:58,945 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:38:58,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array27_pattern.c [2025-03-08 00:38:58,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ef06f78a/b4b7bf7111924f2e8d7d97185ef75b7d/FLAG12de8bfe9 [2025-03-08 00:38:59,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ef06f78a/b4b7bf7111924f2e8d7d97185ef75b7d [2025-03-08 00:38:59,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:38:59,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:38:59,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:38:59,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:38:59,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:38:59,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:38:59" (1/1) ... [2025-03-08 00:38:59,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35bbe078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:59, skipping insertion in model container [2025-03-08 00:38:59,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:38:59" (1/1) ... [2025-03-08 00:38:59,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:38:59,374 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array27_pattern.c[1253,1266] [2025-03-08 00:38:59,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:38:59,392 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:38:59,398 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array27_pattern.c[1253,1266] [2025-03-08 00:38:59,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:38:59,410 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:38:59,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:59 WrapperNode [2025-03-08 00:38:59,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:38:59,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:38:59,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:38:59,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:38:59,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:59" (1/1) ... [2025-03-08 00:38:59,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:59" (1/1) ... [2025-03-08 00:38:59,428 INFO L138 Inliner]: procedures = 16, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2025-03-08 00:38:59,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:38:59,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:38:59,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:38:59,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:38:59,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:59" (1/1) ... [2025-03-08 00:38:59,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:59" (1/1) ... [2025-03-08 00:38:59,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:59" (1/1) ... [2025-03-08 00:38:59,441 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-08 00:38:59,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:59" (1/1) ... [2025-03-08 00:38:59,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:59" (1/1) ... [2025-03-08 00:38:59,444 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:59" (1/1) ... [2025-03-08 00:38:59,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:59" (1/1) ... [2025-03-08 00:38:59,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:59" (1/1) ... [2025-03-08 00:38:59,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:59" (1/1) ... [2025-03-08 00:38:59,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:38:59,447 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:38:59,447 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:38:59,447 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:38:59,448 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:59" (1/1) ... [2025-03-08 00:38:59,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:38:59,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:38:59,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:38:59,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:38:59,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:38:59,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:38:59,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:38:59,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:38:59,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:38:59,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:38:59,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:38:59,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:38:59,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:38:59,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:38:59,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:38:59,533 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:38:59,534 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:38:59,629 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: 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-03-08 00:38:59,638 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 00:38:59,638 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:38:59,644 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:38:59,644 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:38:59,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:38:59 BoogieIcfgContainer [2025-03-08 00:38:59,644 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:38:59,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:38:59,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:38:59,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:38:59,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:38:59" (1/3) ... [2025-03-08 00:38:59,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a5bbc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:38:59, skipping insertion in model container [2025-03-08 00:38:59,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:59" (2/3) ... [2025-03-08 00:38:59,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a5bbc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:38:59, skipping insertion in model container [2025-03-08 00:38:59,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:38:59" (3/3) ... [2025-03-08 00:38:59,650 INFO L128 eAbstractionObserver]: Analyzing ICFG array27_pattern.c [2025-03-08 00:38:59,660 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:38:59,662 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array27_pattern.c that has 1 procedures, 17 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-08 00:38:59,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:38:59,701 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;@2b7a47d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:38:59,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:38:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:38:59,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 00:38:59,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:59,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:59,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:59,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:59,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1736782630, now seen corresponding path program 1 times [2025-03-08 00:38:59,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:59,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113536007] [2025-03-08 00:38:59,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:38:59,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:59,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 00:38:59,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 00:38:59,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:38:59,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:38:59,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:59,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113536007] [2025-03-08 00:38:59,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113536007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:38:59,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:38:59,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:38:59,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139711628] [2025-03-08 00:38:59,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:38:59,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:38:59,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:59,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:38:59,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:38:59,817 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:38:59,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:59,824 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2025-03-08 00:38:59,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:38:59,825 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-03-08 00:38:59,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:59,828 INFO L225 Difference]: With dead ends: 31 [2025-03-08 00:38:59,828 INFO L226 Difference]: Without dead ends: 13 [2025-03-08 00:38:59,830 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-03-08 00:38:59,832 INFO L435 NwaCegarLoop]: 21 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, 21 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-03-08 00:38:59,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:38:59,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-08 00:38:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-08 00:38:59,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:38:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-03-08 00:38:59,854 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 8 [2025-03-08 00:38:59,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:59,854 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-08 00:38:59,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:38:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2025-03-08 00:38:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 00:38:59,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:59,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:59,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:38:59,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:59,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:59,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1708153479, now seen corresponding path program 1 times [2025-03-08 00:38:59,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:59,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119360573] [2025-03-08 00:38:59,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:38:59,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:59,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 00:38:59,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 00:38:59,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:38:59,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:00,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:39:00,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:00,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119360573] [2025-03-08 00:39:00,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119360573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:39:00,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:39:00,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 00:39:00,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966469739] [2025-03-08 00:39:00,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:39:00,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:39:00,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:00,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:39:00,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:39:00,020 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:39:00,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:00,070 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2025-03-08 00:39:00,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:39:00,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-03-08 00:39:00,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:00,071 INFO L225 Difference]: With dead ends: 24 [2025-03-08 00:39:00,071 INFO L226 Difference]: Without dead ends: 19 [2025-03-08 00:39:00,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:39:00,072 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:00,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 8 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:39:00,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-08 00:39:00,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2025-03-08 00:39:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-03-08 00:39:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-03-08 00:39:00,078 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 8 [2025-03-08 00:39:00,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:00,078 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-08 00:39:00,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:39:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2025-03-08 00:39:00,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 00:39:00,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:00,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:00,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:39:00,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:00,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:00,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1998959274, now seen corresponding path program 1 times [2025-03-08 00:39:00,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:00,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374324394] [2025-03-08 00:39:00,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:00,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:00,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 00:39:00,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 00:39:00,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:00,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:00,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:39:00,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:00,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374324394] [2025-03-08 00:39:00,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374324394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:39:00,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:39:00,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:39:00,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637702353] [2025-03-08 00:39:00,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:39:00,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:39:00,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:00,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:39:00,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:39:00,187 INFO L87 Difference]: Start difference. First operand 15 states and 19 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-03-08 00:39:00,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:00,234 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2025-03-08 00:39:00,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:39:00,235 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-03-08 00:39:00,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:00,235 INFO L225 Difference]: With dead ends: 33 [2025-03-08 00:39:00,236 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 00:39:00,236 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-03-08 00:39:00,237 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:00,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 17 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:39:00,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 00:39:00,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2025-03-08 00:39:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:39:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-08 00:39:00,242 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2025-03-08 00:39:00,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:00,242 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-08 00:39:00,242 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-03-08 00:39:00,243 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-08 00:39:00,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 00:39:00,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:00,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:00,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:39:00,243 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:00,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:00,244 INFO L85 PathProgramCache]: Analyzing trace with hash 919905528, now seen corresponding path program 1 times [2025-03-08 00:39:00,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:00,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746269056] [2025-03-08 00:39:00,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:00,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:00,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 00:39:00,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:39:00,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:00,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:39:00,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37015653] [2025-03-08 00:39:00,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:00,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:00,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:00,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:00,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:39:00,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 00:39:00,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:39:00,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:00,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:00,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 00:39:00,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:00,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:39:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:39:00,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:39:00,757 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 35 treesize of output 33 [2025-03-08 00:39:00,762 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 55 treesize of output 53 [2025-03-08 00:39:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:39:00,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:00,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746269056] [2025-03-08 00:39:00,854 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:39:00,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37015653] [2025-03-08 00:39:00,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37015653] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:39:00,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:39:00,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2025-03-08 00:39:00,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259113249] [2025-03-08 00:39:00,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:39:00,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 00:39:00,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:00,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 00:39:00,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:39:00,859 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:39:01,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:01,644 INFO L93 Difference]: Finished difference Result 79 states and 121 transitions. [2025-03-08 00:39:01,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 00:39:01,644 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 00:39:01,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:01,646 INFO L225 Difference]: With dead ends: 79 [2025-03-08 00:39:01,646 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 00:39:01,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=388, Invalid=1018, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 00:39:01,647 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 68 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:01,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 38 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:39:01,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 00:39:01,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2025-03-08 00:39:01,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.489795918367347) internal successors, (73), 49 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:39:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2025-03-08 00:39:01,664 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 16 [2025-03-08 00:39:01,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:01,664 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2025-03-08 00:39:01,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:39:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2025-03-08 00:39:01,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:39:01,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:01,665 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:01,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 00:39:01,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:01,865 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:01,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:01,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1546744434, now seen corresponding path program 2 times [2025-03-08 00:39:01,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:01,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645001409] [2025-03-08 00:39:01,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:39:01,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:01,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-08 00:39:01,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:39:01,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:39:01,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:39:01,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:01,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645001409] [2025-03-08 00:39:01,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645001409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:39:01,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550971633] [2025-03-08 00:39:01,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:39:01,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:01,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:01,961 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:01,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:39:01,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-08 00:39:01,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:39:01,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:39:01,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:01,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:39:02,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:02,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:39:02,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:39:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:39:02,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550971633] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:39:02,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:39:02,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-08 00:39:02,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153211040] [2025-03-08 00:39:02,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:39:02,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:39:02,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:02,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:39:02,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:39:02,085 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:39:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:02,276 INFO L93 Difference]: Finished difference Result 131 states and 200 transitions. [2025-03-08 00:39:02,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 00:39:02,276 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 00:39:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:02,277 INFO L225 Difference]: With dead ends: 131 [2025-03-08 00:39:02,277 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 00:39:02,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2025-03-08 00:39:02,278 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 49 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:02,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 36 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:39:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 00:39:02,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2025-03-08 00:39:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 67 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:39:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 102 transitions. [2025-03-08 00:39:02,301 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 102 transitions. Word has length 17 [2025-03-08 00:39:02,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:02,301 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 102 transitions. [2025-03-08 00:39:02,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:39:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 102 transitions. [2025-03-08 00:39:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:39:02,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:02,302 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:02,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:39:02,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:02,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:02,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:02,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1778528500, now seen corresponding path program 1 times [2025-03-08 00:39:02,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:02,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855835831] [2025-03-08 00:39:02,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:02,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:02,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 00:39:02,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:39:02,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:02,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:02,581 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:39:02,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:02,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855835831] [2025-03-08 00:39:02,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855835831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:39:02,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360011747] [2025-03-08 00:39:02,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:02,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:02,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:02,583 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:02,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:39:02,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 00:39:02,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:39:02,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:02,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:02,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 00:39:02,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:39:02,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:39:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:39:02,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360011747] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:39:02,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:39:02,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-08 00:39:02,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601592334] [2025-03-08 00:39:02,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:39:02,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:39:02,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:02,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:39:02,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:39:02,673 INFO L87 Difference]: Start difference. First operand 68 states and 102 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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-03-08 00:39:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:02,798 INFO L93 Difference]: Finished difference Result 111 states and 169 transitions. [2025-03-08 00:39:02,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:39:02,798 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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 21 [2025-03-08 00:39:02,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:02,799 INFO L225 Difference]: With dead ends: 111 [2025-03-08 00:39:02,799 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 00:39:02,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2025-03-08 00:39:02,800 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 58 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:02,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 26 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:39:02,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 00:39:02,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2025-03-08 00:39:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:39:02,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2025-03-08 00:39:02,807 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 21 [2025-03-08 00:39:02,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:02,807 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2025-03-08 00:39:02,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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-03-08 00:39:02,807 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2025-03-08 00:39:02,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 00:39:02,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:02,808 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:02,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:39:03,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:03,008 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:03,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:03,009 INFO L85 PathProgramCache]: Analyzing trace with hash -476648078, now seen corresponding path program 2 times [2025-03-08 00:39:03,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:03,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187777377] [2025-03-08 00:39:03,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:39:03,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:03,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-08 00:39:03,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:39:03,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:39:03,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:39:03,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:03,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187777377] [2025-03-08 00:39:03,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187777377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:39:03,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93291223] [2025-03-08 00:39:03,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:39:03,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:03,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:03,098 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:03,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:39:03,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-08 00:39:03,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:39:03,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:39:03,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:03,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:39:03,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:39:03,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:39:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:39:03,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93291223] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:39:03,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:39:03,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:39:03,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656771334] [2025-03-08 00:39:03,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:39:03,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:39:03,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:03,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:39:03,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:39:03,226 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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-03-08 00:39:03,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:03,365 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2025-03-08 00:39:03,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:39:03,366 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-08 00:39:03,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:03,366 INFO L225 Difference]: With dead ends: 57 [2025-03-08 00:39:03,366 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 00:39:03,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:39:03,367 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 50 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:03,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 19 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:39:03,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 00:39:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2025-03-08 00:39:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 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-03-08 00:39:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-03-08 00:39:03,379 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 28 [2025-03-08 00:39:03,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:03,379 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-03-08 00:39:03,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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-03-08 00:39:03,379 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-03-08 00:39:03,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 00:39:03,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:03,379 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:03,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 00:39:03,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:03,580 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:03,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:03,580 INFO L85 PathProgramCache]: Analyzing trace with hash -529554348, now seen corresponding path program 3 times [2025-03-08 00:39:03,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:03,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926437636] [2025-03-08 00:39:03,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:39:03,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:03,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 6 equivalence classes. [2025-03-08 00:39:03,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:39:03,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 00:39:03,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:39:03,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:03,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926437636] [2025-03-08 00:39:03,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926437636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:39:03,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945293168] [2025-03-08 00:39:03,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:39:03,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:03,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:03,774 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:03,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:39:03,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 6 equivalence classes. [2025-03-08 00:39:04,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:39:04,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 00:39:04,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:04,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 00:39:04,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:39:04,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:39:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:39:04,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945293168] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:39:04,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:39:04,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 23 [2025-03-08 00:39:04,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819814296] [2025-03-08 00:39:04,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:39:04,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 00:39:04,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:04,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 00:39:04,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:39:04,405 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 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-03-08 00:39:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:05,030 INFO L93 Difference]: Finished difference Result 99 states and 129 transitions. [2025-03-08 00:39:05,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-08 00:39:05,031 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 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) Word has length 32 [2025-03-08 00:39:05,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:05,031 INFO L225 Difference]: With dead ends: 99 [2025-03-08 00:39:05,031 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 00:39:05,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=750, Invalid=1902, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 00:39:05,033 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 87 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:05,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 32 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:39:05,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 00:39:05,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 35. [2025-03-08 00:39:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 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-03-08 00:39:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2025-03-08 00:39:05,043 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 32 [2025-03-08 00:39:05,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:05,043 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-03-08 00:39:05,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 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-03-08 00:39:05,043 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2025-03-08 00:39:05,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 00:39:05,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:05,044 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:05,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 00:39:05,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:05,244 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:05,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:05,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2037106157, now seen corresponding path program 4 times [2025-03-08 00:39:05,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:05,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256171672] [2025-03-08 00:39:05,245 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:39:05,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:05,251 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-08 00:39:05,262 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:39:05,262 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:39:05,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:39:05,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [918381485] [2025-03-08 00:39:05,263 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:39:05,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:05,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:05,265 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:05,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:39:05,294 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-08 00:39:05,357 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:39:05,357 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:39:05,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:05,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-08 00:39:05,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:05,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:39:05,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:39:05,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:05,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:05,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:39:05,560 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-03-08 00:39:05,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:05,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:05,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:05,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:05,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:39:05,628 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 44 [2025-03-08 00:39:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:39:05,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:39:08,124 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 267 treesize of output 259 [2025-03-08 00:39:08,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:39:08,802 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 3382882122030 treesize of output 3268797053264