./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array23_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array23_pattern.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e6bb9e1c9705c406859f1248122e92b7c01da6449c586b213f4fa087ea45e218 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:38:42,835 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:38:42,888 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:38:42,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:38:42,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:38:42,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:38:42,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:38:42,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:38:42,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:38:42,918 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:38:42,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:38:42,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:38:42,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:38:42,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:38:42,919 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:38:42,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:38:42,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:38:42,920 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:38:42,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:38:42,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:38:42,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:38:42,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:38:42,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:38:42,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:38:42,920 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:38:42,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:38:42,920 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:38:42,920 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:38:42,921 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:38:42,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:38:42,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:38:42,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:38:42,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:38:42,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:38:42,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:38:42,922 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:38:42,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:38:42,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:38:42,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:38:42,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:38:42,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:38:42,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:38:42,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:38:42,922 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 -> e6bb9e1c9705c406859f1248122e92b7c01da6449c586b213f4fa087ea45e218 [2025-03-08 00:38:43,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:38:43,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:38:43,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:38:43,167 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:38:43,168 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:38:43,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array23_pattern.c [2025-03-08 00:38:44,247 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd08b2a9b/c5a422544b3b4134927108a280317809/FLAG499cceead [2025-03-08 00:38:44,466 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:38:44,467 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array23_pattern.c [2025-03-08 00:38:44,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd08b2a9b/c5a422544b3b4134927108a280317809/FLAG499cceead [2025-03-08 00:38:44,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd08b2a9b/c5a422544b3b4134927108a280317809 [2025-03-08 00:38:44,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:38:44,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:38:44,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:38:44,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:38:44,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:38:44,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:38:44" (1/1) ... [2025-03-08 00:38:44,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b73abd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:44, skipping insertion in model container [2025-03-08 00:38:44,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:38:44" (1/1) ... [2025-03-08 00:38:44,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:38:44,927 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array23_pattern.c[1347,1360] [2025-03-08 00:38:44,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:38:44,946 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:38:44,953 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array23_pattern.c[1347,1360] [2025-03-08 00:38:44,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:38:44,969 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:38:44,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:44 WrapperNode [2025-03-08 00:38:44,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:38:44,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:38:44,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:38:44,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:38:44,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:44" (1/1) ... [2025-03-08 00:38:44,978 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:44" (1/1) ... [2025-03-08 00:38:44,989 INFO L138 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2025-03-08 00:38:44,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:38:44,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:38:44,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:38:44,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:38:44,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:44" (1/1) ... [2025-03-08 00:38:44,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:44" (1/1) ... [2025-03-08 00:38:44,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:44" (1/1) ... [2025-03-08 00:38:45,003 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-08 00:38:45,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:44" (1/1) ... [2025-03-08 00:38:45,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:44" (1/1) ... [2025-03-08 00:38:45,007 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:44" (1/1) ... [2025-03-08 00:38:45,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:44" (1/1) ... [2025-03-08 00:38:45,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:44" (1/1) ... [2025-03-08 00:38:45,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:44" (1/1) ... [2025-03-08 00:38:45,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:38:45,015 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:38:45,016 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:38:45,016 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:38:45,017 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:44" (1/1) ... [2025-03-08 00:38:45,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:38:45,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:38:45,043 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:38:45,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:38:45,065 INFO L130 BoogieDeclarations]: Found specification of procedure outerBoundaryPatternCheck [2025-03-08 00:38:45,065 INFO L138 BoogieDeclarations]: Found implementation of procedure outerBoundaryPatternCheck [2025-03-08 00:38:45,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:38:45,065 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 00:38:45,065 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 00:38:45,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:38:45,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:38:45,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:38:45,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:38:45,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:38:45,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:38:45,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:38:45,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:38:45,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:38:45,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:38:45,122 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:38:45,123 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:38:45,274 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L52: call ULTIMATE.dealloc(main_~#array~0#1.base, main_~#array~0#1.offset);havoc main_~#array~0#1.base, main_~#array~0#1.offset; [2025-03-08 00:38:45,294 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-08 00:38:45,294 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:38:45,301 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:38:45,302 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:38:45,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:38:45 BoogieIcfgContainer [2025-03-08 00:38:45,302 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:38:45,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:38:45,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:38:45,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:38:45,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:38:44" (1/3) ... [2025-03-08 00:38:45,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd7bac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:38:45, skipping insertion in model container [2025-03-08 00:38:45,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:44" (2/3) ... [2025-03-08 00:38:45,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd7bac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:38:45, skipping insertion in model container [2025-03-08 00:38:45,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:38:45" (3/3) ... [2025-03-08 00:38:45,311 INFO L128 eAbstractionObserver]: Analyzing ICFG array23_pattern.c [2025-03-08 00:38:45,322 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:38:45,324 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array23_pattern.c that has 3 procedures, 36 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-08 00:38:45,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:38:45,373 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;@7f684875, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:38:45,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:38:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 00:38:45,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 00:38:45,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:45,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:45,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:45,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:45,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1959484098, now seen corresponding path program 1 times [2025-03-08 00:38:45,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:45,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772077649] [2025-03-08 00:38:45,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:38:45,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:45,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 00:38:45,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:38:45,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:38:45,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:45,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:38:45,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:45,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772077649] [2025-03-08 00:38:45,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772077649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:38:45,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:38:45,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:38:45,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31989441] [2025-03-08 00:38:45,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:38:45,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:38:45,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:45,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:38:45,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:38:45,517 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 00:38:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:45,533 INFO L93 Difference]: Finished difference Result 69 states and 97 transitions. [2025-03-08 00:38:45,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:38:45,535 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-08 00:38:45,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:45,539 INFO L225 Difference]: With dead ends: 69 [2025-03-08 00:38:45,542 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 00:38:45,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:38:45,548 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:45,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:38:45,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 00:38:45,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-08 00:38:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 00:38:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-03-08 00:38:45,576 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 14 [2025-03-08 00:38:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:45,576 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-03-08 00:38:45,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 00:38:45,577 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2025-03-08 00:38:45,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 00:38:45,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:45,579 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:45,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:38:45,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:45,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:45,581 INFO L85 PathProgramCache]: Analyzing trace with hash -634911244, now seen corresponding path program 1 times [2025-03-08 00:38:45,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:45,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976915251] [2025-03-08 00:38:45,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:38:45,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:45,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 00:38:45,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:38:45,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:38:45,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:45,889 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:38:45,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:45,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976915251] [2025-03-08 00:38:45,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976915251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:38:45,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:38:45,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:38:45,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329885220] [2025-03-08 00:38:45,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:38:45,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:38:45,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:45,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:38:45,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:38:45,893 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:38:45,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:45,920 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2025-03-08 00:38:45,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:38:45,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2025-03-08 00:38:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:45,922 INFO L225 Difference]: With dead ends: 37 [2025-03-08 00:38:45,922 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 00:38:45,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:38:45,924 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:45,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 97 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:38:45,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 00:38:45,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-08 00:38:45,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 00:38:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-03-08 00:38:45,930 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 41 [2025-03-08 00:38:45,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:45,931 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-03-08 00:38:45,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:38:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-03-08 00:38:45,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:38:45,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:45,932 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:45,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:38:45,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:45,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:45,933 INFO L85 PathProgramCache]: Analyzing trace with hash 484814132, now seen corresponding path program 1 times [2025-03-08 00:38:45,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:45,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218449804] [2025-03-08 00:38:45,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:38:45,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:45,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 00:38:45,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:38:45,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:38:45,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 00:38:46,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:46,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218449804] [2025-03-08 00:38:46,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218449804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:38:46,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:38:46,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 00:38:46,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907932294] [2025-03-08 00:38:46,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:38:46,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:38:46,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:46,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:38:46,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:38:46,099 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:38:46,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:46,203 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2025-03-08 00:38:46,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:38:46,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2025-03-08 00:38:46,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:46,205 INFO L225 Difference]: With dead ends: 68 [2025-03-08 00:38:46,205 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 00:38:46,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:38:46,206 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:46,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 76 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:38:46,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 00:38:46,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2025-03-08 00:38:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 00:38:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2025-03-08 00:38:46,213 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 44 [2025-03-08 00:38:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:46,213 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2025-03-08 00:38:46,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:38:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2025-03-08 00:38:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:38:46,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:46,214 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:46,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:38:46,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:46,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:46,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1011701486, now seen corresponding path program 1 times [2025-03-08 00:38:46,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:46,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286630324] [2025-03-08 00:38:46,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:38:46,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:46,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 00:38:46,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:38:46,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:38:46,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:38:46,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:46,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286630324] [2025-03-08 00:38:46,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286630324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:38:46,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:38:46,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:38:46,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364742972] [2025-03-08 00:38:46,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:38:46,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:38:46,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:46,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:38:46,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:38:46,332 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:38:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:46,393 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2025-03-08 00:38:46,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:38:46,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2025-03-08 00:38:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:46,394 INFO L225 Difference]: With dead ends: 68 [2025-03-08 00:38:46,394 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 00:38:46,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:38:46,395 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:46,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 88 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:38:46,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 00:38:46,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-03-08 00:38:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 00:38:46,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2025-03-08 00:38:46,399 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 46 [2025-03-08 00:38:46,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:46,399 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2025-03-08 00:38:46,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:38:46,399 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2025-03-08 00:38:46,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:38:46,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:46,400 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:46,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:38:46,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:46,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:46,400 INFO L85 PathProgramCache]: Analyzing trace with hash 808191946, now seen corresponding path program 1 times [2025-03-08 00:38:46,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:46,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839627152] [2025-03-08 00:38:46,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:38:46,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:46,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:38:46,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:38:46,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:38:46,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:38:46,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:46,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839627152] [2025-03-08 00:38:46,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839627152] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:38:46,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821480056] [2025-03-08 00:38:46,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:38:46,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:46,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:38:46,577 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:38:46,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:38:46,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:38:46,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:38:46,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:38:46,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:46,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:38:46,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:38:46,715 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:38:46,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:38:46,835 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:38:46,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821480056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:38:46,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:38:46,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-08 00:38:46,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452931541] [2025-03-08 00:38:46,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:38:46,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:38:46,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:46,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:38:46,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:38:46,839 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 00:38:46,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:46,969 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2025-03-08 00:38:46,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:38:46,969 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 47 [2025-03-08 00:38:46,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:46,970 INFO L225 Difference]: With dead ends: 74 [2025-03-08 00:38:46,970 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 00:38:46,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:38:46,972 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:46,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 123 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:38:46,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 00:38:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-03-08 00:38:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 00:38:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-03-08 00:38:46,982 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 47 [2025-03-08 00:38:46,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:46,983 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-03-08 00:38:46,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 00:38:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-03-08 00:38:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 00:38:46,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:46,984 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:46,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 00:38:47,188 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-08 00:38:47,188 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:47,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:47,189 INFO L85 PathProgramCache]: Analyzing trace with hash 151000504, now seen corresponding path program 2 times [2025-03-08 00:38:47,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:47,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654161443] [2025-03-08 00:38:47,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:38:47,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:47,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-08 00:38:47,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:38:47,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:38:47,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 00:38:47,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:47,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654161443] [2025-03-08 00:38:47,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654161443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:38:47,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988883819] [2025-03-08 00:38:47,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:38:47,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:47,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:38:47,324 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:38:47,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:38:47,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-08 00:38:47,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:38:47,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:38:47,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:47,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:38:47,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:38:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:38:47,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:38:47,511 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 00:38:47,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988883819] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:38:47,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:38:47,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-08 00:38:47,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947410329] [2025-03-08 00:38:47,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:38:47,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 00:38:47,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:47,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 00:38:47,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:38:47,514 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 00:38:47,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:47,674 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2025-03-08 00:38:47,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:38:47,675 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 49 [2025-03-08 00:38:47,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:47,675 INFO L225 Difference]: With dead ends: 85 [2025-03-08 00:38:47,675 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 00:38:47,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:38:47,676 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:47,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 137 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:38:47,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 00:38:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2025-03-08 00:38:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 00:38:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-03-08 00:38:47,684 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 49 [2025-03-08 00:38:47,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:47,684 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-03-08 00:38:47,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 00:38:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-03-08 00:38:47,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 00:38:47,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:47,686 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:47,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 00:38:47,886 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-08 00:38:47,887 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:47,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:47,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2019860860, now seen corresponding path program 3 times [2025-03-08 00:38:47,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:47,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311157186] [2025-03-08 00:38:47,887 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:38:47,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:47,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 7 equivalence classes. [2025-03-08 00:38:47,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:38:47,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:38:47,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:38:47,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [729334354] [2025-03-08 00:38:47,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:38:47,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:47,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:38:47,934 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:38:47,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:38:47,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 7 equivalence classes. [2025-03-08 00:38:48,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:38:48,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:38:48,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:48,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-03-08 00:38:48,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:38:48,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:38:48,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:38:48,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:48,875 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 26 treesize of output 28 [2025-03-08 00:38:48,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:48,924 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 33 treesize of output 38 [2025-03-08 00:38:49,853 INFO L349 Elim1Store]: treesize reduction 208, result has 33.5 percent of original size [2025-03-08 00:38:49,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 74 treesize of output 142 [2025-03-08 00:38:50,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 126 [2025-03-08 00:38:50,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:50,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:50,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:50,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:50,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:50,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:50,694 INFO L349 Elim1Store]: treesize reduction 212, result has 0.5 percent of original size [2025-03-08 00:38:50,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 126 treesize of output 223 [2025-03-08 00:38:50,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:50,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:50,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:50,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:50,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:50,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:50,875 INFO L349 Elim1Store]: treesize reduction 144, result has 37.1 percent of original size [2025-03-08 00:38:50,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 137 treesize of output 171 [2025-03-08 00:38:51,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:51,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 149 treesize of output 69 [2025-03-08 00:38:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:38:52,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:38:58,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:58,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311157186] [2025-03-08 00:38:58,813 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:38:58,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729334354] [2025-03-08 00:38:58,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729334354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:38:58,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:38:58,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2025-03-08 00:38:58,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571323266] [2025-03-08 00:38:58,814 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 00:38:58,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 00:38:58,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:58,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 00:38:58,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=2424, Unknown=1, NotChecked=0, Total=2756 [2025-03-08 00:38:58,818 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-08 00:39:00,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:00,115 INFO L93 Difference]: Finished difference Result 142 states and 180 transitions. [2025-03-08 00:39:00,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 00:39:00,116 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 57 [2025-03-08 00:39:00,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:00,117 INFO L225 Difference]: With dead ends: 142 [2025-03-08 00:39:00,117 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 00:39:00,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=388, Invalid=2917, Unknown=1, NotChecked=0, Total=3306 [2025-03-08 00:39:00,119 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 68 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:00,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 437 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 00:39:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 00:39:00,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2025-03-08 00:39:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-08 00:39:00,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2025-03-08 00:39:00,137 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 57 [2025-03-08 00:39:00,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:00,138 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2025-03-08 00:39:00,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-08 00:39:00,138 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2025-03-08 00:39:00,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 00:39:00,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:00,140 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:00,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:39:00,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:00,341 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:00,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:00,342 INFO L85 PathProgramCache]: Analyzing trace with hash -767554627, now seen corresponding path program 1 times [2025-03-08 00:39:00,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:00,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433869569] [2025-03-08 00:39:00,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:00,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:00,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 00:39:00,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:39:00,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:00,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:00,413 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 00:39:00,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:00,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433869569] [2025-03-08 00:39:00,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433869569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:39:00,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:39:00,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:39:00,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636322254] [2025-03-08 00:39:00,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:39:00,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:39:00,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:00,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:39:00,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:39:00,414 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 00:39:00,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:00,436 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2025-03-08 00:39:00,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:39:00,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2025-03-08 00:39:00,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:00,438 INFO L225 Difference]: With dead ends: 130 [2025-03-08 00:39:00,438 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 00:39:00,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:39:00,439 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:00,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:39:00,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 00:39:00,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-08 00:39:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 79 states have internal predecessors, (96), 9 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2025-03-08 00:39:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2025-03-08 00:39:00,459 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 57 [2025-03-08 00:39:00,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:00,459 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2025-03-08 00:39:00,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 00:39:00,459 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2025-03-08 00:39:00,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 00:39:00,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:00,461 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:00,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 00:39:00,461 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:00,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:00,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1612026498, now seen corresponding path program 1 times [2025-03-08 00:39:00,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:00,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426359298] [2025-03-08 00:39:00,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:00,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:00,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 00:39:00,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:39:00,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:00,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 00:39:00,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:00,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426359298] [2025-03-08 00:39:00,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426359298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:39:00,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674183984] [2025-03-08 00:39:00,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:00,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:00,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:00,599 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:00,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:39:00,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 00:39:00,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:39:00,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:00,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:00,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 00:39:00,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 00:39:00,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:39:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-08 00:39:00,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674183984] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:39:00,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:39:00,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 15 [2025-03-08 00:39:00,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535066252] [2025-03-08 00:39:00,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:39:00,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 00:39:00,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:00,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 00:39:00,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:39:00,877 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 00:39:01,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:01,067 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions. [2025-03-08 00:39:01,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:39:01,068 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 57 [2025-03-08 00:39:01,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:01,068 INFO L225 Difference]: With dead ends: 151 [2025-03-08 00:39:01,069 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 00:39:01,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-03-08 00:39:01,069 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:01,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 195 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:39:01,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 00:39:01,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2025-03-08 00:39:01,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.2125) internal successors, (97), 80 states have internal predecessors, (97), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-08 00:39:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2025-03-08 00:39:01,082 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 57 [2025-03-08 00:39:01,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:01,082 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2025-03-08 00:39:01,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 00:39:01,082 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2025-03-08 00:39:01,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 00:39:01,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:01,083 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:01,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 00:39:01,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:01,284 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:01,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:01,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1030341955, now seen corresponding path program 1 times [2025-03-08 00:39:01,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:01,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724686696] [2025-03-08 00:39:01,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:01,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:01,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 00:39:01,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:39:01,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:01,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:01,345 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 00:39:01,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:01,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724686696] [2025-03-08 00:39:01,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724686696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:39:01,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901391978] [2025-03-08 00:39:01,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:01,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:01,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:01,348 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:01,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:39:01,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 00:39:01,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:39:01,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:01,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:01,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:39:01,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 00:39:01,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:39:01,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901391978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:39:01,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:39:01,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 00:39:01,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651734955] [2025-03-08 00:39:01,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:39:01,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:39:01,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:01,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:39:01,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:39:01,433 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:39:01,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:01,451 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2025-03-08 00:39:01,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:39:01,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2025-03-08 00:39:01,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:01,453 INFO L225 Difference]: With dead ends: 142 [2025-03-08 00:39:01,453 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 00:39:01,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:39:01,456 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:01,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:39:01,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 00:39:01,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-08 00:39:01,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.1875) internal successors, (95), 80 states have internal predecessors, (95), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-08 00:39:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2025-03-08 00:39:01,471 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 57 [2025-03-08 00:39:01,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:01,471 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2025-03-08 00:39:01,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:39:01,472 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2025-03-08 00:39:01,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 00:39:01,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:01,472 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:01,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 00:39:01,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 00:39:01,677 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:01,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:01,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1313492419, now seen corresponding path program 1 times [2025-03-08 00:39:01,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:01,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663825227] [2025-03-08 00:39:01,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:01,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:01,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 00:39:01,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:39:01,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:01,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:01,720 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 00:39:01,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:01,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663825227] [2025-03-08 00:39:01,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663825227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:39:01,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099103586] [2025-03-08 00:39:01,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:01,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:01,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:01,723 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:01,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:39:01,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 00:39:01,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:39:01,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:01,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:01,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 00:39:01,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 00:39:01,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:39:01,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099103586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:39:01,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:39:01,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-08 00:39:01,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609775305] [2025-03-08 00:39:01,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:39:01,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:39:01,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:01,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:39:01,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:39:01,792 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:39:01,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:01,811 INFO L93 Difference]: Finished difference Result 142 states and 171 transitions. [2025-03-08 00:39:01,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:39:01,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2025-03-08 00:39:01,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:01,812 INFO L225 Difference]: With dead ends: 142 [2025-03-08 00:39:01,812 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 00:39:01,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:39:01,812 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:01,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:39:01,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 00:39:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-08 00:39:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.175) internal successors, (94), 80 states have internal predecessors, (94), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-08 00:39:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2025-03-08 00:39:01,828 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 57 [2025-03-08 00:39:01,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:01,828 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2025-03-08 00:39:01,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:39:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2025-03-08 00:39:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 00:39:01,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:01,829 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:01,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 00:39:02,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:02,033 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:02,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:02,034 INFO L85 PathProgramCache]: Analyzing trace with hash -68727938, now seen corresponding path program 1 times [2025-03-08 00:39:02,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:02,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751037813] [2025-03-08 00:39:02,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:02,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:02,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 00:39:02,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:39:02,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:02,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 00:39:02,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:02,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751037813] [2025-03-08 00:39:02,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751037813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:39:02,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589604940] [2025-03-08 00:39:02,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:02,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:02,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:02,310 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:02,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:39:02,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 00:39:02,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:39:02,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:02,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:02,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 00:39:02,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 00:39:02,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:39:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-08 00:39:02,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589604940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:39:02,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:39:02,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 7] total 20 [2025-03-08 00:39:02,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010975274] [2025-03-08 00:39:02,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:39:02,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 00:39:02,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:02,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 00:39:02,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:39:02,651 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 6 states have call successors, (13), 2 states have call predecessors, (13), 8 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-08 00:39:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:02,949 INFO L93 Difference]: Finished difference Result 200 states and 243 transitions. [2025-03-08 00:39:02,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 00:39:02,950 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 6 states have call successors, (13), 2 states have call predecessors, (13), 8 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 57 [2025-03-08 00:39:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:02,951 INFO L225 Difference]: With dead ends: 200 [2025-03-08 00:39:02,951 INFO L226 Difference]: Without dead ends: 157 [2025-03-08 00:39:02,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:39:02,951 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 47 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:02,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 263 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:39:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-08 00:39:02,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 101. [2025-03-08 00:39:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.170731707317073) internal successors, (96), 81 states have internal predecessors, (96), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-08 00:39:02,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 118 transitions. [2025-03-08 00:39:02,962 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 118 transitions. Word has length 57 [2025-03-08 00:39:02,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:02,963 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 118 transitions. [2025-03-08 00:39:02,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 6 states have call successors, (13), 2 states have call predecessors, (13), 8 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-08 00:39:02,963 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2025-03-08 00:39:02,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 00:39:02,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:02,963 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:02,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 00:39:03,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:03,164 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:03,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:03,164 INFO L85 PathProgramCache]: Analyzing trace with hash -913199809, now seen corresponding path program 1 times [2025-03-08 00:39:03,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:03,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510143492] [2025-03-08 00:39:03,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:03,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:03,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 00:39:03,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:39:03,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:03,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 00:39:03,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:03,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510143492] [2025-03-08 00:39:03,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510143492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:39:03,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:39:03,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:39:03,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663593252] [2025-03-08 00:39:03,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:39:03,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:39:03,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:03,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:39:03,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:39:03,216 INFO L87 Difference]: Start difference. First operand 101 states and 118 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 00:39:03,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:03,235 INFO L93 Difference]: Finished difference Result 146 states and 171 transitions. [2025-03-08 00:39:03,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:39:03,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2025-03-08 00:39:03,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:03,236 INFO L225 Difference]: With dead ends: 146 [2025-03-08 00:39:03,236 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 00:39:03,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:39:03,237 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:03,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:39:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 00:39:03,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-08 00:39:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 81 states have internal predecessors, (95), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-08 00:39:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2025-03-08 00:39:03,249 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 57 [2025-03-08 00:39:03,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:03,249 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2025-03-08 00:39:03,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 00:39:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2025-03-08 00:39:03,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 00:39:03,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:03,250 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:03,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 00:39:03,250 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:03,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:03,250 INFO L85 PathProgramCache]: Analyzing trace with hash 594352000, now seen corresponding path program 1 times [2025-03-08 00:39:03,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:03,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723406888] [2025-03-08 00:39:03,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:03,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:03,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 00:39:03,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:39:03,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:03,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 00:39:03,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:03,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723406888] [2025-03-08 00:39:03,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723406888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:39:03,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282988264] [2025-03-08 00:39:03,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:03,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:03,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:03,427 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:03,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:39:03,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 00:39:03,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:39:03,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:03,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:03,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 00:39:03,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 00:39:03,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:39:03,824 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 00:39:03,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282988264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:39:03,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:39:03,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 22 [2025-03-08 00:39:03,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247359194] [2025-03-08 00:39:03,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:39:03,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 00:39:03,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:03,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 00:39:03,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-03-08 00:39:03,826 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 5 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-08 00:39:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:04,085 INFO L93 Difference]: Finished difference Result 206 states and 241 transitions. [2025-03-08 00:39:04,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 00:39:04,087 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 5 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 57 [2025-03-08 00:39:04,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:04,087 INFO L225 Difference]: With dead ends: 206 [2025-03-08 00:39:04,087 INFO L226 Difference]: Without dead ends: 157 [2025-03-08 00:39:04,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 99 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2025-03-08 00:39:04,088 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 34 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:04,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 202 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:39:04,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-08 00:39:04,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 131. [2025-03-08 00:39:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 105 states have (on average 1.161904761904762) internal successors, (122), 104 states have internal predecessors, (122), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2025-03-08 00:39:04,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2025-03-08 00:39:04,101 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 57 [2025-03-08 00:39:04,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:04,101 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2025-03-08 00:39:04,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 5 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-08 00:39:04,101 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2025-03-08 00:39:04,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 00:39:04,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:04,101 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:04,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 00:39:04,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 00:39:04,302 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:04,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:04,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1807867506, now seen corresponding path program 4 times [2025-03-08 00:39:04,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:04,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752731341] [2025-03-08 00:39:04,302 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:39:04,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:04,308 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-03-08 00:39:04,315 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 51 of 58 statements. [2025-03-08 00:39:04,315 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:39:04,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 00:39:04,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:04,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752731341] [2025-03-08 00:39:04,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752731341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:39:04,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077955434] [2025-03-08 00:39:04,387 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:39:04,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:04,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:04,389 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:04,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:39:04,432 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-03-08 00:39:04,445 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 51 of 58 statements. [2025-03-08 00:39:04,446 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:39:04,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:04,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:39:04,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:39:04,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:39:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 00:39:04,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077955434] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:39:04,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:39:04,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-08 00:39:04,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977955728] [2025-03-08 00:39:04,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:39:04,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:39:04,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:04,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:39:04,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:39:04,602 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 00:39:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:04,722 INFO L93 Difference]: Finished difference Result 218 states and 255 transitions. [2025-03-08 00:39:04,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:39:04,722 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2025-03-08 00:39:04,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:04,723 INFO L225 Difference]: With dead ends: 218 [2025-03-08 00:39:04,723 INFO L226 Difference]: Without dead ends: 139 [2025-03-08 00:39:04,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:39:04,724 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:04,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 170 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:39:04,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-08 00:39:04,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2025-03-08 00:39:04,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 110 states have (on average 1.1454545454545455) internal successors, (126), 109 states have internal predecessors, (126), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2025-03-08 00:39:04,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 157 transitions. [2025-03-08 00:39:04,743 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 157 transitions. Word has length 58 [2025-03-08 00:39:04,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:04,743 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 157 transitions. [2025-03-08 00:39:04,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 00:39:04,743 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 157 transitions. [2025-03-08 00:39:04,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 00:39:04,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:04,744 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:04,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 00:39:04,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 00:39:04,944 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:04,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:04,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2025021380, now seen corresponding path program 5 times [2025-03-08 00:39:04,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:04,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373835593] [2025-03-08 00:39:04,944 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:39:04,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:04,951 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 7 equivalence classes. [2025-03-08 00:39:04,954 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 13 of 58 statements. [2025-03-08 00:39:04,954 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 00:39:04,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:05,013 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 00:39:05,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:05,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373835593] [2025-03-08 00:39:05,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373835593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:39:05,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717316779] [2025-03-08 00:39:05,014 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:39:05,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:05,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:05,016 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:05,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 00:39:05,062 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 7 equivalence classes. [2025-03-08 00:39:05,071 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 13 of 58 statements. [2025-03-08 00:39:05,071 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 00:39:05,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:05,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:39:05,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 00:39:05,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:39:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 00:39:05,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717316779] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:39:05,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:39:05,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-08 00:39:05,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796055396] [2025-03-08 00:39:05,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:39:05,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:39:05,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:05,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:39:05,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:39:05,167 INFO L87 Difference]: Start difference. First operand 136 states and 157 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 00:39:05,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:05,282 INFO L93 Difference]: Finished difference Result 172 states and 195 transitions. [2025-03-08 00:39:05,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:39:05,283 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2025-03-08 00:39:05,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:05,284 INFO L225 Difference]: With dead ends: 172 [2025-03-08 00:39:05,284 INFO L226 Difference]: Without dead ends: 128 [2025-03-08 00:39:05,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 106 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:39:05,284 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 34 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:05,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 230 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:39:05,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-08 00:39:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2025-03-08 00:39:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.108910891089109) internal successors, (112), 99 states have internal predecessors, (112), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (15), 15 states have call predecessors, (15), 14 states have call successors, (15) [2025-03-08 00:39:05,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2025-03-08 00:39:05,297 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 58 [2025-03-08 00:39:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:05,297 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2025-03-08 00:39:05,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 00:39:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2025-03-08 00:39:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 00:39:05,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:05,298 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:05,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 00:39:05,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 00:39:05,499 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:05,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:05,499 INFO L85 PathProgramCache]: Analyzing trace with hash 416378932, now seen corresponding path program 6 times [2025-03-08 00:39:05,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:05,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315147206] [2025-03-08 00:39:05,499 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:39:05,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:05,510 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 61 statements into 8 equivalence classes. [2025-03-08 00:39:05,544 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 00:39:05,544 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-08 00:39:05,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 19 proven. 24 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 00:39:05,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:05,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315147206] [2025-03-08 00:39:05,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315147206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:39:05,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258988567] [2025-03-08 00:39:05,631 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:39:05,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:05,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:05,633 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:05,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 00:39:05,678 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 61 statements into 8 equivalence classes. [2025-03-08 00:39:06,048 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 00:39:06,048 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-08 00:39:06,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:06,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:39:06,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 29 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 00:39:06,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:39:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 00:39:06,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258988567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:39:06,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:39:06,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-08 00:39:06,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287632785] [2025-03-08 00:39:06,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:39:06,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:39:06,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:06,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:39:06,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:39:06,220 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 00:39:06,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:06,446 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2025-03-08 00:39:06,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 00:39:06,447 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2025-03-08 00:39:06,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:06,448 INFO L225 Difference]: With dead ends: 140 [2025-03-08 00:39:06,448 INFO L226 Difference]: Without dead ends: 137 [2025-03-08 00:39:06,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 117 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=594, Unknown=0, NotChecked=0, Total=812 [2025-03-08 00:39:06,448 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 30 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:06,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 260 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:39:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-08 00:39:06,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 130. [2025-03-08 00:39:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.1132075471698113) internal successors, (118), 104 states have internal predecessors, (118), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (15), 15 states have call predecessors, (15), 14 states have call successors, (15) [2025-03-08 00:39:06,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2025-03-08 00:39:06,460 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 61 [2025-03-08 00:39:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:06,461 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2025-03-08 00:39:06,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 00:39:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2025-03-08 00:39:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 00:39:06,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:06,461 INFO L218 NwaCegarLoop]: trace histogram [9, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:06,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 00:39:06,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 00:39:06,662 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:06,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:06,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1306566452, now seen corresponding path program 7 times [2025-03-08 00:39:06,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:06,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464578083] [2025-03-08 00:39:06,663 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:39:06,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:06,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 00:39:06,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 00:39:06,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:06,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:06,758 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-08 00:39:06,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:06,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464578083] [2025-03-08 00:39:06,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464578083] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:39:06,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829924470] [2025-03-08 00:39:06,758 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:39:06,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:06,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:06,760 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:06,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 00:39:06,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 00:39:06,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 00:39:06,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:06,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:06,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:39:06,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:06,910 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-08 00:39:06,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:39:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-08 00:39:06,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829924470] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:39:06,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:39:06,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-08 00:39:06,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030848764] [2025-03-08 00:39:06,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:39:06,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 00:39:06,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:06,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 00:39:06,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:39:06,981 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 00:39:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:07,111 INFO L93 Difference]: Finished difference Result 195 states and 224 transitions. [2025-03-08 00:39:07,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:39:07,113 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2025-03-08 00:39:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:07,114 INFO L225 Difference]: With dead ends: 195 [2025-03-08 00:39:07,114 INFO L226 Difference]: Without dead ends: 143 [2025-03-08 00:39:07,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:39:07,114 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 21 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:07,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 212 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:39:07,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-08 00:39:07,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2025-03-08 00:39:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 111 states have (on average 1.117117117117117) internal successors, (124), 109 states have internal predecessors, (124), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (15), 15 states have call predecessors, (15), 14 states have call successors, (15) [2025-03-08 00:39:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 153 transitions. [2025-03-08 00:39:07,135 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 153 transitions. Word has length 66 [2025-03-08 00:39:07,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:07,135 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 153 transitions. [2025-03-08 00:39:07,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 00:39:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 153 transitions. [2025-03-08 00:39:07,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 00:39:07,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:07,136 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:07,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 00:39:07,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 00:39:07,337 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:07,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:07,337 INFO L85 PathProgramCache]: Analyzing trace with hash -787902902, now seen corresponding path program 8 times [2025-03-08 00:39:07,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:07,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725481760] [2025-03-08 00:39:07,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:39:07,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:07,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-08 00:39:07,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 00:39:07,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:39:07,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:39:07,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [289298901] [2025-03-08 00:39:07,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:39:07,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:07,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:07,379 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:07,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 00:39:07,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-08 00:39:07,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 00:39:07,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:39:07,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:07,959 WARN L254 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 165 conjuncts are in the unsatisfiable core [2025-03-08 00:39:07,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:08,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:39:08,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:39:08,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:39:08,068 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 26 treesize of output 28 [2025-03-08 00:39:08,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:39:08,170 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 35 treesize of output 40 [2025-03-08 00:39:08,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:39:08,232 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 46 treesize of output 54 [2025-03-08 00:39:08,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:39:08,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-03-08 00:39:08,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:39:08,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2025-03-08 00:39:08,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:39:08,552 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 77 treesize of output 94 [2025-03-08 00:39:08,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:08,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:39:08,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 88 treesize of output 108 [2025-03-08 00:39:09,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:09,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:09,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:09,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:09,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:09,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:09,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:09,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:09,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:09,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:09,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:09,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:10,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:10,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:10,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:10,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:10,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:10,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:10,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:10,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:10,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:10,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:10,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:10,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:10,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:10,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:10,195 INFO L349 Elim1Store]: treesize reduction 386, result has 32.6 percent of original size [2025-03-08 00:39:10,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 39 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 165 case distinctions, treesize of input 186 treesize of output 318 [2025-03-08 00:39:18,249 INFO L349 Elim1Store]: treesize reduction 320, result has 30.0 percent of original size [2025-03-08 00:39:18,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 1020 treesize of output 976 [2025-03-08 00:39:39,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,880 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 00:39:39,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:39,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:41,087 INFO L349 Elim1Store]: treesize reduction 691, result has 7.5 percent of original size [2025-03-08 00:39:41,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 16 select indices, 16 select index equivalence classes, 49 disjoint index pairs (out of 120 index pairs), introduced 15 new quantified variables, introduced 51 case distinctions, treesize of input 1016 treesize of output 1103 [2025-03-08 00:39:53,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,948 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 00:39:53,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:53,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:39:54,038 INFO L349 Elim1Store]: treesize reduction 143, result has 40.9 percent of original size [2025-03-08 00:39:54,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 32 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 147 [2025-03-08 00:40:18,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2059 treesize of output 1901 [2025-03-08 00:40:18,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,433 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 00:40:18,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,465 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 00:40:18,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,483 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 00:40:18,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,505 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 00:40:18,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,527 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 00:40:18,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,582 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 00:40:18,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,600 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 00:40:18,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,647 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 00:40:18,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,663 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 00:40:18,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:40:18,664 INFO L224 Elim1Store]: Index analysis took 172 ms [2025-03-08 00:40:23,116 INFO L349 Elim1Store]: treesize reduction 20, result has 97.9 percent of original size [2025-03-08 00:40:23,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 26 select indices, 26 select index equivalence classes, 99 disjoint index pairs (out of 325 index pairs), introduced 19 new quantified variables, introduced 107 case distinctions, treesize of input 1888 treesize of output 2179