./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-cav19/array_init_var_plus_ind3.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-cav19/array_init_var_plus_ind3.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 d03532f6674c1e8789842ed1d67090f7bce36756d61994a67b8c2e5e0b23351f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:41:34,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:41:34,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:41:34,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:41:34,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:41:34,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:41:34,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:41:34,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:41:34,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:41:34,536 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:41:34,536 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:41:34,536 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:41:34,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:41:34,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:41:34,537 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:41:34,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:41:34,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:41:34,537 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:41:34,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:41:34,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:41:34,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:41:34,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:41:34,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:41:34,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:41:34,538 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:41:34,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:41:34,538 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:41:34,538 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:41:34,538 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:41:34,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:41:34,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:41:34,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:41:34,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:41:34,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:41:34,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:41:34,539 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:41:34,539 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:41:34,539 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:41:34,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:41:34,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:41:34,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:41:34,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:41:34,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:41:34,540 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 -> d03532f6674c1e8789842ed1d67090f7bce36756d61994a67b8c2e5e0b23351f [2025-03-08 00:41:34,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:41:34,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:41:34,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:41:34,745 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:41:34,746 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:41:34,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_init_var_plus_ind3.c [2025-03-08 00:41:35,825 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0277ee0f1/62df8abd03dd419f86090239dcd049d4/FLAG0e82aefe2 [2025-03-08 00:41:36,041 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:41:36,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_var_plus_ind3.c [2025-03-08 00:41:36,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0277ee0f1/62df8abd03dd419f86090239dcd049d4/FLAG0e82aefe2 [2025-03-08 00:41:36,098 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0277ee0f1/62df8abd03dd419f86090239dcd049d4 [2025-03-08 00:41:36,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:41:36,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:41:36,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:41:36,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:41:36,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:41:36,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:41:36" (1/1) ... [2025-03-08 00:41:36,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e76790c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:36, skipping insertion in model container [2025-03-08 00:41:36,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:41:36" (1/1) ... [2025-03-08 00:41:36,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:41:36,222 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-cav19/array_init_var_plus_ind3.c[415,428] [2025-03-08 00:41:36,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:41:36,244 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:41:36,253 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-cav19/array_init_var_plus_ind3.c[415,428] [2025-03-08 00:41:36,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:41:36,268 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:41:36,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:36 WrapperNode [2025-03-08 00:41:36,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:41:36,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:41:36,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:41:36,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:41:36,275 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:41:36" (1/1) ... [2025-03-08 00:41:36,279 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:41:36" (1/1) ... [2025-03-08 00:41:36,289 INFO L138 Inliner]: procedures = 15, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2025-03-08 00:41:36,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:41:36,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:41:36,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:41:36,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:41:36,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:36" (1/1) ... [2025-03-08 00:41:36,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:36" (1/1) ... [2025-03-08 00:41:36,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:36" (1/1) ... [2025-03-08 00:41:36,308 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-08 00:41:36,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:36" (1/1) ... [2025-03-08 00:41:36,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:36" (1/1) ... [2025-03-08 00:41:36,315 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:36" (1/1) ... [2025-03-08 00:41:36,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:36" (1/1) ... [2025-03-08 00:41:36,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:36" (1/1) ... [2025-03-08 00:41:36,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:36" (1/1) ... [2025-03-08 00:41:36,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:41:36,319 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:41:36,319 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:41:36,319 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:41:36,319 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:36" (1/1) ... [2025-03-08 00:41:36,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:41:36,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:36,342 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:41:36,344 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:41:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:41:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:41:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:41:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:41:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:41:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:41:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:41:36,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:41:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:41:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:41:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:41:36,408 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:41:36,410 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:41:36,495 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-03-08 00:41:36,498 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 00:41:36,498 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:41:36,504 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:41:36,504 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:41:36,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:41:36 BoogieIcfgContainer [2025-03-08 00:41:36,505 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:41:36,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:41:36,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:41:36,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:41:36,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:41:36" (1/3) ... [2025-03-08 00:41:36,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625a5cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:41:36, skipping insertion in model container [2025-03-08 00:41:36,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:36" (2/3) ... [2025-03-08 00:41:36,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625a5cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:41:36, skipping insertion in model container [2025-03-08 00:41:36,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:41:36" (3/3) ... [2025-03-08 00:41:36,513 INFO L128 eAbstractionObserver]: Analyzing ICFG array_init_var_plus_ind3.c [2025-03-08 00:41:36,523 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:41:36,524 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array_init_var_plus_ind3.c that has 1 procedures, 13 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 00:41:36,561 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:41:36,570 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;@6bf5f364, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:41:36,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:41:36,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:36,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 00:41:36,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:36,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:36,578 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:36,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:36,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1039786094, now seen corresponding path program 1 times [2025-03-08 00:41:36,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:36,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63663791] [2025-03-08 00:41:36,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:41:36,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:36,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 00:41:36,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 00:41:36,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:36,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:36,748 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:41:36,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:36,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63663791] [2025-03-08 00:41:36,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63663791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:41:36,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:41:36,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:41:36,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864875138] [2025-03-08 00:41:36,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:41:36,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:41:36,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:36,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:41:36,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:41:36,766 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:36,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:36,804 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2025-03-08 00:41:36,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:41:36,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 00:41:36,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:36,809 INFO L225 Difference]: With dead ends: 30 [2025-03-08 00:41:36,809 INFO L226 Difference]: Without dead ends: 18 [2025-03-08 00:41:36,811 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:41:36,812 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:36,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 16 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:41:36,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-08 00:41:36,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 11. [2025-03-08 00:41:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-03-08 00:41:36,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 7 [2025-03-08 00:41:36,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:36,834 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-03-08 00:41:36,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:36,834 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2025-03-08 00:41:36,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 00:41:36,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:36,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:36,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:41:36,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:36,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:36,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2141847483, now seen corresponding path program 1 times [2025-03-08 00:41:36,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:36,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907296425] [2025-03-08 00:41:36,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:41:36,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:36,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 00:41:36,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 00:41:36,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:36,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:36,900 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:41:36,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:36,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907296425] [2025-03-08 00:41:36,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907296425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:41:36,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:41:36,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:41:36,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966018313] [2025-03-08 00:41:36,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:41:36,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:41:36,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:36,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:41:36,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:41:36,902 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:36,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:36,922 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2025-03-08 00:41:36,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:41:36,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 00:41:36,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:36,924 INFO L225 Difference]: With dead ends: 19 [2025-03-08 00:41:36,924 INFO L226 Difference]: Without dead ends: 12 [2025-03-08 00:41:36,924 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:41:36,924 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:36,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:41:36,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-08 00:41:36,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-08 00:41:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-03-08 00:41:36,930 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 8 [2025-03-08 00:41:36,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:36,930 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-03-08 00:41:36,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2025-03-08 00:41:36,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 00:41:36,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:36,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:36,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:41:36,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:36,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:36,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2035593711, now seen corresponding path program 1 times [2025-03-08 00:41:36,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:36,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017945671] [2025-03-08 00:41:36,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:41:36,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:36,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 00:41:36,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 00:41:36,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:36,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:37,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:37,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:37,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017945671] [2025-03-08 00:41:37,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017945671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:37,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453044460] [2025-03-08 00:41:37,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:41:37,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:37,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:37,004 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:41:37,005 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:41:37,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 00:41:37,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 00:41:37,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:37,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:37,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:41:37,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:37,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:37,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:37,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:37,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453044460] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:37,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:37,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-03-08 00:41:37,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126348453] [2025-03-08 00:41:37,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:37,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:41:37,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:37,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:41:37,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:41:37,160 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:37,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:37,237 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2025-03-08 00:41:37,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:41:37,237 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 00:41:37,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:37,237 INFO L225 Difference]: With dead ends: 37 [2025-03-08 00:41:37,237 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 00:41:37,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:41:37,238 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 89 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:37,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 45 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:41:37,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 00:41:37,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 17. [2025-03-08 00:41:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2025-03-08 00:41:37,241 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2025-03-08 00:41:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:37,241 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-03-08 00:41:37,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2025-03-08 00:41:37,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 00:41:37,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:37,241 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:37,248 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:41:37,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:37,446 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:37,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:37,447 INFO L85 PathProgramCache]: Analyzing trace with hash -582250183, now seen corresponding path program 1 times [2025-03-08 00:41:37,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:37,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009824141] [2025-03-08 00:41:37,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:41:37,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:37,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 00:41:37,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 00:41:37,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:37,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:37,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:37,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:37,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009824141] [2025-03-08 00:41:37,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009824141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:37,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031797271] [2025-03-08 00:41:37,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:41:37,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:37,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:37,531 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:41:37,533 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:41:37,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 00:41:37,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 00:41:37,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:37,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:37,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 00:41:37,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:37,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:37,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031797271] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:37,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:37,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-08 00:41:37,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456913112] [2025-03-08 00:41:37,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:37,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:41:37,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:37,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:41:37,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:41:37,658 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:37,710 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2025-03-08 00:41:37,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:41:37,710 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 00:41:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:37,711 INFO L225 Difference]: With dead ends: 31 [2025-03-08 00:41:37,711 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 00:41:37,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:41:37,713 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:37,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:41:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 00:41:37,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-08 00:41:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-03-08 00:41:37,718 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2025-03-08 00:41:37,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:37,718 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-03-08 00:41:37,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-03-08 00:41:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:41:37,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:37,718 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:37,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:41:37,919 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,SelfDestructingSolverStorable3 [2025-03-08 00:41:37,919 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:37,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:37,920 INFO L85 PathProgramCache]: Analyzing trace with hash 345570675, now seen corresponding path program 2 times [2025-03-08 00:41:37,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:37,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689736510] [2025-03-08 00:41:37,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:41:37,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:37,927 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-08 00:41:37,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:41:37,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:41:37,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:38,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:38,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689736510] [2025-03-08 00:41:38,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689736510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:38,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407734567] [2025-03-08 00:41:38,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:41:38,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:38,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:38,070 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:41:38,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:41:38,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-08 00:41:38,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:41:38,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:41:38,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:38,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:41:38,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:38,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:38,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407734567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:38,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:38,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-08 00:41:38,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112449541] [2025-03-08 00:41:38,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:38,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 00:41:38,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:38,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 00:41:38,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=263, Unknown=0, NotChecked=0, Total=462 [2025-03-08 00:41:38,316 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:38,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:38,459 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2025-03-08 00:41:38,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 00:41:38,460 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 00:41:38,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:38,461 INFO L225 Difference]: With dead ends: 81 [2025-03-08 00:41:38,461 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 00:41:38,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=301, Invalid=455, Unknown=0, NotChecked=0, Total=756 [2025-03-08 00:41:38,462 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 149 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:38,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 60 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:41:38,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 00:41:38,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 33. [2025-03-08 00:41:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2025-03-08 00:41:38,466 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 17 [2025-03-08 00:41:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:38,466 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-03-08 00:41:38,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2025-03-08 00:41:38,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 00:41:38,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:38,467 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:38,472 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:41:38,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:38,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:38,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:38,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2096005974, now seen corresponding path program 2 times [2025-03-08 00:41:38,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:38,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506836990] [2025-03-08 00:41:38,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:41:38,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:38,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-08 00:41:38,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:41:38,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:41:38,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:38,919 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:38,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:38,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506836990] [2025-03-08 00:41:38,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506836990] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:38,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283738514] [2025-03-08 00:41:38,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:41:38,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:38,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:38,922 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:41:38,924 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:41:38,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-08 00:41:38,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:41:38,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:41:38,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:38,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 00:41:38,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:39,136 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 15 treesize of output 1 [2025-03-08 00:41:39,199 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 17 treesize of output 9 [2025-03-08 00:41:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:39,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:39,264 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 16 treesize of output 14 [2025-03-08 00:41:39,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-08 00:41:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:39,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283738514] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:39,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:39,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-08 00:41:39,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557570326] [2025-03-08 00:41:39,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:39,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 00:41:39,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:39,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 00:41:39,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:41:39,385 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:39,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:39,495 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2025-03-08 00:41:39,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:41:39,495 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 00:41:39,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:39,496 INFO L225 Difference]: With dead ends: 44 [2025-03-08 00:41:39,497 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 00:41:39,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:41:39,497 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:39,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 105 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:41:39,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 00:41:39,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2025-03-08 00:41:39,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:39,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2025-03-08 00:41:39,502 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 18 [2025-03-08 00:41:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:39,502 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2025-03-08 00:41:39,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:39,502 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2025-03-08 00:41:39,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 00:41:39,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:39,503 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:39,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 00:41:39,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:39,703 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:39,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:39,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1843095349, now seen corresponding path program 3 times [2025-03-08 00:41:39,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:39,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934181151] [2025-03-08 00:41:39,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:41:39,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:39,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 7 equivalence classes. [2025-03-08 00:41:39,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:41:39,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:41:39,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:40,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:40,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934181151] [2025-03-08 00:41:40,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934181151] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:40,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198095093] [2025-03-08 00:41:40,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:41:40,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:40,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:40,006 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:41:40,008 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:41:40,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 7 equivalence classes. [2025-03-08 00:41:40,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:41:40,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:41:40,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:40,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 00:41:40,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:40,113 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 19 treesize of output 1 [2025-03-08 00:41:40,151 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-08 00:41:40,151 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 1 case distinctions, treesize of input 35 treesize of output 15 [2025-03-08 00:41:40,200 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 21 treesize of output 9 [2025-03-08 00:41:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:40,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:40,290 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 23 treesize of output 21 [2025-03-08 00:41:40,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2025-03-08 00:41:40,428 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:40,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198095093] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:40,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:40,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-08 00:41:40,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775960419] [2025-03-08 00:41:40,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:40,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 00:41:40,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:40,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 00:41:40,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:41:40,430 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:40,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:40,575 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2025-03-08 00:41:40,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:41:40,575 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-08 00:41:40,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:40,576 INFO L225 Difference]: With dead ends: 41 [2025-03-08 00:41:40,576 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 00:41:40,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:41:40,577 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 35 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:40,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 65 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:41:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 00:41:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2025-03-08 00:41:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2025-03-08 00:41:40,584 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 20 [2025-03-08 00:41:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:40,585 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-03-08 00:41:40,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2025-03-08 00:41:40,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:41:40,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:40,585 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:40,591 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:41:40,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:40,788 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:40,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:40,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1880294997, now seen corresponding path program 1 times [2025-03-08 00:41:40,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:40,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679485868] [2025-03-08 00:41:40,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:41:40,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:40,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 00:41:40,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:41:40,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:40,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:40,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:40,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679485868] [2025-03-08 00:41:40,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679485868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:40,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460895495] [2025-03-08 00:41:40,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:41:40,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:40,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:40,904 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:41:40,905 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:41:40,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 00:41:40,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:41:40,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:40,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:40,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 00:41:40,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:41,009 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:41,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:41,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460895495] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:41,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:41,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2025-03-08 00:41:41,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084039427] [2025-03-08 00:41:41,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:41,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:41:41,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:41,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:41:41,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:41:41,078 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:41,115 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-03-08 00:41:41,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:41:41,115 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 00:41:41,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:41,116 INFO L225 Difference]: With dead ends: 45 [2025-03-08 00:41:41,116 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 00:41:41,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:41:41,116 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:41,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:41:41,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 00:41:41,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-08 00:41:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-03-08 00:41:41,123 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 21 [2025-03-08 00:41:41,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:41,123 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-08 00:41:41,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:41,123 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-03-08 00:41:41,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 00:41:41,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:41,126 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:41,131 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:41:41,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:41,326 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:41,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:41,327 INFO L85 PathProgramCache]: Analyzing trace with hash 792502806, now seen corresponding path program 2 times [2025-03-08 00:41:41,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:41,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381949132] [2025-03-08 00:41:41,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:41:41,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:41,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-08 00:41:41,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:41:41,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:41:41,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:41,640 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:41,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:41,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381949132] [2025-03-08 00:41:41,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381949132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:41,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120495139] [2025-03-08 00:41:41,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:41:41,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:41,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:41,642 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:41:41,651 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:41:41,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-08 00:41:41,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:41:41,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:41:41,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:41,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 00:41:41,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:41,800 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 23 treesize of output 1 [2025-03-08 00:41:41,925 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:41:41,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-08 00:41:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:41,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:42,074 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 18 treesize of output 16 [2025-03-08 00:41:42,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-03-08 00:41:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:42,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120495139] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:42,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:42,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2025-03-08 00:41:42,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707829060] [2025-03-08 00:41:42,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:42,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 00:41:42,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:42,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 00:41:42,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2025-03-08 00:41:42,313 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 30 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:42,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:42,465 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2025-03-08 00:41:42,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:41:42,465 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 30 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-08 00:41:42,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:42,465 INFO L225 Difference]: With dead ends: 44 [2025-03-08 00:41:42,466 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 00:41:42,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2025-03-08 00:41:42,466 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:42,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 52 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:41:42,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 00:41:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-08 00:41:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:42,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-03-08 00:41:42,470 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 23 [2025-03-08 00:41:42,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:42,470 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-03-08 00:41:42,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 30 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-03-08 00:41:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:41:42,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:42,471 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:42,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 00:41:42,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:42,672 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:42,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:42,672 INFO L85 PathProgramCache]: Analyzing trace with hash -898739817, now seen corresponding path program 3 times [2025-03-08 00:41:42,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:42,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142906] [2025-03-08 00:41:42,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:41:42,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:42,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 8 equivalence classes. [2025-03-08 00:41:42,692 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:41:42,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-08 00:41:42,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:42,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:42,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142906] [2025-03-08 00:41:42,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:42,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988193504] [2025-03-08 00:41:42,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:41:42,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:42,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:42,982 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:41:42,984 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:41:43,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 8 equivalence classes. [2025-03-08 00:41:43,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:41:43,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-08 00:41:43,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:43,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 00:41:43,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:43,173 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 15 treesize of output 1 [2025-03-08 00:41:43,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:43,206 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 29 treesize of output 13 [2025-03-08 00:41:43,283 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 17 treesize of output 9 [2025-03-08 00:41:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:43,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:43,430 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 23 treesize of output 21 [2025-03-08 00:41:43,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-03-08 00:41:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:43,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988193504] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:43,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:43,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2025-03-08 00:41:43,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181466121] [2025-03-08 00:41:43,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:43,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 00:41:43,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:43,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 00:41:43,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 00:41:43,601 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 34 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:43,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:43,808 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2025-03-08 00:41:43,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:41:43,808 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 34 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 00:41:43,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:43,809 INFO L225 Difference]: With dead ends: 41 [2025-03-08 00:41:43,809 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 00:41:43,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=1259, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 00:41:43,810 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 23 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:43,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 89 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:41:43,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 00:41:43,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2025-03-08 00:41:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-03-08 00:41:43,815 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 25 [2025-03-08 00:41:43,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:43,815 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-03-08 00:41:43,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 34 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-03-08 00:41:43,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 00:41:43,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:43,816 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:43,823 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:41:44,017 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,SelfDestructingSolverStorable9 [2025-03-08 00:41:44,017 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:44,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:44,017 INFO L85 PathProgramCache]: Analyzing trace with hash 469107828, now seen corresponding path program 4 times [2025-03-08 00:41:44,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:44,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369333919] [2025-03-08 00:41:44,017 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:41:44,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:44,039 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-08 00:41:44,051 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:41:44,051 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:41:44,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:44,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:44,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369333919] [2025-03-08 00:41:44,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369333919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:44,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671316731] [2025-03-08 00:41:44,315 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:41:44,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:44,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:44,317 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:41:44,318 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:41:44,353 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-08 00:41:44,389 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:41:44,389 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:41:44,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:44,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 00:41:44,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:44,485 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 23 treesize of output 1 [2025-03-08 00:41:44,638 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:41:44,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-08 00:41:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 5 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:44,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:44,820 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 18 treesize of output 16 [2025-03-08 00:41:44,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-03-08 00:41:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:45,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671316731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:45,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:45,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 37 [2025-03-08 00:41:45,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050576505] [2025-03-08 00:41:45,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:45,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-08 00:41:45,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:45,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-08 00:41:45,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1059, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 00:41:45,037 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:45,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:45,186 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2025-03-08 00:41:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 00:41:45,187 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-08 00:41:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:45,187 INFO L225 Difference]: With dead ends: 50 [2025-03-08 00:41:45,187 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 00:41:45,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=289, Invalid=1117, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 00:41:45,188 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:45,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:41:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 00:41:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-08 00:41:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-03-08 00:41:45,191 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 28 [2025-03-08 00:41:45,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:45,192 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-03-08 00:41:45,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-03-08 00:41:45,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:41:45,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:45,192 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:45,198 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:41:45,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:45,396 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:45,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:45,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1402658195, now seen corresponding path program 5 times [2025-03-08 00:41:45,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:45,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145788223] [2025-03-08 00:41:45,397 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:41:45,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:45,407 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 9 equivalence classes. [2025-03-08 00:41:45,418 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:41:45,418 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-08 00:41:45,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:45,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:45,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145788223] [2025-03-08 00:41:45,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145788223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:45,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43582212] [2025-03-08 00:41:45,702 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:41:45,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:45,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:45,704 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:41:45,713 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:41:45,748 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 9 equivalence classes. [2025-03-08 00:41:45,779 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:41:45,779 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-08 00:41:45,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:45,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 00:41:45,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:45,945 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 15 treesize of output 1 [2025-03-08 00:41:45,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:45,983 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 29 treesize of output 13 [2025-03-08 00:41:46,090 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 17 treesize of output 9 [2025-03-08 00:41:46,105 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:46,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:46,234 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 23 treesize of output 21 [2025-03-08 00:41:46,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-03-08 00:41:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:46,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43582212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:46,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:46,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 40 [2025-03-08 00:41:46,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773173639] [2025-03-08 00:41:46,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:46,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 00:41:46,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:46,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 00:41:46,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1433, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 00:41:46,398 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 40 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:46,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:46,686 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-03-08 00:41:46,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 00:41:46,686 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-08 00:41:46,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:46,686 INFO L225 Difference]: With dead ends: 44 [2025-03-08 00:41:46,686 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 00:41:46,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=1801, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 00:41:46,687 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 62 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:46,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 163 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:41:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 00:41:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-03-08 00:41:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-03-08 00:41:46,691 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 30 [2025-03-08 00:41:46,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:46,691 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-03-08 00:41:46,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:46,691 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-03-08 00:41:46,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 00:41:46,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:46,691 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:46,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 00:41:46,892 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,SelfDestructingSolverStorable11 [2025-03-08 00:41:46,892 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:46,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:46,892 INFO L85 PathProgramCache]: Analyzing trace with hash 854337272, now seen corresponding path program 6 times [2025-03-08 00:41:46,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:46,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007748185] [2025-03-08 00:41:46,893 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:41:46,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:46,899 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 9 equivalence classes. [2025-03-08 00:41:46,919 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:41:46,919 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-08 00:41:46,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 9 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:47,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:47,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007748185] [2025-03-08 00:41:47,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007748185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:47,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549598709] [2025-03-08 00:41:47,252 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:41:47,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:47,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:47,254 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:41:47,256 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:41:47,290 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 9 equivalence classes. [2025-03-08 00:41:47,340 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:41:47,340 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-08 00:41:47,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:47,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 00:41:47,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:47,453 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 23 treesize of output 1 [2025-03-08 00:41:47,698 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:41:47,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-08 00:41:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 11 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:47,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:47,936 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 18 treesize of output 16 [2025-03-08 00:41:47,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-03-08 00:41:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:48,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549598709] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:48,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:48,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 45 [2025-03-08 00:41:48,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913256433] [2025-03-08 00:41:48,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:48,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 00:41:48,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:48,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 00:41:48,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=1635, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 00:41:48,204 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 45 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:48,461 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2025-03-08 00:41:48,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 00:41:48,461 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 45 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-08 00:41:48,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:48,461 INFO L225 Difference]: With dead ends: 56 [2025-03-08 00:41:48,462 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 00:41:48,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=383, Invalid=1779, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 00:41:48,462 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:48,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 105 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:41:48,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 00:41:48,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-08 00:41:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-03-08 00:41:48,466 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 33 [2025-03-08 00:41:48,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:48,466 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-03-08 00:41:48,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 45 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:48,467 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-03-08 00:41:48,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 00:41:48,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:48,467 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:48,473 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:41:48,667 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,SelfDestructingSolverStorable12 [2025-03-08 00:41:48,667 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:48,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:48,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1572001479, now seen corresponding path program 7 times [2025-03-08 00:41:48,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:48,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664687449] [2025-03-08 00:41:48,668 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:41:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:48,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 00:41:48,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:41:48,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:48,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:49,009 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:49,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:49,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664687449] [2025-03-08 00:41:49,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664687449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:49,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369482989] [2025-03-08 00:41:49,010 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:41:49,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:49,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:49,011 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:41:49,013 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:41:49,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 00:41:49,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:41:49,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:49,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:49,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 00:41:49,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:49,275 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 15 treesize of output 1 [2025-03-08 00:41:49,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:49,308 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 29 treesize of output 13 [2025-03-08 00:41:49,438 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 17 treesize of output 9 [2025-03-08 00:41:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:49,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:49,611 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 23 treesize of output 21 [2025-03-08 00:41:49,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2025-03-08 00:41:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:49,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369482989] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:49,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:49,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 46 [2025-03-08 00:41:49,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228085135] [2025-03-08 00:41:49,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:49,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 00:41:49,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:49,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 00:41:49,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1922, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 00:41:49,802 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 46 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 46 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:50,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:50,129 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2025-03-08 00:41:50,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:41:50,130 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 46 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-08 00:41:50,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:50,130 INFO L225 Difference]: With dead ends: 47 [2025-03-08 00:41:50,130 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 00:41:50,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=2441, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 00:41:50,132 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 26 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:50,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 167 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:41:50,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 00:41:50,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2025-03-08 00:41:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2025-03-08 00:41:50,140 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 35 [2025-03-08 00:41:50,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:50,140 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2025-03-08 00:41:50,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 46 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2025-03-08 00:41:50,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 00:41:50,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:50,141 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:50,148 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:41:50,341 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,SelfDestructingSolverStorable13 [2025-03-08 00:41:50,342 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:50,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:50,342 INFO L85 PathProgramCache]: Analyzing trace with hash 828207506, now seen corresponding path program 8 times [2025-03-08 00:41:50,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:50,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245377502] [2025-03-08 00:41:50,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:41:50,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:50,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-08 00:41:50,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:41:50,357 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:41:50,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 18 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:50,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:50,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245377502] [2025-03-08 00:41:50,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245377502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:50,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66897249] [2025-03-08 00:41:50,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:41:50,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:50,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:50,727 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:41:50,729 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:41:50,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-08 00:41:50,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:41:50,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:41:50,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:50,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-08 00:41:50,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:50,991 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 15 treesize of output 1 [2025-03-08 00:41:51,027 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 38 treesize of output 22 [2025-03-08 00:41:51,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:41:51,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2025-03-08 00:41:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:51,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:51,667 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 26 treesize of output 24 [2025-03-08 00:41:51,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 106 [2025-03-08 00:41:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 15 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:52,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66897249] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:52,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:52,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 51 [2025-03-08 00:41:52,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216845287] [2025-03-08 00:41:52,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:52,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-08 00:41:52,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:52,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-08 00:41:52,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=2151, Unknown=0, NotChecked=0, Total=2550 [2025-03-08 00:41:52,020 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 51 states, 51 states have (on average 2.1372549019607843) internal successors, (109), 51 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:54,667 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2025-03-08 00:41:54,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 00:41:54,667 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.1372549019607843) internal successors, (109), 51 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-08 00:41:54,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:54,667 INFO L225 Difference]: With dead ends: 78 [2025-03-08 00:41:54,667 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 00:41:54,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=655, Invalid=3635, Unknown=0, NotChecked=0, Total=4290 [2025-03-08 00:41:54,669 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:54,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 115 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 616 Invalid, 4 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 00:41:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 00:41:54,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-08 00:41:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2025-03-08 00:41:54,673 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 38 [2025-03-08 00:41:54,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:54,673 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2025-03-08 00:41:54,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.1372549019607843) internal successors, (109), 51 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:54,673 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2025-03-08 00:41:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 00:41:54,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:54,674 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:54,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 00:41:54,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 00:41:54,876 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:54,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:54,877 INFO L85 PathProgramCache]: Analyzing trace with hash -482487664, now seen corresponding path program 9 times [2025-03-08 00:41:54,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:54,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237270879] [2025-03-08 00:41:54,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:41:54,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:54,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 12 equivalence classes. [2025-03-08 00:41:54,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 00:41:54,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-08 00:41:54,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:55,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:55,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237270879] [2025-03-08 00:41:55,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237270879] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:55,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516585799] [2025-03-08 00:41:55,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:41:55,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:55,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:55,372 INFO L229 MonitoredProcess]: Starting monitored process 15 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:41:55,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 00:41:55,423 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 12 equivalence classes. [2025-03-08 00:41:55,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 00:41:55,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-08 00:41:55,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:55,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 00:41:55,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:55,634 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 19 treesize of output 1 [2025-03-08 00:41:55,645 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-08 00:41:55,645 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 1 case distinctions, treesize of input 35 treesize of output 15 [2025-03-08 00:41:55,669 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-08 00:41:55,669 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 1 case distinctions, treesize of input 35 treesize of output 15 [2025-03-08 00:41:55,774 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 21 treesize of output 9 [2025-03-08 00:41:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:55,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:58,843 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 30 treesize of output 28 [2025-03-08 00:41:58,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2025-03-08 00:41:59,072 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:59,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516585799] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:59,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:59,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 45 [2025-03-08 00:41:59,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667705494] [2025-03-08 00:41:59,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:59,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 00:41:59,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:59,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 00:41:59,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1834, Unknown=6, NotChecked=0, Total=1980 [2025-03-08 00:41:59,073 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 45 states, 45 states have (on average 2.2666666666666666) internal successors, (102), 45 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:59,461 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2025-03-08 00:41:59,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 00:41:59,462 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.2666666666666666) internal successors, (102), 45 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-08 00:41:59,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:59,462 INFO L225 Difference]: With dead ends: 50 [2025-03-08 00:41:59,462 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 00:41:59,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=215, Invalid=2329, Unknown=6, NotChecked=0, Total=2550 [2025-03-08 00:41:59,463 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:59,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 206 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:41:59,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 00:41:59,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2025-03-08 00:41:59,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:59,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2025-03-08 00:41:59,471 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2025-03-08 00:41:59,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:59,471 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2025-03-08 00:41:59,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.2666666666666666) internal successors, (102), 45 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:59,471 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2025-03-08 00:41:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 00:41:59,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:59,472 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:59,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 00:41:59,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:59,674 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:59,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:59,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1466414299, now seen corresponding path program 10 times [2025-03-08 00:41:59,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:59,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408213174] [2025-03-08 00:41:59,674 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:41:59,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:59,680 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-03-08 00:41:59,698 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 00:41:59,698 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:41:59,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:00,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:00,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408213174] [2025-03-08 00:42:00,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408213174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:00,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669009417] [2025-03-08 00:42:00,141 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:42:00,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:00,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:00,143 INFO L229 MonitoredProcess]: Starting monitored process 16 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:42:00,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 00:42:00,197 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-03-08 00:42:00,294 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 00:42:00,294 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:42:00,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:00,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-08 00:42:00,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:00,344 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 19 treesize of output 1 [2025-03-08 00:42:00,376 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-08 00:42:00,376 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 1 case distinctions, treesize of input 35 treesize of output 15 [2025-03-08 00:42:00,564 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 21 treesize of output 9 [2025-03-08 00:42:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:00,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:00,834 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 23 treesize of output 21 [2025-03-08 00:42:00,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2025-03-08 00:42:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:01,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669009417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:01,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:01,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 47 [2025-03-08 00:42:01,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974295978] [2025-03-08 00:42:01,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:01,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-08 00:42:01,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:01,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-08 00:42:01,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2023, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 00:42:01,157 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 47 states, 47 states have (on average 2.297872340425532) internal successors, (108), 47 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:01,554 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2025-03-08 00:42:01,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 00:42:01,554 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.297872340425532) internal successors, (108), 47 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-08 00:42:01,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:01,555 INFO L225 Difference]: With dead ends: 53 [2025-03-08 00:42:01,555 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 00:42:01,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=2650, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 00:42:01,556 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 65 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:01,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 252 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:42:01,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 00:42:01,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-03-08 00:42:01,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2025-03-08 00:42:01,563 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 45 [2025-03-08 00:42:01,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:01,563 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-03-08 00:42:01,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.297872340425532) internal successors, (108), 47 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:01,563 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2025-03-08 00:42:01,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 00:42:01,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:01,563 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:01,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 00:42:01,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 00:42:01,764 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:01,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:01,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1836886704, now seen corresponding path program 11 times [2025-03-08 00:42:01,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:01,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399878963] [2025-03-08 00:42:01,764 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:01,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:01,771 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 12 equivalence classes. [2025-03-08 00:42:01,798 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:42:01,799 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-08 00:42:01,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:02,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:02,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399878963] [2025-03-08 00:42:02,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399878963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:02,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736199111] [2025-03-08 00:42:02,211 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:02,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:02,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:02,213 INFO L229 MonitoredProcess]: Starting monitored process 17 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:42:02,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 00:42:02,259 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 12 equivalence classes. [2025-03-08 00:42:02,345 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:42:02,345 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-08 00:42:02,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:02,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-08 00:42:02,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:02,580 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 15 treesize of output 1 [2025-03-08 00:42:02,883 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 17 treesize of output 9 [2025-03-08 00:42:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:02,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:03,140 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 16 treesize of output 14 [2025-03-08 00:42:03,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-08 00:42:03,445 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:03,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736199111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:03,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:03,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 61 [2025-03-08 00:42:03,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122033020] [2025-03-08 00:42:03,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:03,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-08 00:42:03,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:03,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-08 00:42:03,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=3462, Unknown=0, NotChecked=0, Total=3660 [2025-03-08 00:42:03,447 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 61 states, 61 states have (on average 2.278688524590164) internal successors, (139), 61 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:03,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:03,922 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2025-03-08 00:42:03,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 00:42:03,923 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.278688524590164) internal successors, (139), 61 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-08 00:42:03,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:03,923 INFO L225 Difference]: With dead ends: 80 [2025-03-08 00:42:03,923 INFO L226 Difference]: Without dead ends: 78 [2025-03-08 00:42:03,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=208, Invalid=3574, Unknown=0, NotChecked=0, Total=3782 [2025-03-08 00:42:03,924 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:03,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 494 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:42:03,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-08 00:42:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 55. [2025-03-08 00:42:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2025-03-08 00:42:03,933 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 48 [2025-03-08 00:42:03,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:03,933 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2025-03-08 00:42:03,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.278688524590164) internal successors, (139), 61 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2025-03-08 00:42:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 00:42:03,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:03,934 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:03,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 00:42:04,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 00:42:04,135 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:04,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:04,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1077599270, now seen corresponding path program 1 times [2025-03-08 00:42:04,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:04,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073449202] [2025-03-08 00:42:04,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:42:04,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:04,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 00:42:04,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:42:04,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:04,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-08 00:42:04,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:04,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073449202] [2025-03-08 00:42:04,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073449202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:04,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15449690] [2025-03-08 00:42:04,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:42:04,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:04,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:04,320 INFO L229 MonitoredProcess]: Starting monitored process 18 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:42:04,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 00:42:04,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 00:42:04,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:42:04,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:04,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:04,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 00:42:04,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-08 00:42:04,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-08 00:42:04,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15449690] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:04,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:04,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 42 [2025-03-08 00:42:04,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996726633] [2025-03-08 00:42:04,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:04,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-08 00:42:04,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:04,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-08 00:42:04,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=1019, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 00:42:04,743 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:05,037 INFO L93 Difference]: Finished difference Result 449 states and 479 transitions. [2025-03-08 00:42:05,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 00:42:05,041 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-08 00:42:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:05,042 INFO L225 Difference]: With dead ends: 449 [2025-03-08 00:42:05,042 INFO L226 Difference]: Without dead ends: 426 [2025-03-08 00:42:05,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1190, Invalid=1890, Unknown=0, NotChecked=0, Total=3080 [2025-03-08 00:42:05,043 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 453 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:05,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 146 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:42:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-08 00:42:05,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 82. [2025-03-08 00:42:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 81 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2025-03-08 00:42:05,053 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 49 [2025-03-08 00:42:05,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:05,053 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2025-03-08 00:42:05,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:05,054 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2025-03-08 00:42:05,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 00:42:05,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:05,054 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:05,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 00:42:05,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:05,255 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:05,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:05,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1715421617, now seen corresponding path program 12 times [2025-03-08 00:42:05,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:05,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400561399] [2025-03-08 00:42:05,255 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:42:05,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:05,261 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 13 equivalence classes. [2025-03-08 00:42:05,278 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 00:42:05,278 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-08 00:42:05,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:05,714 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:05,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:05,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400561399] [2025-03-08 00:42:05,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400561399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:05,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488456164] [2025-03-08 00:42:05,715 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:42:05,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:05,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:05,717 INFO L229 MonitoredProcess]: Starting monitored process 19 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:42:05,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 00:42:05,773 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 13 equivalence classes. [2025-03-08 00:42:05,984 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 00:42:05,984 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-08 00:42:05,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:05,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-08 00:42:05,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:06,241 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 15 treesize of output 1 [2025-03-08 00:42:06,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:06,270 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 29 treesize of output 13 [2025-03-08 00:42:06,558 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 17 treesize of output 9 [2025-03-08 00:42:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:06,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:06,881 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 23 treesize of output 21 [2025-03-08 00:42:06,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-03-08 00:42:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:07,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488456164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:07,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:07,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 66 [2025-03-08 00:42:07,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142155817] [2025-03-08 00:42:07,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:07,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-08 00:42:07,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:07,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-08 00:42:07,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=4065, Unknown=0, NotChecked=0, Total=4290 [2025-03-08 00:42:07,306 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 66 states, 66 states have (on average 2.196969696969697) internal successors, (145), 66 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:08,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:08,044 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2025-03-08 00:42:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 00:42:08,048 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.196969696969697) internal successors, (145), 66 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-08 00:42:08,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:08,048 INFO L225 Difference]: With dead ends: 105 [2025-03-08 00:42:08,048 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 00:42:08,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=336, Invalid=5364, Unknown=0, NotChecked=0, Total=5700 [2025-03-08 00:42:08,050 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:08,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 319 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:42:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 00:42:08,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 81. [2025-03-08 00:42:08,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.2125) internal successors, (97), 80 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2025-03-08 00:42:08,062 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 50 [2025-03-08 00:42:08,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:08,062 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2025-03-08 00:42:08,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.196969696969697) internal successors, (145), 66 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:08,062 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2025-03-08 00:42:08,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 00:42:08,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:08,063 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:08,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-08 00:42:08,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:08,263 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:08,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:08,264 INFO L85 PathProgramCache]: Analyzing trace with hash 514353339, now seen corresponding path program 13 times [2025-03-08 00:42:08,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:08,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342644659] [2025-03-08 00:42:08,264 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:42:08,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:08,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 00:42:08,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 00:42:08,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:08,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 77 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:08,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:08,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342644659] [2025-03-08 00:42:08,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342644659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:08,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66746341] [2025-03-08 00:42:08,466 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:42:08,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:08,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:08,468 INFO L229 MonitoredProcess]: Starting monitored process 20 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:42:08,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 00:42:08,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 00:42:08,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 00:42:08,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:08,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:08,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 00:42:08,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 77 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:08,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 77 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:08,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66746341] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:08,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:08,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 31 [2025-03-08 00:42:08,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3915380] [2025-03-08 00:42:08,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:08,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 00:42:08,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:08,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 00:42:08,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=693, Unknown=0, NotChecked=0, Total=930 [2025-03-08 00:42:08,845 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand has 31 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 31 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:08,918 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2025-03-08 00:42:08,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 00:42:08,918 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 31 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-08 00:42:08,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:08,919 INFO L225 Difference]: With dead ends: 109 [2025-03-08 00:42:08,919 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 00:42:08,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 74 SyntacticMatches, 19 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=693, Unknown=0, NotChecked=0, Total=930 [2025-03-08 00:42:08,920 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:08,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:42:08,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 00:42:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-08 00:42:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.2) internal successors, (96), 80 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2025-03-08 00:42:08,932 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 51 [2025-03-08 00:42:08,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:08,932 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2025-03-08 00:42:08,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 31 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:08,932 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2025-03-08 00:42:08,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 00:42:08,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:08,932 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:08,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-08 00:42:09,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:09,133 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:09,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:09,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1691335868, now seen corresponding path program 14 times [2025-03-08 00:42:09,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:09,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137240947] [2025-03-08 00:42:09,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:09,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:09,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-08 00:42:09,152 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 00:42:09,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:09,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 63 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:09,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:09,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137240947] [2025-03-08 00:42:09,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137240947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:09,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270782716] [2025-03-08 00:42:09,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:09,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:09,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:09,649 INFO L229 MonitoredProcess]: Starting monitored process 21 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:42:09,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 00:42:09,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-08 00:42:09,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 00:42:09,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:09,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:09,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-08 00:42:09,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:09,971 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 23 treesize of output 1 [2025-03-08 00:42:10,402 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:42:10,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-08 00:42:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 70 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:10,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:10,847 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 18 treesize of output 16 [2025-03-08 00:42:10,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-03-08 00:42:11,318 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 63 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:11,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270782716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:11,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:11,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 66 [2025-03-08 00:42:11,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662088377] [2025-03-08 00:42:11,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:11,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-08 00:42:11,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:11,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-08 00:42:11,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=3660, Unknown=0, NotChecked=0, Total=4290 [2025-03-08 00:42:11,320 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 66 states, 66 states have (on average 2.3181818181818183) internal successors, (153), 66 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:11,701 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2025-03-08 00:42:11,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:42:11,703 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.3181818181818183) internal successors, (153), 66 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-08 00:42:11,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:11,704 INFO L225 Difference]: With dead ends: 108 [2025-03-08 00:42:11,704 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 00:42:11,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=661, Invalid=3761, Unknown=0, NotChecked=0, Total=4422 [2025-03-08 00:42:11,705 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:11,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 219 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:42:11,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 00:42:11,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-08 00:42:11,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.1875) internal successors, (95), 80 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:11,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2025-03-08 00:42:11,715 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 53 [2025-03-08 00:42:11,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:11,715 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2025-03-08 00:42:11,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.3181818181818183) internal successors, (153), 66 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:11,715 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2025-03-08 00:42:11,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 00:42:11,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:11,716 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:11,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-08 00:42:11,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 00:42:11,916 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:11,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:11,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1099819907, now seen corresponding path program 15 times [2025-03-08 00:42:11,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:11,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900655477] [2025-03-08 00:42:11,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:42:11,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:11,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 14 equivalence classes. [2025-03-08 00:42:11,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 00:42:11,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-03-08 00:42:11,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:12,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:12,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900655477] [2025-03-08 00:42:12,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900655477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:12,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159614737] [2025-03-08 00:42:12,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:42:12,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:12,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:12,462 INFO L229 MonitoredProcess]: Starting monitored process 22 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:42:12,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 00:42:12,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 14 equivalence classes. [2025-03-08 00:42:12,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 00:42:12,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-03-08 00:42:12,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:12,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-08 00:42:12,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:12,808 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 19 treesize of output 1 [2025-03-08 00:42:12,838 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-08 00:42:12,838 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 1 case distinctions, treesize of input 35 treesize of output 15 [2025-03-08 00:42:13,046 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 21 treesize of output 9 [2025-03-08 00:42:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:13,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:13,329 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 23 treesize of output 21 [2025-03-08 00:42:13,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2025-03-08 00:42:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:13,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159614737] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:13,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:13,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 58 [2025-03-08 00:42:13,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363119965] [2025-03-08 00:42:13,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:13,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-08 00:42:13,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:13,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-08 00:42:13,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3131, Unknown=0, NotChecked=0, Total=3306 [2025-03-08 00:42:13,686 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand has 58 states, 58 states have (on average 2.3620689655172415) internal successors, (137), 58 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:14,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:14,315 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2025-03-08 00:42:14,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:42:14,315 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.3620689655172415) internal successors, (137), 58 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-08 00:42:14,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:14,315 INFO L225 Difference]: With dead ends: 87 [2025-03-08 00:42:14,316 INFO L226 Difference]: Without dead ends: 85 [2025-03-08 00:42:14,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=268, Invalid=4154, Unknown=0, NotChecked=0, Total=4422 [2025-03-08 00:42:14,316 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 68 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 1658 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:14,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 414 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:42:14,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-08 00:42:14,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-03-08 00:42:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.180722891566265) internal successors, (98), 83 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2025-03-08 00:42:14,335 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 55 [2025-03-08 00:42:14,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:14,336 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2025-03-08 00:42:14,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.3620689655172415) internal successors, (137), 58 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:14,336 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2025-03-08 00:42:14,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 00:42:14,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:14,336 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 9, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:14,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-08 00:42:14,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 00:42:14,537 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:14,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:14,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1571524558, now seen corresponding path program 16 times [2025-03-08 00:42:14,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:14,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322449414] [2025-03-08 00:42:14,537 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:42:14,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:14,546 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-03-08 00:42:14,562 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 00:42:14,563 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:42:14,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 84 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:15,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:15,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322449414] [2025-03-08 00:42:15,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322449414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:15,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369354727] [2025-03-08 00:42:15,165 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:42:15,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:15,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:15,167 INFO L229 MonitoredProcess]: Starting monitored process 23 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:42:15,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-08 00:42:15,236 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-03-08 00:42:15,361 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 00:42:15,361 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:42:15,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:15,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-08 00:42:15,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:15,552 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 23 treesize of output 1 [2025-03-08 00:42:16,002 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:42:16,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-08 00:42:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 92 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:16,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:16,458 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 18 treesize of output 16 [2025-03-08 00:42:16,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-03-08 00:42:16,990 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 84 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:16,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369354727] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:16,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:16,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 74 [2025-03-08 00:42:16,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474007598] [2025-03-08 00:42:16,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:16,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2025-03-08 00:42:16,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:16,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2025-03-08 00:42:16,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=920, Invalid=4482, Unknown=0, NotChecked=0, Total=5402 [2025-03-08 00:42:16,992 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 74 states, 74 states have (on average 2.2837837837837838) internal successors, (169), 74 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:17,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:17,296 INFO L93 Difference]: Finished difference Result 114 states and 128 transitions. [2025-03-08 00:42:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 00:42:17,296 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 2.2837837837837838) internal successors, (169), 74 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-08 00:42:17,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:17,296 INFO L225 Difference]: With dead ends: 114 [2025-03-08 00:42:17,296 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 00:42:17,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2409 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=955, Invalid=4595, Unknown=0, NotChecked=0, Total=5550 [2025-03-08 00:42:17,297 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:17,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 193 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:42:17,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 00:42:17,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-08 00:42:17,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 83 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2025-03-08 00:42:17,307 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 97 transitions. Word has length 58 [2025-03-08 00:42:17,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:17,307 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 97 transitions. [2025-03-08 00:42:17,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 2.2837837837837838) internal successors, (169), 74 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2025-03-08 00:42:17,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 00:42:17,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:17,308 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 9, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:17,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-08 00:42:17,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:17,509 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:17,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:17,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2017388717, now seen corresponding path program 17 times [2025-03-08 00:42:17,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:17,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736562843] [2025-03-08 00:42:17,509 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:17,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:17,516 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 60 statements into 15 equivalence classes. [2025-03-08 00:42:17,539 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 00:42:17,539 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-08 00:42:17,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:18,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:18,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736562843] [2025-03-08 00:42:18,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736562843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:18,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906178120] [2025-03-08 00:42:18,118 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:18,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:18,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:18,120 INFO L229 MonitoredProcess]: Starting monitored process 24 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:42:18,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-08 00:42:18,205 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 60 statements into 15 equivalence classes. [2025-03-08 00:42:18,376 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 00:42:18,376 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-08 00:42:18,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:18,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-08 00:42:18,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:18,699 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 15 treesize of output 1 [2025-03-08 00:42:18,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:18,729 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 29 treesize of output 13 [2025-03-08 00:42:19,046 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 17 treesize of output 9 [2025-03-08 00:42:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:19,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:19,441 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 23 treesize of output 21 [2025-03-08 00:42:19,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-03-08 00:42:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:19,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906178120] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:19,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:19,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 76 [2025-03-08 00:42:19,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572021751] [2025-03-08 00:42:19,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:19,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-03-08 00:42:19,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:19,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-03-08 00:42:19,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=5446, Unknown=0, NotChecked=0, Total=5700 [2025-03-08 00:42:19,869 INFO L87 Difference]: Start difference. First operand 84 states and 97 transitions. Second operand has 76 states, 76 states have (on average 2.3026315789473686) internal successors, (175), 76 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:20,640 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2025-03-08 00:42:20,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 00:42:20,641 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 2.3026315789473686) internal successors, (175), 76 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-08 00:42:20,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:20,641 INFO L225 Difference]: With dead ends: 90 [2025-03-08 00:42:20,641 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 00:42:20,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=367, Invalid=6943, Unknown=0, NotChecked=0, Total=7310 [2025-03-08 00:42:20,642 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 48 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 2031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:20,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 510 Invalid, 2031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2030 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:42:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 00:42:20,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2025-03-08 00:42:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2025-03-08 00:42:20,658 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 60 [2025-03-08 00:42:20,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:20,659 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2025-03-08 00:42:20,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 2.3026315789473686) internal successors, (175), 76 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:20,659 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2025-03-08 00:42:20,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 00:42:20,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:20,659 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 10, 9, 9, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:20,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-08 00:42:20,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:20,860 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:20,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:20,860 INFO L85 PathProgramCache]: Analyzing trace with hash 550768030, now seen corresponding path program 18 times [2025-03-08 00:42:20,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:20,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052292028] [2025-03-08 00:42:20,861 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:42:20,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:20,869 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 63 statements into 15 equivalence classes. [2025-03-08 00:42:20,891 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 00:42:20,892 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2025-03-08 00:42:20,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 108 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:21,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:21,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052292028] [2025-03-08 00:42:21,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052292028] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:21,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408619316] [2025-03-08 00:42:21,546 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:42:21,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:21,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:21,548 INFO L229 MonitoredProcess]: Starting monitored process 25 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:42:21,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-08 00:42:21,621 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 63 statements into 15 equivalence classes. [2025-03-08 00:42:22,062 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 00:42:22,062 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2025-03-08 00:42:22,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:22,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-08 00:42:22,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:22,343 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 23 treesize of output 1 [2025-03-08 00:42:22,937 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:42:22,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-08 00:42:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 117 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:22,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:23,529 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 18 treesize of output 16 [2025-03-08 00:42:23,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-03-08 00:42:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 108 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:24,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408619316] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:24,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:24,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 78 [2025-03-08 00:42:24,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777499349] [2025-03-08 00:42:24,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:24,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2025-03-08 00:42:24,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:24,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2025-03-08 00:42:24,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=5151, Unknown=0, NotChecked=0, Total=6006 [2025-03-08 00:42:24,100 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand has 78 states, 78 states have (on average 2.3461538461538463) internal successors, (183), 78 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:24,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:24,497 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2025-03-08 00:42:24,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 00:42:24,498 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 2.3461538461538463) internal successors, (183), 78 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-08 00:42:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:24,498 INFO L225 Difference]: With dead ends: 120 [2025-03-08 00:42:24,498 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 00:42:24,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=892, Invalid=5270, Unknown=0, NotChecked=0, Total=6162 [2025-03-08 00:42:24,499 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:24,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 236 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:42:24,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 00:42:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-08 00:42:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 86 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2025-03-08 00:42:24,510 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 63 [2025-03-08 00:42:24,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:24,510 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2025-03-08 00:42:24,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 2.3461538461538463) internal successors, (183), 78 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2025-03-08 00:42:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 00:42:24,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:24,511 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 10, 9, 9, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:24,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-08 00:42:24,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 00:42:24,712 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:24,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:24,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1361078303, now seen corresponding path program 19 times [2025-03-08 00:42:24,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:24,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094174108] [2025-03-08 00:42:24,712 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:42:24,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:24,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 00:42:24,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 00:42:24,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:24,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:25,355 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:25,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:25,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094174108] [2025-03-08 00:42:25,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094174108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:25,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299734340] [2025-03-08 00:42:25,355 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:42:25,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:25,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:25,359 INFO L229 MonitoredProcess]: Starting monitored process 26 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:42:25,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-08 00:42:25,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 00:42:25,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 00:42:25,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:25,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:25,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-08 00:42:25,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:25,848 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 15 treesize of output 1 [2025-03-08 00:42:25,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:25,880 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 29 treesize of output 13 [2025-03-08 00:42:26,262 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 17 treesize of output 9 [2025-03-08 00:42:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:26,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:26,674 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 23 treesize of output 21 [2025-03-08 00:42:26,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-03-08 00:42:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:27,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299734340] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:27,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:27,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 82 [2025-03-08 00:42:27,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071298912] [2025-03-08 00:42:27,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:27,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2025-03-08 00:42:27,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:27,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2025-03-08 00:42:27,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=6368, Unknown=0, NotChecked=0, Total=6642 [2025-03-08 00:42:27,203 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 82 states, 82 states have (on average 2.317073170731707) internal successors, (190), 82 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:28,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:28,135 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2025-03-08 00:42:28,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 00:42:28,136 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 2.317073170731707) internal successors, (190), 82 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-08 00:42:28,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:28,137 INFO L225 Difference]: With dead ends: 93 [2025-03-08 00:42:28,137 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 00:42:28,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1809 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=403, Invalid=8339, Unknown=0, NotChecked=0, Total=8742 [2025-03-08 00:42:28,138 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 42 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 2537 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 2538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:28,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 614 Invalid, 2538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2537 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:42:28,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 00:42:28,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2025-03-08 00:42:28,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.146067415730337) internal successors, (102), 89 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2025-03-08 00:42:28,154 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 65 [2025-03-08 00:42:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:28,154 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2025-03-08 00:42:28,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 2.317073170731707) internal successors, (190), 82 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:28,155 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2025-03-08 00:42:28,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 00:42:28,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:28,155 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 11, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:28,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-08 00:42:28,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 00:42:28,356 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:28,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:28,356 INFO L85 PathProgramCache]: Analyzing trace with hash -901644052, now seen corresponding path program 20 times [2025-03-08 00:42:28,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:28,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468908512] [2025-03-08 00:42:28,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:28,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:28,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-03-08 00:42:28,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 00:42:28,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:28,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:29,026 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 135 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:29,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:29,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468908512] [2025-03-08 00:42:29,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468908512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:29,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055259319] [2025-03-08 00:42:29,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:29,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:29,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:29,028 INFO L229 MonitoredProcess]: Starting monitored process 27 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:42:29,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-08 00:42:29,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-03-08 00:42:29,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 00:42:29,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:29,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:29,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-08 00:42:29,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:29,450 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 23 treesize of output 1 [2025-03-08 00:42:30,087 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:42:30,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-08 00:42:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 145 proven. 250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:30,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:30,737 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 18 treesize of output 16 [2025-03-08 00:42:30,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-03-08 00:42:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 135 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:31,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055259319] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:31,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:31,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 84 [2025-03-08 00:42:31,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156848148] [2025-03-08 00:42:31,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:31,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2025-03-08 00:42:31,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:31,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2025-03-08 00:42:31,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=981, Invalid=5991, Unknown=0, NotChecked=0, Total=6972 [2025-03-08 00:42:31,356 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 84 states, 84 states have (on average 2.357142857142857) internal successors, (198), 84 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:31,734 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2025-03-08 00:42:31,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 00:42:31,735 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 2.357142857142857) internal successors, (198), 84 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-08 00:42:31,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:31,735 INFO L225 Difference]: With dead ends: 126 [2025-03-08 00:42:31,735 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 00:42:31,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2140 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1021, Invalid=6119, Unknown=0, NotChecked=0, Total=7140 [2025-03-08 00:42:31,736 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:31,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 177 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:42:31,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 00:42:31,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-08 00:42:31,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 89 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2025-03-08 00:42:31,750 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 68 [2025-03-08 00:42:31,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:31,750 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2025-03-08 00:42:31,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 2.357142857142857) internal successors, (198), 84 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:31,750 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2025-03-08 00:42:31,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 00:42:31,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:31,751 INFO L218 NwaCegarLoop]: trace histogram [17, 16, 11, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:31,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-08 00:42:31,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-08 00:42:31,951 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:31,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:31,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1505693451, now seen corresponding path program 21 times [2025-03-08 00:42:31,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:31,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255904970] [2025-03-08 00:42:31,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:42:31,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:31,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 70 statements into 17 equivalence classes. [2025-03-08 00:42:31,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 00:42:31,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2025-03-08 00:42:31,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:32,629 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 0 proven. 427 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:32,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:32,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255904970] [2025-03-08 00:42:32,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255904970] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:32,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454093128] [2025-03-08 00:42:32,629 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:42:32,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:32,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:32,631 INFO L229 MonitoredProcess]: Starting monitored process 28 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:42:32,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-08 00:42:32,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 70 statements into 17 equivalence classes. [2025-03-08 00:42:33,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 00:42:33,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2025-03-08 00:42:33,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:33,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-08 00:42:33,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:33,389 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 19 treesize of output 1 [2025-03-08 00:42:33,422 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-08 00:42:33,422 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 1 case distinctions, treesize of input 35 treesize of output 15 [2025-03-08 00:42:33,734 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 21 treesize of output 9 [2025-03-08 00:42:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 0 proven. 427 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:33,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:34,176 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 23 treesize of output 21 [2025-03-08 00:42:34,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-03-08 00:42:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 0 proven. 427 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:34,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454093128] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:34,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:34,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 73 [2025-03-08 00:42:34,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686816241] [2025-03-08 00:42:34,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:34,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-08 00:42:34,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:34,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-08 00:42:34,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5033, Unknown=0, NotChecked=0, Total=5256 [2025-03-08 00:42:34,695 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 73 states, 73 states have (on average 2.410958904109589) internal successors, (176), 73 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:35,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:35,634 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2025-03-08 00:42:35,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 00:42:35,635 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.410958904109589) internal successors, (176), 73 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-08 00:42:35,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:35,635 INFO L225 Difference]: With dead ends: 96 [2025-03-08 00:42:35,635 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 00:42:35,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=346, Invalid=6794, Unknown=0, NotChecked=0, Total=7140 [2025-03-08 00:42:35,636 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 52 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 2400 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 2401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:35,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 596 Invalid, 2401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2400 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:42:35,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 00:42:35,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-03-08 00:42:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.1304347826086956) internal successors, (104), 92 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2025-03-08 00:42:35,649 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 70 [2025-03-08 00:42:35,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:35,649 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2025-03-08 00:42:35,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 2.410958904109589) internal successors, (176), 73 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:35,649 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2025-03-08 00:42:35,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 00:42:35,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:35,649 INFO L218 NwaCegarLoop]: trace histogram [17, 16, 12, 11, 11, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:35,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-08 00:42:35,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 00:42:35,850 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:35,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:35,850 INFO L85 PathProgramCache]: Analyzing trace with hash -523967872, now seen corresponding path program 22 times [2025-03-08 00:42:35,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:35,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165099605] [2025-03-08 00:42:35,850 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:42:35,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:35,858 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 73 statements into 2 equivalence classes. [2025-03-08 00:42:35,887 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 00:42:35,887 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:42:35,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:36,588 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 165 proven. 294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:36,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:36,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165099605] [2025-03-08 00:42:36,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165099605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:36,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031913992] [2025-03-08 00:42:36,589 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:42:36,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:36,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:36,591 INFO L229 MonitoredProcess]: Starting monitored process 29 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:42:36,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-08 00:42:36,680 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 73 statements into 2 equivalence classes. [2025-03-08 00:42:36,900 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 00:42:36,900 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:42:36,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:36,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-08 00:42:36,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:37,156 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 23 treesize of output 1 [2025-03-08 00:42:37,793 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:42:37,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-08 00:42:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 176 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:37,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:38,485 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 18 treesize of output 16 [2025-03-08 00:42:38,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-03-08 00:42:39,178 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 165 proven. 294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:39,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031913992] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:39,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:39,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 91 [2025-03-08 00:42:39,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872605618] [2025-03-08 00:42:39,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:39,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2025-03-08 00:42:39,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:39,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2025-03-08 00:42:39,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1362, Invalid=6828, Unknown=0, NotChecked=0, Total=8190 [2025-03-08 00:42:39,179 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 91 states, 91 states have (on average 2.3516483516483517) internal successors, (214), 91 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:39,584 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2025-03-08 00:42:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 00:42:39,585 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 2.3516483516483517) internal successors, (214), 91 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-08 00:42:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:39,585 INFO L225 Difference]: With dead ends: 132 [2025-03-08 00:42:39,585 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 00:42:39,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3633 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1405, Invalid=6967, Unknown=0, NotChecked=0, Total=8372 [2025-03-08 00:42:39,586 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:39,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 220 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:42:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 00:42:39,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-08 00:42:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 92 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:39,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2025-03-08 00:42:39,599 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 73 [2025-03-08 00:42:39,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:39,599 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2025-03-08 00:42:39,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 2.3516483516483517) internal successors, (214), 91 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:39,599 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2025-03-08 00:42:39,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 00:42:39,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:39,600 INFO L218 NwaCegarLoop]: trace histogram [18, 17, 12, 11, 11, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:39,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-08 00:42:39,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:39,800 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:39,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:39,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1876504639, now seen corresponding path program 23 times [2025-03-08 00:42:39,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:39,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056640750] [2025-03-08 00:42:39,800 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:39,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:39,809 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 75 statements into 18 equivalence classes. [2025-03-08 00:42:39,836 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 00:42:39,836 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2025-03-08 00:42:39,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 0 proven. 493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:40,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:40,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056640750] [2025-03-08 00:42:40,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056640750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:40,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072159083] [2025-03-08 00:42:40,559 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:40,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:40,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:40,579 INFO L229 MonitoredProcess]: Starting monitored process 30 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:42:40,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-08 00:42:40,678 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 75 statements into 18 equivalence classes. [2025-03-08 00:42:40,885 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 00:42:40,885 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2025-03-08 00:42:40,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:40,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-03-08 00:42:40,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:41,340 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 15 treesize of output 1 [2025-03-08 00:42:41,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:41,375 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 29 treesize of output 13 [2025-03-08 00:42:41,899 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 17 treesize of output 9 [2025-03-08 00:42:41,927 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 0 proven. 493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:41,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:42,445 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 23 treesize of output 21 [2025-03-08 00:42:42,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2025-03-08 00:42:43,076 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 0 proven. 493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:43,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072159083] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:43,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:43,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 94 [2025-03-08 00:42:43,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241689338] [2025-03-08 00:42:43,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:43,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2025-03-08 00:42:43,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:43,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2025-03-08 00:42:43,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=8426, Unknown=0, NotChecked=0, Total=8742 [2025-03-08 00:42:43,078 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 94 states, 94 states have (on average 2.3404255319148937) internal successors, (220), 94 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:44,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:44,259 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2025-03-08 00:42:44,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 00:42:44,259 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 2.3404255319148937) internal successors, (220), 94 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-08 00:42:44,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:44,260 INFO L225 Difference]: With dead ends: 99 [2025-03-08 00:42:44,260 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 00:42:44,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2433 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=467, Invalid=11089, Unknown=0, NotChecked=0, Total=11556 [2025-03-08 00:42:44,260 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 53 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 3193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 3194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:44,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 786 Invalid, 3194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3193 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 00:42:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 00:42:44,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-03-08 00:42:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.1157894736842104) internal successors, (106), 95 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2025-03-08 00:42:44,274 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 75 [2025-03-08 00:42:44,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:44,274 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2025-03-08 00:42:44,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 2.3404255319148937) internal successors, (220), 94 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:44,274 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2025-03-08 00:42:44,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 00:42:44,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:44,275 INFO L218 NwaCegarLoop]: trace histogram [18, 17, 13, 12, 12, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:44,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-03-08 00:42:44,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:44,475 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:44,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:44,476 INFO L85 PathProgramCache]: Analyzing trace with hash 345497098, now seen corresponding path program 24 times [2025-03-08 00:42:44,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:44,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855868564] [2025-03-08 00:42:44,476 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:42:44,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:44,484 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 78 statements into 18 equivalence classes. [2025-03-08 00:42:44,512 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 00:42:44,512 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2025-03-08 00:42:44,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 198 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:45,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:45,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855868564] [2025-03-08 00:42:45,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855868564] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:45,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63953744] [2025-03-08 00:42:45,319 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:42:45,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:45,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:45,321 INFO L229 MonitoredProcess]: Starting monitored process 31 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:42:45,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-08 00:42:45,417 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 78 statements into 18 equivalence classes. [2025-03-08 00:42:45,967 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 00:42:45,967 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2025-03-08 00:42:45,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:45,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-08 00:42:45,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:46,342 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 23 treesize of output 1 [2025-03-08 00:42:47,208 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:42:47,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-08 00:42:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 203 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:47,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:48,044 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 18 treesize of output 16 [2025-03-08 00:42:48,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-03-08 00:42:48,837 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 194 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:48,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63953744] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:48,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:48,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35, 35] total 98 [2025-03-08 00:42:48,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283640281] [2025-03-08 00:42:48,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:48,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2025-03-08 00:42:48,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:48,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2025-03-08 00:42:48,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1308, Invalid=8198, Unknown=0, NotChecked=0, Total=9506 [2025-03-08 00:42:48,839 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 98 states, 98 states have (on average 2.326530612244898) internal successors, (228), 98 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:49,564 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2025-03-08 00:42:49,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-08 00:42:49,565 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 2.326530612244898) internal successors, (228), 98 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-08 00:42:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:49,565 INFO L225 Difference]: With dead ends: 138 [2025-03-08 00:42:49,565 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 00:42:49,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3198 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1622, Invalid=9508, Unknown=0, NotChecked=0, Total=11130 [2025-03-08 00:42:49,566 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:49,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 139 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:42:49,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 00:42:49,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-08 00:42:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.105263157894737) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2025-03-08 00:42:49,583 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 78 [2025-03-08 00:42:49,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:49,583 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2025-03-08 00:42:49,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 2.326530612244898) internal successors, (228), 98 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:49,583 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2025-03-08 00:42:49,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 00:42:49,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:49,584 INFO L218 NwaCegarLoop]: trace histogram [19, 18, 13, 12, 12, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:49,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-03-08 00:42:49,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-08 00:42:49,784 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:49,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:49,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1253240471, now seen corresponding path program 25 times [2025-03-08 00:42:49,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:49,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282428003] [2025-03-08 00:42:49,785 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:42:49,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:49,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 00:42:49,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 00:42:49,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:49,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:50,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:50,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282428003] [2025-03-08 00:42:50,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282428003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:50,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003128665] [2025-03-08 00:42:50,536 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:42:50,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:50,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:50,542 INFO L229 MonitoredProcess]: Starting monitored process 32 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:42:50,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-08 00:42:50,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 00:42:50,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 00:42:50,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:50,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:50,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-03-08 00:42:50,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:51,244 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 15 treesize of output 1 [2025-03-08 00:42:51,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:51,281 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 29 treesize of output 13 [2025-03-08 00:42:51,831 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 17 treesize of output 9 [2025-03-08 00:42:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:51,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:52,447 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 23 treesize of output 21 [2025-03-08 00:42:52,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2025-03-08 00:42:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:53,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003128665] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:53,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:53,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 100 [2025-03-08 00:42:53,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164402180] [2025-03-08 00:42:53,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:53,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2025-03-08 00:42:53,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:53,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2025-03-08 00:42:53,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=9563, Unknown=0, NotChecked=0, Total=9900 [2025-03-08 00:42:53,144 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 100 states, 100 states have (on average 2.35) internal successors, (235), 100 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:54,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:54,419 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2025-03-08 00:42:54,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-08 00:42:54,419 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 100 states have (on average 2.35) internal successors, (235), 100 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-08 00:42:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:54,420 INFO L225 Difference]: With dead ends: 102 [2025-03-08 00:42:54,420 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 00:42:54,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2730 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=499, Invalid=12611, Unknown=0, NotChecked=0, Total=13110 [2025-03-08 00:42:54,420 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 154 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 3407 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 3410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:54,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 850 Invalid, 3410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3407 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 00:42:54,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 00:42:54,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-03-08 00:42:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.1020408163265305) internal successors, (108), 98 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:54,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2025-03-08 00:42:54,435 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 80 [2025-03-08 00:42:54,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:54,435 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2025-03-08 00:42:54,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 2.35) internal successors, (235), 100 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2025-03-08 00:42:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 00:42:54,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:54,436 INFO L218 NwaCegarLoop]: trace histogram [19, 18, 14, 13, 13, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:54,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-03-08 00:42:54,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:54,636 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:54,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:54,637 INFO L85 PathProgramCache]: Analyzing trace with hash 864705378, now seen corresponding path program 26 times [2025-03-08 00:42:54,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:54,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863839597] [2025-03-08 00:42:54,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:54,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:54,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-08 00:42:54,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 00:42:54,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:54,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 234 proven. 368 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:55,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:55,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863839597] [2025-03-08 00:42:55,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863839597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:55,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336779013] [2025-03-08 00:42:55,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:55,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:55,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:55,600 INFO L229 MonitoredProcess]: Starting monitored process 33 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:42:55,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-08 00:42:55,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-08 00:42:55,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 00:42:55,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:55,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:55,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-03-08 00:42:55,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:56,175 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 23 treesize of output 1 [2025-03-08 00:42:57,055 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:42:57,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-08 00:42:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 247 proven. 355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:57,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:57,970 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 18 treesize of output 16 [2025-03-08 00:42:57,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-03-08 00:42:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 234 proven. 368 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:58,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336779013] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:58,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:58,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 102 [2025-03-08 00:42:58,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906110368] [2025-03-08 00:42:58,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:58,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2025-03-08 00:42:58,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:58,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2025-03-08 00:42:58,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1413, Invalid=8889, Unknown=0, NotChecked=0, Total=10302 [2025-03-08 00:42:58,881 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 102 states, 102 states have (on average 2.3823529411764706) internal successors, (243), 102 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:59,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:59,396 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2025-03-08 00:42:59,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 00:42:59,396 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 2.3823529411764706) internal successors, (243), 102 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-08 00:42:59,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:59,397 INFO L225 Difference]: With dead ends: 144 [2025-03-08 00:42:59,397 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 00:42:59,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3214 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1462, Invalid=9044, Unknown=0, NotChecked=0, Total=10506 [2025-03-08 00:42:59,397 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:59,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 198 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:42:59,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 00:42:59,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-08 00:42:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 98 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:59,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2025-03-08 00:42:59,412 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 83 [2025-03-08 00:42:59,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:59,412 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2025-03-08 00:42:59,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 2.3823529411764706) internal successors, (243), 102 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2025-03-08 00:42:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 00:42:59,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:59,413 INFO L218 NwaCegarLoop]: trace histogram [20, 19, 14, 13, 13, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:59,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-03-08 00:42:59,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:59,613 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:59,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:59,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1698261859, now seen corresponding path program 27 times [2025-03-08 00:42:59,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:59,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309256989] [2025-03-08 00:42:59,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:42:59,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:59,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 85 statements into 20 equivalence classes. [2025-03-08 00:42:59,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 00:42:59,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2025-03-08 00:42:59,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:00,482 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 0 proven. 640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:00,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:00,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309256989] [2025-03-08 00:43:00,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309256989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:00,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666407497] [2025-03-08 00:43:00,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:43:00,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:00,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:00,484 INFO L229 MonitoredProcess]: Starting monitored process 34 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:43:00,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-08 00:43:00,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 85 statements into 20 equivalence classes. [2025-03-08 00:43:01,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 00:43:01,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2025-03-08 00:43:01,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:01,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-03-08 00:43:01,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:01,689 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 19 treesize of output 1 [2025-03-08 00:43:01,728 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-08 00:43:01,728 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 1 case distinctions, treesize of input 35 treesize of output 15 [2025-03-08 00:43:02,208 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 21 treesize of output 9 [2025-03-08 00:43:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 0 proven. 640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:02,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:02,811 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 23 treesize of output 21 [2025-03-08 00:43:02,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-03-08 00:43:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 0 proven. 640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:03,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666407497] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:03,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:03,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 88 [2025-03-08 00:43:03,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397347608] [2025-03-08 00:43:03,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:03,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2025-03-08 00:43:03,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:03,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2025-03-08 00:43:03,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=7385, Unknown=0, NotChecked=0, Total=7656 [2025-03-08 00:43:03,509 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 88 states, 88 states have (on average 2.4431818181818183) internal successors, (215), 88 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:04,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:04,922 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2025-03-08 00:43:04,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 00:43:04,922 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 2.4431818181818183) internal successors, (215), 88 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-08 00:43:04,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:04,923 INFO L225 Difference]: With dead ends: 105 [2025-03-08 00:43:04,923 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 00:43:04,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1717 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=424, Invalid=10082, Unknown=0, NotChecked=0, Total=10506 [2025-03-08 00:43:04,924 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 159 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 3669 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 3672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:04,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 897 Invalid, 3672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3669 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 00:43:04,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 00:43:04,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-03-08 00:43:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.0891089108910892) internal successors, (110), 101 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2025-03-08 00:43:04,939 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 85 [2025-03-08 00:43:04,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:04,939 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2025-03-08 00:43:04,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 2.4431818181818183) internal successors, (215), 88 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:04,940 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2025-03-08 00:43:04,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 00:43:04,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:04,940 INFO L218 NwaCegarLoop]: trace histogram [20, 19, 15, 14, 14, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:04,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-03-08 00:43:05,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-08 00:43:05,140 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:05,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:05,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1794832600, now seen corresponding path program 28 times [2025-03-08 00:43:05,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:05,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246945882] [2025-03-08 00:43:05,141 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:43:05,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:05,150 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 88 statements into 2 equivalence classes. [2025-03-08 00:43:05,172 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 00:43:05,172 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:43:05,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat