./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/init-3-u.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-multidimensional/init-3-u.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 385b06dfd41f8b2cf291934cb4635d07bfe2a63001fa162165126d7b890c1d72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:35:05,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:35:05,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:35:05,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:35:05,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:35:05,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:35:05,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:35:05,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:35:05,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:35:05,920 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:35:05,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:35:05,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:35:05,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:35:05,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:35:05,922 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:35:05,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:35:05,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:35:05,922 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:35:05,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:35:05,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:35:05,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:35:05,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:35:05,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:35:05,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:35:05,923 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:35:05,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:35:05,923 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:35:05,923 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:35:05,923 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:35:05,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:35:05,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:35:05,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:35:05,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:35:05,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:35:05,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:35:05,924 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:35:05,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:35:05,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:35:05,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:35:05,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:35:05,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:35:05,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:35:05,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:35:05,925 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 -> 385b06dfd41f8b2cf291934cb4635d07bfe2a63001fa162165126d7b890c1d72 [2025-03-08 00:35:06,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:35:06,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:35:06,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:35:06,140 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:35:06,141 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:35:06,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/init-3-u.c [2025-03-08 00:35:07,277 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/896947110/c4434ac89264456489048dd7f06edae9/FLAG0588ff98c [2025-03-08 00:35:07,506 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:35:07,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-3-u.c [2025-03-08 00:35:07,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/896947110/c4434ac89264456489048dd7f06edae9/FLAG0588ff98c [2025-03-08 00:35:07,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/896947110/c4434ac89264456489048dd7f06edae9 [2025-03-08 00:35:07,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:35:07,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:35:07,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:35:07,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:35:07,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:35:07,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:35:07" (1/1) ... [2025-03-08 00:35:07,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697dc5cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:35:07, skipping insertion in model container [2025-03-08 00:35:07,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:35:07" (1/1) ... [2025-03-08 00:35:07,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:35:07,686 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-multidimensional/init-3-u.c[320,333] [2025-03-08 00:35:07,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:35:07,709 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:35:07,717 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-multidimensional/init-3-u.c[320,333] [2025-03-08 00:35:07,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:35:07,741 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:35:07,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:35:07 WrapperNode [2025-03-08 00:35:07,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:35:07,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:35:07,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:35:07,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:35:07,747 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:35:07" (1/1) ... [2025-03-08 00:35:07,751 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:35:07" (1/1) ... [2025-03-08 00:35:07,761 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2025-03-08 00:35:07,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:35:07,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:35:07,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:35:07,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:35:07,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:35:07" (1/1) ... [2025-03-08 00:35:07,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:35:07" (1/1) ... [2025-03-08 00:35:07,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:35:07" (1/1) ... [2025-03-08 00:35:07,785 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-08 00:35:07,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:35:07" (1/1) ... [2025-03-08 00:35:07,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:35:07" (1/1) ... [2025-03-08 00:35:07,791 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:35:07" (1/1) ... [2025-03-08 00:35:07,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:35:07" (1/1) ... [2025-03-08 00:35:07,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:35:07" (1/1) ... [2025-03-08 00:35:07,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:35:07" (1/1) ... [2025-03-08 00:35:07,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:35:07,797 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:35:07,798 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:35:07,798 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:35:07,799 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:35:07" (1/1) ... [2025-03-08 00:35:07,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:35:07,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:35:07,825 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:35:07,828 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:35:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:35:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:35:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:35:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:35:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:35:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:35:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:35:07,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:35:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:35:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:35:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:35:07,898 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:35:07,899 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:35:08,023 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset; [2025-03-08 00:35:08,029 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 00:35:08,032 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:35:08,041 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:35:08,042 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:35:08,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:35:08 BoogieIcfgContainer [2025-03-08 00:35:08,042 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:35:08,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:35:08,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:35:08,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:35:08,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:35:07" (1/3) ... [2025-03-08 00:35:08,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6024119a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:35:08, skipping insertion in model container [2025-03-08 00:35:08,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:35:07" (2/3) ... [2025-03-08 00:35:08,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6024119a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:35:08, skipping insertion in model container [2025-03-08 00:35:08,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:35:08" (3/3) ... [2025-03-08 00:35:08,049 INFO L128 eAbstractionObserver]: Analyzing ICFG init-3-u.c [2025-03-08 00:35:08,062 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:35:08,063 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG init-3-u.c that has 1 procedures, 15 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-08 00:35:08,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:35:08,106 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;@52ef5993, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:35:08,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:35:08,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:08,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 00:35:08,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:35:08,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:35:08,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:35:08,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:35:08,116 INFO L85 PathProgramCache]: Analyzing trace with hash -219858947, now seen corresponding path program 1 times [2025-03-08 00:35:08,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:35:08,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615202998] [2025-03-08 00:35:08,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:35:08,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:35:08,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 00:35:08,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 00:35:08,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:35:08,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:08,294 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:35:08,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:35:08,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615202998] [2025-03-08 00:35:08,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615202998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:35:08,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:35:08,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:35:08,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615886577] [2025-03-08 00:35:08,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:35:08,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:35:08,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:35:08,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:35:08,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:35:08,313 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:35:08,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:35:08,363 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2025-03-08 00:35:08,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:35:08,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:35:08,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:35:08,370 INFO L225 Difference]: With dead ends: 28 [2025-03-08 00:35:08,371 INFO L226 Difference]: Without dead ends: 15 [2025-03-08 00:35:08,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:35:08,374 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:35:08,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 21 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:35:08,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-08 00:35:08,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2025-03-08 00:35:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2025-03-08 00:35:08,397 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 8 [2025-03-08 00:35:08,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:35:08,398 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-08 00:35:08,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:35:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2025-03-08 00:35:08,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 00:35:08,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:35:08,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:35:08,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:35:08,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:35:08,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:35:08,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1127271801, now seen corresponding path program 1 times [2025-03-08 00:35:08,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:35:08,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916825466] [2025-03-08 00:35:08,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:35:08,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:35:08,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 00:35:08,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 00:35:08,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:35:08,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:35:08,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:35:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916825466] [2025-03-08 00:35:08,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916825466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:35:08,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:35:08,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:35:08,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535318022] [2025-03-08 00:35:08,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:35:08,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:35:08,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:35:08,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:35:08,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:35:08,480 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:35:08,522 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2025-03-08 00:35:08,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:35:08,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 00:35:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:35:08,523 INFO L225 Difference]: With dead ends: 31 [2025-03-08 00:35:08,523 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 00:35:08,523 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:35:08,524 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 32 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:35:08,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 11 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:35:08,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 00:35:08,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2025-03-08 00:35:08,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2025-03-08 00:35:08,529 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 10 [2025-03-08 00:35:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:35:08,529 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-03-08 00:35:08,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2025-03-08 00:35:08,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 00:35:08,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:35:08,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:35:08,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:35:08,532 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:35:08,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:35:08,535 INFO L85 PathProgramCache]: Analyzing trace with hash 873904731, now seen corresponding path program 1 times [2025-03-08 00:35:08,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:35:08,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589328943] [2025-03-08 00:35:08,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:35:08,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:35:08,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 00:35:08,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 00:35:08,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:35:08,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:08,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:35:08,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:35:08,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589328943] [2025-03-08 00:35:08,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589328943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:35:08,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:35:08,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:35:08,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484078805] [2025-03-08 00:35:08,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:35:08,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:35:08,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:35:08,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:35:08,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:35:08,605 INFO L87 Difference]: Start difference. First operand 15 states and 20 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:35:08,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:35:08,644 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2025-03-08 00:35:08,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:35:08,644 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:35:08,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:35:08,644 INFO L225 Difference]: With dead ends: 33 [2025-03-08 00:35:08,644 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 00:35:08,645 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:35:08,645 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:35:08,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 9 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:35:08,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 00:35:08,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2025-03-08 00:35:08,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 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:35:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2025-03-08 00:35:08,651 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 12 [2025-03-08 00:35:08,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:35:08,651 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-03-08 00:35:08,651 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:35:08,651 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2025-03-08 00:35:08,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 00:35:08,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:35:08,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:35:08,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:35:08,652 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:35:08,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:35:08,653 INFO L85 PathProgramCache]: Analyzing trace with hash -2121280433, now seen corresponding path program 1 times [2025-03-08 00:35:08,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:35:08,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542782854] [2025-03-08 00:35:08,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:35:08,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:35:08,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:35:08,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:35:08,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:35:08,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:35:08,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:35:08,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542782854] [2025-03-08 00:35:08,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542782854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:35:08,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925534199] [2025-03-08 00:35:08,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:35:08,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:35:08,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:35:08,741 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:35:08,742 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:35:08,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:35:08,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:35:08,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:35:08,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:08,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:35:08,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:35:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:35:08,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:35:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:35:08,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925534199] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:35:08,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:35:08,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 00:35:08,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235818780] [2025-03-08 00:35:08,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:35:08,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:35:08,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:35:08,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:35:08,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:35:08,892 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:08,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:35:08,976 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2025-03-08 00:35:08,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:35:08,976 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 00:35:08,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:35:08,977 INFO L225 Difference]: With dead ends: 49 [2025-03-08 00:35:08,977 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 00:35:08,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:35:08,978 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 59 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:35:08,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 18 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:35:08,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 00:35:08,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2025-03-08 00:35:08,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:08,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2025-03-08 00:35:08,988 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 13 [2025-03-08 00:35:08,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:35:08,988 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2025-03-08 00:35:08,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:08,988 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2025-03-08 00:35:08,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 00:35:08,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:35:08,989 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:35:08,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 00:35:09,193 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:35:09,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:35:09,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:35:09,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1451726683, now seen corresponding path program 2 times [2025-03-08 00:35:09,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:35:09,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47129020] [2025-03-08 00:35:09,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:35:09,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:35:09,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-08 00:35:09,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:35:09,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:35:09,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:35:09,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:35:09,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47129020] [2025-03-08 00:35:09,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47129020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:35:09,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418230253] [2025-03-08 00:35:09,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:35:09,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:35:09,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:35:09,267 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:35:09,268 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:35:09,297 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-08 00:35:09,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:35:09,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:35:09,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:09,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:35:09,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:35:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:35:09,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:35:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:35:09,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418230253] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:35:09,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:35:09,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 16 [2025-03-08 00:35:09,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168054106] [2025-03-08 00:35:09,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:35:09,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:35:09,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:35:09,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:35:09,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:35:09,462 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:09,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:35:09,957 INFO L93 Difference]: Finished difference Result 232 states and 290 transitions. [2025-03-08 00:35:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 00:35:09,958 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 00:35:09,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:35:09,960 INFO L225 Difference]: With dead ends: 232 [2025-03-08 00:35:09,962 INFO L226 Difference]: Without dead ends: 206 [2025-03-08 00:35:09,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=629, Invalid=1093, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 00:35:09,963 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 660 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:35:09,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 42 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:35:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-08 00:35:09,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 67. [2025-03-08 00:35:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:35:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2025-03-08 00:35:09,982 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 16 [2025-03-08 00:35:09,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:35:09,983 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2025-03-08 00:35:09,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:09,983 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2025-03-08 00:35:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 00:35:09,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:35:09,983 INFO L218 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:35:09,995 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:35:10,184 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:35:10,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:35:10,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:35:10,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1128321337, now seen corresponding path program 3 times [2025-03-08 00:35:10,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:35:10,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122806823] [2025-03-08 00:35:10,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:35:10,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:35:10,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 15 equivalence classes. [2025-03-08 00:35:10,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 34 of 36 statements. [2025-03-08 00:35:10,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-03-08 00:35:10,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 126 proven. 55 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-08 00:35:10,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:35:10,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122806823] [2025-03-08 00:35:10,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122806823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:35:10,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471380064] [2025-03-08 00:35:10,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:35:10,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:35:10,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:35:10,491 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:35:10,492 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:35:10,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 15 equivalence classes. [2025-03-08 00:35:10,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 32 of 36 statements. [2025-03-08 00:35:10,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-08 00:35:10,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:10,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-08 00:35:10,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:35:10,942 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:35:10,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:10,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-08 00:35:11,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:35:11,075 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 30 treesize of output 32 [2025-03-08 00:35:11,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:35:11,195 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:35:11,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:35:11,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2025-03-08 00:35:11,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:35:11,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-03-08 00:35:11,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:11,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:35:11,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2025-03-08 00:35:20,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:20,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:35:20,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 75 treesize of output 92 [2025-03-08 00:35:40,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:35:40,743 INFO L349 Elim1Store]: treesize reduction 142, result has 33.3 percent of original size [2025-03-08 00:35:40,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 84 treesize of output 104 [2025-03-08 00:36:01,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:01,282 INFO L349 Elim1Store]: treesize reduction 142, result has 33.3 percent of original size [2025-03-08 00:36:01,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 84 treesize of output 104 [2025-03-08 00:36:25,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:25,905 INFO L349 Elim1Store]: treesize reduction 350, result has 18.6 percent of original size [2025-03-08 00:36:25,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 100 treesize of output 123 [2025-03-08 00:36:54,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:54,324 INFO L349 Elim1Store]: treesize reduction 510, result has 15.8 percent of original size [2025-03-08 00:36:54,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 28 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 116 treesize of output 142