./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/init-4-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-4-n-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 7e1c46a3eec085decec4254bf9381483b25ba7b6541d5728ae52d1793b9b8c91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:25:51,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:25:51,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:25:51,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:25:51,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:25:51,178 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:25:51,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:25:51,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:25:51,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:25:51,179 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:25:51,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:25:51,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:25:51,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:25:51,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:25:51,180 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:25:51,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:25:51,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:25:51,181 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:25:51,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:25:51,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:25:51,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:25:51,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:25:51,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:25:51,182 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 -> 7e1c46a3eec085decec4254bf9381483b25ba7b6541d5728ae52d1793b9b8c91 [2025-03-03 09:25:51,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:25:51,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:25:51,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:25:51,422 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:25:51,422 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:25:51,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/init-4-n-u.c [2025-03-03 09:25:52,517 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cb8a85de/17ee966e29c048b6a21d396664d9aaed/FLAG96d4f4d4a [2025-03-03 09:25:52,720 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:25:52,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-4-n-u.c [2025-03-03 09:25:52,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cb8a85de/17ee966e29c048b6a21d396664d9aaed/FLAG96d4f4d4a [2025-03-03 09:25:53,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cb8a85de/17ee966e29c048b6a21d396664d9aaed [2025-03-03 09:25:53,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:25:53,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:25:53,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:25:53,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:25:53,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:25:53,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:25:53" (1/1) ... [2025-03-03 09:25:53,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@366ce273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:53, skipping insertion in model container [2025-03-03 09:25:53,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:25:53" (1/1) ... [2025-03-03 09:25:53,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:25:53,192 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-4-n-u.c[322,335] [2025-03-03 09:25:53,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:25:53,219 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:25:53,227 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-4-n-u.c[322,335] [2025-03-03 09:25:53,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:25:53,252 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:25:53,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:53 WrapperNode [2025-03-03 09:25:53,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:25:53,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:25:53,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:25:53,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:25:53,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:53" (1/1) ... [2025-03-03 09:25:53,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:53" (1/1) ... [2025-03-03 09:25:53,281 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2025-03-03 09:25:53,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:25:53,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:25:53,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:25:53,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:25:53,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:53" (1/1) ... [2025-03-03 09:25:53,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:53" (1/1) ... [2025-03-03 09:25:53,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:53" (1/1) ... [2025-03-03 09:25:53,304 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-03 09:25:53,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:53" (1/1) ... [2025-03-03 09:25:53,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:53" (1/1) ... [2025-03-03 09:25:53,308 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:53" (1/1) ... [2025-03-03 09:25:53,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:53" (1/1) ... [2025-03-03 09:25:53,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:53" (1/1) ... [2025-03-03 09:25:53,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:53" (1/1) ... [2025-03-03 09:25:53,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:25:53,315 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:25:53,315 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:25:53,315 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:25:53,320 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:53" (1/1) ... [2025-03-03 09:25:53,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:25:53,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:25:53,345 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-03 09:25:53,351 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-03 09:25:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:25:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:25:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:25:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:25:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:25:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:25:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:25:53,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:25:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:25:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:25:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:25:53,420 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:25:53,421 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:25:53,536 INFO L1325 $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-03 09:25:53,543 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-03 09:25:53,544 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:25:53,550 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:25:53,551 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:25:53,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:25:53 BoogieIcfgContainer [2025-03-03 09:25:53,551 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:25:53,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:25:53,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:25:53,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:25:53,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:25:53" (1/3) ... [2025-03-03 09:25:53,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ac8085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:25:53, skipping insertion in model container [2025-03-03 09:25:53,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:53" (2/3) ... [2025-03-03 09:25:53,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ac8085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:25:53, skipping insertion in model container [2025-03-03 09:25:53,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:25:53" (3/3) ... [2025-03-03 09:25:53,560 INFO L128 eAbstractionObserver]: Analyzing ICFG init-4-n-u.c [2025-03-03 09:25:53,570 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:25:53,572 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG init-4-n-u.c that has 1 procedures, 17 locations, 1 initial locations, 8 loop locations, and 1 error locations. [2025-03-03 09:25:53,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:25:53,618 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;@6174dff9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:25:53,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:25:53,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:25:53,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 09:25:53,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:25:53,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:25:53,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:25:53,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:25:53,634 INFO L85 PathProgramCache]: Analyzing trace with hash -945061330, now seen corresponding path program 1 times [2025-03-03 09:25:53,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:25:53,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382207896] [2025-03-03 09:25:53,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:25:53,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:25:53,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 09:25:53,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 09:25:53,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:25:53,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:53,834 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-03 09:25:53,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:25:53,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382207896] [2025-03-03 09:25:53,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382207896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:25:53,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:25:53,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:25:53,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986971088] [2025-03-03 09:25:53,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:25:53,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:25:53,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:25:53,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:25:53,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:25:53,858 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:25:53,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:25:53,899 INFO L93 Difference]: Finished difference Result 32 states and 48 transitions. [2025-03-03 09:25:53,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:25:53,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-03 09:25:53,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:25:53,906 INFO L225 Difference]: With dead ends: 32 [2025-03-03 09:25:53,906 INFO L226 Difference]: Without dead ends: 18 [2025-03-03 09:25:53,909 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-03 09:25:53,911 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:25:53,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:25:53,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-03 09:25:53,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2025-03-03 09:25:53,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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-03 09:25:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2025-03-03 09:25:53,933 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 9 [2025-03-03 09:25:53,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:25:53,934 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 22 transitions. [2025-03-03 09:25:53,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:25:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 22 transitions. [2025-03-03 09:25:53,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 09:25:53,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:25:53,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:25:53,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:25:53,935 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:25:53,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:25:53,935 INFO L85 PathProgramCache]: Analyzing trace with hash -708259340, now seen corresponding path program 1 times [2025-03-03 09:25:53,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:25:53,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935583029] [2025-03-03 09:25:53,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:25:53,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:25:53,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 09:25:53,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 09:25:53,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:25:53,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:54,007 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-03 09:25:54,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:25:54,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935583029] [2025-03-03 09:25:54,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935583029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:25:54,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:25:54,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:25:54,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080481720] [2025-03-03 09:25:54,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:25:54,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:25:54,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:25:54,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:25:54,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:25:54,010 INFO L87 Difference]: Start difference. First operand 15 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:25:54,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:25:54,046 INFO L93 Difference]: Finished difference Result 37 states and 57 transitions. [2025-03-03 09:25:54,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:25:54,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-03 09:25:54,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:25:54,049 INFO L225 Difference]: With dead ends: 37 [2025-03-03 09:25:54,049 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 09:25:54,049 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-03 09:25:54,050 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:25:54,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 23 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:25:54,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 09:25:54,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2025-03-03 09:25:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:25:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2025-03-03 09:25:54,057 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 11 [2025-03-03 09:25:54,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:25:54,057 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-03-03 09:25:54,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:25:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2025-03-03 09:25:54,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 09:25:54,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:25:54,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:25:54,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:25:54,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:25:54,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:25:54,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1310043440, now seen corresponding path program 1 times [2025-03-03 09:25:54,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:25:54,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144098441] [2025-03-03 09:25:54,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:25:54,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:25:54,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 09:25:54,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 09:25:54,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:25:54,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:54,130 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-03 09:25:54,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:25:54,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144098441] [2025-03-03 09:25:54,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144098441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:25:54,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:25:54,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:25:54,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208447228] [2025-03-03 09:25:54,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:25:54,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:25:54,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:25:54,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:25:54,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:25:54,133 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-03 09:25:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:25:54,171 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2025-03-03 09:25:54,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:25:54,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-03 09:25:54,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:25:54,172 INFO L225 Difference]: With dead ends: 39 [2025-03-03 09:25:54,172 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 09:25:54,172 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-03 09:25:54,173 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:25:54,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 24 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:25:54,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 09:25:54,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2025-03-03 09:25:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:25:54,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2025-03-03 09:25:54,179 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 13 [2025-03-03 09:25:54,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:25:54,180 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2025-03-03 09:25:54,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-03 09:25:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2025-03-03 09:25:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 09:25:54,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:25:54,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:25:54,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:25:54,181 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:25:54,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:25:54,182 INFO L85 PathProgramCache]: Analyzing trace with hash -310324846, now seen corresponding path program 1 times [2025-03-03 09:25:54,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:25:54,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046065712] [2025-03-03 09:25:54,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:25:54,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:25:54,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 09:25:54,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 09:25:54,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:25:54,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:25:54,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:25:54,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046065712] [2025-03-03 09:25:54,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046065712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:25:54,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:25:54,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:25:54,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589701019] [2025-03-03 09:25:54,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:25:54,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:25:54,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:25:54,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:25:54,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:25:54,277 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-03 09:25:54,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:25:54,295 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2025-03-03 09:25:54,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:25:54,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-03 09:25:54,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:25:54,296 INFO L225 Difference]: With dead ends: 41 [2025-03-03 09:25:54,296 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 09:25:54,296 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-03 09:25:54,297 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:25:54,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:25:54,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 09:25:54,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2025-03-03 09:25:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:25:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2025-03-03 09:25:54,301 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 15 [2025-03-03 09:25:54,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:25:54,301 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2025-03-03 09:25:54,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-03 09:25:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2025-03-03 09:25:54,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 09:25:54,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:25:54,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:25:54,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:25:54,302 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:25:54,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:25:54,302 INFO L85 PathProgramCache]: Analyzing trace with hash 2123810777, now seen corresponding path program 1 times [2025-03-03 09:25:54,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:25:54,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621608730] [2025-03-03 09:25:54,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:25:54,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:25:54,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 09:25:54,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:25:54,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:25:54,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:25:54,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:25:54,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621608730] [2025-03-03 09:25:54,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621608730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:25:54,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460209092] [2025-03-03 09:25:54,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:25:54,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:25:54,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:25:54,404 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-03 09:25:54,406 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-03 09:25:54,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 09:25:54,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:25:54,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:25:54,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:54,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:25:54,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:25:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:25:54,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:25:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:25:54,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460209092] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:25:54,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:25:54,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-03 09:25:54,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534246257] [2025-03-03 09:25:54,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:25:54,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:25:54,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:25:54,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:25:54,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:25:54,547 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:25:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:25:54,617 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2025-03-03 09:25:54,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:25:54,618 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-03 09:25:54,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:25:54,619 INFO L225 Difference]: With dead ends: 57 [2025-03-03 09:25:54,619 INFO L226 Difference]: Without dead ends: 39 [2025-03-03 09:25:54,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 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-03 09:25:54,621 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 84 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:25:54,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 59 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:25:54,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-03 09:25:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2025-03-03 09:25:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 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-03 09:25:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2025-03-03 09:25:54,631 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 16 [2025-03-03 09:25:54,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:25:54,632 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-03-03 09:25:54,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:25:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2025-03-03 09:25:54,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 09:25:54,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:25:54,633 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:25:54,640 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-03 09:25:54,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:25:54,834 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:25:54,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:25:54,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2121247570, now seen corresponding path program 2 times [2025-03-03 09:25:54,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:25:54,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541810571] [2025-03-03 09:25:54,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:25:54,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:25:54,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-03 09:25:54,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 09:25:54,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:25:54,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:54,905 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:25:54,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:25:54,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541810571] [2025-03-03 09:25:54,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541810571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:25:54,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118357236] [2025-03-03 09:25:54,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:25:54,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:25:54,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:25:54,908 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-03 09:25:54,910 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-03 09:25:54,944 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-03 09:25:54,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 09:25:54,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:25:54,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:54,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 09:25:54,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:25:55,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:25:55,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:25:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:25:55,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118357236] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:25:55,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:25:55,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 16 [2025-03-03 09:25:55,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566265032] [2025-03-03 09:25:55,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:25:55,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 09:25:55,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:25:55,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 09:25:55,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:25:55,123 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 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-03 09:25:55,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:25:55,570 INFO L93 Difference]: Finished difference Result 136 states and 184 transitions. [2025-03-03 09:25:55,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-03 09:25:55,570 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-03 09:25:55,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:25:55,571 INFO L225 Difference]: With dead ends: 136 [2025-03-03 09:25:55,571 INFO L226 Difference]: Without dead ends: 106 [2025-03-03 09:25:55,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 09:25:55,574 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 228 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:25:55,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 86 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:25:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-03 09:25:55,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 73. [2025-03-03 09:25:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 0 states have call successors, (0), 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-03 09:25:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2025-03-03 09:25:55,591 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 19 [2025-03-03 09:25:55,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:25:55,592 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2025-03-03 09:25:55,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 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-03 09:25:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2025-03-03 09:25:55,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 09:25:55,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:25:55,593 INFO L218 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:25:55,599 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-03 09:25:55,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 09:25:55,797 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:25:55,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:25:55,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1867747766, now seen corresponding path program 3 times [2025-03-03 09:25:55,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:25:55,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742852490] [2025-03-03 09:25:55,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:25:55,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:25:55,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 17 equivalence classes. [2025-03-03 09:25:55,853 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 37 of 41 statements. [2025-03-03 09:25:55,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-03 09:25:55,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 8 proven. 176 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-03 09:25:56,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:25:56,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742852490] [2025-03-03 09:25:56,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742852490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:25:56,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028776866] [2025-03-03 09:25:56,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:25:56,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:25:56,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:25:56,071 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-03 09:25:56,073 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-03 09:25:56,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 17 equivalence classes. [2025-03-03 09:25:56,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 35 of 41 statements. [2025-03-03 09:25:56,616 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-03-03 09:25:56,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:56,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-03 09:25:56,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:25:56,714 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-03 09:25:56,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:56,782 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-03 09:25:56,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:56,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:56,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:56,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:25:56,862 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-03 09:25:56,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:56,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:56,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:56,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:56,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:56,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:56,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:25:56,953 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-03 09:25:57,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:25:57,088 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-03 09:25:57,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:25:57,233 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-03 09:25:57,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:25:57,421 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-03 09:25:57,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:25:57,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:25:57,873 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-03 09:26:22,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:22,232 INFO L349 Elim1Store]: treesize reduction 142, result has 33.3 percent of original size [2025-03-03 09:26:22,233 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-03 09:26:46,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:26:46,569 INFO L349 Elim1Store]: treesize reduction 142, result has 33.3 percent of original size [2025-03-03 09:26:46,570 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-03 09:27:11,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:11,286 INFO L349 Elim1Store]: treesize reduction 458, result has 14.9 percent of original size [2025-03-03 09:27:11,286 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 115 treesize of output 138 [2025-03-03 09:27:35,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:35,935 INFO L349 Elim1Store]: treesize reduction 687, result has 13.9 percent of original size [2025-03-03 09:27:35,936 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 146 treesize of output 172