./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-78.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 ce36ae11817d8408b28b87366201df9141e6e75d787dae6b6223431c24a32438 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:21:50,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:21:50,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:21:50,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:21:50,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:21:50,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:21:50,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:21:50,427 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:21:50,427 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:21:50,427 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:21:50,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:21:50,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:21:50,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:21:50,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:21:50,428 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:21:50,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:21:50,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:21:50,428 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:21:50,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:21:50,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:21:50,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:21:50,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:21:50,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:21:50,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:21:50,429 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:21:50,429 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:21:50,429 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:21:50,429 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:21:50,429 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:21:50,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:21:50,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:21:50,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:21:50,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:21:50,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:21:50,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:21:50,430 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:21:50,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:21:50,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:21:50,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:21:50,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:21:50,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:21:50,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:21:50,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:21:50,430 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-jdk21/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 -> ce36ae11817d8408b28b87366201df9141e6e75d787dae6b6223431c24a32438 [2025-02-06 02:21:50,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:21:50,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:21:50,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:21:50,640 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:21:50,640 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:21:50,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-78.i [2025-02-06 02:21:51,821 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79c223d65/3c21a9198fc946678ff3caf45dafa540/FLAG76ac3c96a [2025-02-06 02:21:52,157 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:21:52,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-78.i [2025-02-06 02:21:52,164 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79c223d65/3c21a9198fc946678ff3caf45dafa540/FLAG76ac3c96a [2025-02-06 02:21:52,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79c223d65/3c21a9198fc946678ff3caf45dafa540 [2025-02-06 02:21:52,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:21:52,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:21:52,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:21:52,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:21:52,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:21:52,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:21:52" (1/1) ... [2025-02-06 02:21:52,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf311e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:52, skipping insertion in model container [2025-02-06 02:21:52,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:21:52" (1/1) ... [2025-02-06 02:21:52,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:21:52,310 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-78.i[916,929] [2025-02-06 02:21:52,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:21:52,464 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:21:52,472 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-78.i[916,929] [2025-02-06 02:21:52,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:21:52,552 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:21:52,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:52 WrapperNode [2025-02-06 02:21:52,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:21:52,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:21:52,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:21:52,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:21:52,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:52" (1/1) ... [2025-02-06 02:21:52,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:52" (1/1) ... [2025-02-06 02:21:52,637 INFO L138 Inliner]: procedures = 26, calls = 69, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2025-02-06 02:21:52,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:21:52,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:21:52,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:21:52,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:21:52,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:52" (1/1) ... [2025-02-06 02:21:52,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:52" (1/1) ... [2025-02-06 02:21:52,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:52" (1/1) ... [2025-02-06 02:21:52,701 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:21:52,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:52" (1/1) ... [2025-02-06 02:21:52,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:52" (1/1) ... [2025-02-06 02:21:52,728 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:52" (1/1) ... [2025-02-06 02:21:52,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:52" (1/1) ... [2025-02-06 02:21:52,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:52" (1/1) ... [2025-02-06 02:21:52,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:52" (1/1) ... [2025-02-06 02:21:52,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:21:52,768 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:21:52,768 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:21:52,768 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:21:52,769 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:52" (1/1) ... [2025-02-06 02:21:52,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:21:52,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:21:52,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:21:52,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:21:52,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:21:52,814 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:21:52,814 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:21:52,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:21:52,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:21:52,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:21:52,902 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:21:52,904 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:21:53,604 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L384: havoc property_#t~bitwise40#1;havoc property_#t~short41#1;havoc property_#t~bitwise42#1;havoc property_#t~short43#1;havoc property_#t~ite45#1;havoc property_#t~bitwise44#1;havoc property_#t~short46#1;havoc property_#t~bitwise47#1;havoc property_#t~short48#1; [2025-02-06 02:21:53,696 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-02-06 02:21:53,696 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:21:53,719 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:21:53,720 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:21:53,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:21:53 BoogieIcfgContainer [2025-02-06 02:21:53,720 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:21:53,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:21:53,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:21:53,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:21:53,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:21:52" (1/3) ... [2025-02-06 02:21:53,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e7531d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:21:53, skipping insertion in model container [2025-02-06 02:21:53,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:21:52" (2/3) ... [2025-02-06 02:21:53,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e7531d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:21:53, skipping insertion in model container [2025-02-06 02:21:53,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:21:53" (3/3) ... [2025-02-06 02:21:53,727 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-78.i [2025-02-06 02:21:53,736 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:21:53,739 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-78.i that has 2 procedures, 201 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:21:53,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:21:53,793 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;@14c236ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:21:53,794 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:21:53,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 143 states have internal predecessors, (215), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 02:21:53,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-02-06 02:21:53,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:21:53,813 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:21:53,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:21:53,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:21:53,818 INFO L85 PathProgramCache]: Analyzing trace with hash 2118246385, now seen corresponding path program 1 times [2025-02-06 02:21:53,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:21:53,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968202628] [2025-02-06 02:21:53,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:21:53,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:21:53,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-02-06 02:21:53,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-02-06 02:21:53,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:21:53,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:21:54,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-02-06 02:21:54,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:21:54,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968202628] [2025-02-06 02:21:54,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968202628] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:21:54,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616691682] [2025-02-06 02:21:54,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:21:54,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:21:54,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:21:54,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:21:54,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:21:54,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-02-06 02:21:54,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-02-06 02:21:54,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:21:54,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:21:54,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:21:54,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:21:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-02-06 02:21:54,533 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:21:54,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616691682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:21:54,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:21:54,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:21:54,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790415185] [2025-02-06 02:21:54,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:21:54,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:21:54,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:21:54,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:21:54,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:21:54,566 INFO L87 Difference]: Start difference. First operand has 201 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 143 states have internal predecessors, (215), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-02-06 02:21:54,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:21:54,611 INFO L93 Difference]: Finished difference Result 396 states and 705 transitions. [2025-02-06 02:21:54,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:21:54,612 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) Word has length 365 [2025-02-06 02:21:54,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:21:54,620 INFO L225 Difference]: With dead ends: 396 [2025-02-06 02:21:54,620 INFO L226 Difference]: Without dead ends: 198 [2025-02-06 02:21:54,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:21:54,626 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:21:54,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 314 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:21:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-06 02:21:54,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-02-06 02:21:54,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 140 states have (on average 1.5) internal successors, (210), 140 states have internal predecessors, (210), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 02:21:54,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 322 transitions. [2025-02-06 02:21:54,669 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 322 transitions. Word has length 365 [2025-02-06 02:21:54,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:21:54,669 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 322 transitions. [2025-02-06 02:21:54,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-02-06 02:21:54,670 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 322 transitions. [2025-02-06 02:21:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-02-06 02:21:54,674 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:21:54,674 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:21:54,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:21:54,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:21:54,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:21:54,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:21:54,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1703932465, now seen corresponding path program 1 times [2025-02-06 02:21:54,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:21:54,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011466541] [2025-02-06 02:21:54,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:21:54,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:21:54,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-02-06 02:21:54,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-02-06 02:21:54,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:21:54,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:21:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:21:55,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:21:55,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011466541] [2025-02-06 02:21:55,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011466541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:21:55,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:21:55,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:21:55,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701228381] [2025-02-06 02:21:55,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:21:55,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:21:55,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:21:55,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:21:55,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:21:55,219 INFO L87 Difference]: Start difference. First operand 198 states and 322 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:21:55,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:21:55,364 INFO L93 Difference]: Finished difference Result 585 states and 954 transitions. [2025-02-06 02:21:55,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:21:55,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 365 [2025-02-06 02:21:55,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:21:55,371 INFO L225 Difference]: With dead ends: 585 [2025-02-06 02:21:55,371 INFO L226 Difference]: Without dead ends: 390 [2025-02-06 02:21:55,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:21:55,374 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 297 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:21:55,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 624 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:21:55,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-02-06 02:21:55,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 386. [2025-02-06 02:21:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 271 states have (on average 1.4612546125461254) internal successors, (396), 271 states have internal predecessors, (396), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 02:21:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 620 transitions. [2025-02-06 02:21:55,432 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 620 transitions. Word has length 365 [2025-02-06 02:21:55,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:21:55,434 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 620 transitions. [2025-02-06 02:21:55,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:21:55,434 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 620 transitions. [2025-02-06 02:21:55,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-02-06 02:21:55,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:21:55,440 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:21:55,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:21:55,440 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:21:55,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:21:55,441 INFO L85 PathProgramCache]: Analyzing trace with hash -554022116, now seen corresponding path program 1 times [2025-02-06 02:21:55,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:21:55,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371059968] [2025-02-06 02:21:55,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:21:55,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:21:55,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-02-06 02:21:55,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-02-06 02:21:55,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:21:55,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:21:55,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:21:55,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:21:55,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371059968] [2025-02-06 02:21:55,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371059968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:21:55,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:21:55,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:21:55,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795024163] [2025-02-06 02:21:55,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:21:55,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:21:55,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:21:55,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:21:55,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:21:55,691 INFO L87 Difference]: Start difference. First operand 386 states and 620 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:21:55,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:21:55,840 INFO L93 Difference]: Finished difference Result 779 states and 1253 transitions. [2025-02-06 02:21:55,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:21:55,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 366 [2025-02-06 02:21:55,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:21:55,846 INFO L225 Difference]: With dead ends: 779 [2025-02-06 02:21:55,846 INFO L226 Difference]: Without dead ends: 396 [2025-02-06 02:21:55,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:21:55,849 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 281 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:21:55,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 754 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:21:55,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-02-06 02:21:55,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 392. [2025-02-06 02:21:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 277 states have (on average 1.44043321299639) internal successors, (399), 277 states have internal predecessors, (399), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 02:21:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 623 transitions. [2025-02-06 02:21:55,904 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 623 transitions. Word has length 366 [2025-02-06 02:21:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:21:55,905 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 623 transitions. [2025-02-06 02:21:55,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:21:55,905 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 623 transitions. [2025-02-06 02:21:55,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-02-06 02:21:55,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:21:55,931 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:21:55,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:21:55,932 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:21:55,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:21:55,932 INFO L85 PathProgramCache]: Analyzing trace with hash -962846341, now seen corresponding path program 1 times [2025-02-06 02:21:55,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:21:55,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192465515] [2025-02-06 02:21:55,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:21:55,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:21:55,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-02-06 02:21:56,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-02-06 02:21:56,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:21:56,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:21:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:21:56,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:21:56,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192465515] [2025-02-06 02:21:56,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192465515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:21:56,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:21:56,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:21:56,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854341053] [2025-02-06 02:21:56,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:21:56,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:21:56,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:21:56,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:21:56,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:21:56,846 INFO L87 Difference]: Start difference. First operand 392 states and 623 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:21:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:21:57,569 INFO L93 Difference]: Finished difference Result 1422 states and 2257 transitions. [2025-02-06 02:21:57,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:21:57,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 366 [2025-02-06 02:21:57,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:21:57,576 INFO L225 Difference]: With dead ends: 1422 [2025-02-06 02:21:57,576 INFO L226 Difference]: Without dead ends: 1033 [2025-02-06 02:21:57,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:21:57,578 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 1062 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:21:57,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 1552 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:21:57,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2025-02-06 02:21:57,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 771. [2025-02-06 02:21:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 550 states have (on average 1.4363636363636363) internal successors, (790), 551 states have internal predecessors, (790), 216 states have call successors, (216), 4 states have call predecessors, (216), 4 states have return successors, (216), 215 states have call predecessors, (216), 216 states have call successors, (216) [2025-02-06 02:21:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1222 transitions. [2025-02-06 02:21:57,645 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1222 transitions. Word has length 366 [2025-02-06 02:21:57,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:21:57,646 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1222 transitions. [2025-02-06 02:21:57,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:21:57,646 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1222 transitions. [2025-02-06 02:21:57,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-02-06 02:21:57,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:21:57,649 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:21:57,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:21:57,649 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:21:57,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:21:57,650 INFO L85 PathProgramCache]: Analyzing trace with hash 648746571, now seen corresponding path program 1 times [2025-02-06 02:21:57,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:21:57,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404615165] [2025-02-06 02:21:57,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:21:57,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:21:57,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-02-06 02:21:57,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-02-06 02:21:57,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:21:57,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:21:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:21:58,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:21:58,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404615165] [2025-02-06 02:21:58,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404615165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:21:58,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:21:58,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:21:58,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115898636] [2025-02-06 02:21:58,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:21:58,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:21:58,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:21:58,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:21:58,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:21:58,328 INFO L87 Difference]: Start difference. First operand 771 states and 1222 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:21:58,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:21:58,679 INFO L93 Difference]: Finished difference Result 2835 states and 4486 transitions. [2025-02-06 02:21:58,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:21:58,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 367 [2025-02-06 02:21:58,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:21:58,691 INFO L225 Difference]: With dead ends: 2835 [2025-02-06 02:21:58,691 INFO L226 Difference]: Without dead ends: 2067 [2025-02-06 02:21:58,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-02-06 02:21:58,694 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 526 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:21:58,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1130 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:21:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2025-02-06 02:21:58,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1619. [2025-02-06 02:21:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1234 states have (on average 1.46677471636953) internal successors, (1810), 1239 states have internal predecessors, (1810), 376 states have call successors, (376), 8 states have call predecessors, (376), 8 states have return successors, (376), 371 states have call predecessors, (376), 376 states have call successors, (376) [2025-02-06 02:21:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 2562 transitions. [2025-02-06 02:21:58,796 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 2562 transitions. Word has length 367 [2025-02-06 02:21:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:21:58,797 INFO L471 AbstractCegarLoop]: Abstraction has 1619 states and 2562 transitions. [2025-02-06 02:21:58,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:21:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 2562 transitions. [2025-02-06 02:21:58,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-02-06 02:21:58,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:21:58,800 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:21:58,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:21:58,800 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:21:58,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:21:58,800 INFO L85 PathProgramCache]: Analyzing trace with hash 408206442, now seen corresponding path program 1 times [2025-02-06 02:21:58,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:21:58,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737257498] [2025-02-06 02:21:58,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:21:58,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:21:58,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-02-06 02:21:58,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-02-06 02:21:58,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:21:58,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:21:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:21:59,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:21:59,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737257498] [2025-02-06 02:21:59,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737257498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:21:59,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:21:59,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:21:59,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745389820] [2025-02-06 02:21:59,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:21:59,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:21:59,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:21:59,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:21:59,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:21:59,132 INFO L87 Difference]: Start difference. First operand 1619 states and 2562 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:21:59,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:21:59,291 INFO L93 Difference]: Finished difference Result 4067 states and 6443 transitions. [2025-02-06 02:21:59,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:21:59,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 367 [2025-02-06 02:21:59,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:21:59,303 INFO L225 Difference]: With dead ends: 4067 [2025-02-06 02:21:59,303 INFO L226 Difference]: Without dead ends: 2451 [2025-02-06 02:21:59,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:21:59,307 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 214 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:21:59,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 755 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:21:59,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2025-02-06 02:21:59,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2449. [2025-02-06 02:21:59,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2449 states, 1803 states have (on average 1.442595673876872) internal successors, (2601), 1810 states have internal predecessors, (2601), 632 states have call successors, (632), 13 states have call predecessors, (632), 13 states have return successors, (632), 625 states have call predecessors, (632), 632 states have call successors, (632) [2025-02-06 02:21:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 3865 transitions. [2025-02-06 02:21:59,505 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 3865 transitions. Word has length 367 [2025-02-06 02:21:59,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:21:59,505 INFO L471 AbstractCegarLoop]: Abstraction has 2449 states and 3865 transitions. [2025-02-06 02:21:59,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:21:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 3865 transitions. [2025-02-06 02:21:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-02-06 02:21:59,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:21:59,509 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:21:59,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:21:59,509 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:21:59,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:21:59,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1684648220, now seen corresponding path program 1 times [2025-02-06 02:21:59,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:21:59,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752920385] [2025-02-06 02:21:59,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:21:59,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:21:59,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-02-06 02:21:59,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-02-06 02:21:59,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:21:59,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:21:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:21:59,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:21:59,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752920385] [2025-02-06 02:21:59,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752920385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:21:59,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:21:59,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:21:59,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985220245] [2025-02-06 02:21:59,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:21:59,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:21:59,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:21:59,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:21:59,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:21:59,779 INFO L87 Difference]: Start difference. First operand 2449 states and 3865 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:22:00,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:22:00,085 INFO L93 Difference]: Finished difference Result 6263 states and 9885 transitions. [2025-02-06 02:22:00,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:22:00,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 368 [2025-02-06 02:22:00,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:22:00,104 INFO L225 Difference]: With dead ends: 6263 [2025-02-06 02:22:00,104 INFO L226 Difference]: Without dead ends: 3885 [2025-02-06 02:22:00,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:22:00,110 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 196 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:22:00,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 715 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:22:00,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3885 states. [2025-02-06 02:22:00,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3885 to 3883. [2025-02-06 02:22:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3883 states, 2853 states have (on average 1.4332281808622502) internal successors, (4089), 2865 states have internal predecessors, (4089), 1008 states have call successors, (1008), 21 states have call predecessors, (1008), 21 states have return successors, (1008), 996 states have call predecessors, (1008), 1008 states have call successors, (1008) [2025-02-06 02:22:00,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 6105 transitions. [2025-02-06 02:22:00,444 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 6105 transitions. Word has length 368 [2025-02-06 02:22:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:22:00,445 INFO L471 AbstractCegarLoop]: Abstraction has 3883 states and 6105 transitions. [2025-02-06 02:22:00,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:22:00,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 6105 transitions. [2025-02-06 02:22:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-02-06 02:22:00,448 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:22:00,448 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:22:00,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:22:00,448 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:22:00,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:22:00,449 INFO L85 PathProgramCache]: Analyzing trace with hash 631197097, now seen corresponding path program 1 times [2025-02-06 02:22:00,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:22:00,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079087190] [2025-02-06 02:22:00,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:00,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:22:00,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-02-06 02:22:00,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-02-06 02:22:00,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:00,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:01,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-02-06 02:22:01,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:22:01,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079087190] [2025-02-06 02:22:01,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079087190] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:22:01,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334853375] [2025-02-06 02:22:01,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:01,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:22:01,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:22:01,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:22:01,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:22:01,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-02-06 02:22:01,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-02-06 02:22:01,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:01,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:01,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:22:01,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:22:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 1329 proven. 18 refuted. 0 times theorem prover too weak. 4813 trivial. 0 not checked. [2025-02-06 02:22:01,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:22:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 147 proven. 18 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-02-06 02:22:01,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334853375] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:22:01,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:22:01,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2025-02-06 02:22:01,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172765310] [2025-02-06 02:22:01,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:22:01,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 02:22:01,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:22:01,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 02:22:01,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:22:01,897 INFO L87 Difference]: Start difference. First operand 3883 states and 6105 transitions. Second operand has 12 states, 12 states have (on average 13.5) internal successors, (162), 12 states have internal predecessors, (162), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) [2025-02-06 02:22:03,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:22:03,393 INFO L93 Difference]: Finished difference Result 8134 states and 12711 transitions. [2025-02-06 02:22:03,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 02:22:03,394 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.5) internal successors, (162), 12 states have internal predecessors, (162), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) Word has length 368 [2025-02-06 02:22:03,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:22:03,416 INFO L225 Difference]: With dead ends: 8134 [2025-02-06 02:22:03,416 INFO L226 Difference]: Without dead ends: 4208 [2025-02-06 02:22:03,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 761 GetRequests, 737 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2025-02-06 02:22:03,426 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1038 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:22:03,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 1774 Invalid, 1827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 02:22:03,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4208 states. [2025-02-06 02:22:03,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4208 to 3421. [2025-02-06 02:22:03,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3421 states, 2595 states have (on average 1.4354527938342967) internal successors, (3725), 2602 states have internal predecessors, (3725), 784 states have call successors, (784), 41 states have call predecessors, (784), 41 states have return successors, (784), 777 states have call predecessors, (784), 784 states have call successors, (784) [2025-02-06 02:22:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3421 states to 3421 states and 5293 transitions. [2025-02-06 02:22:03,656 INFO L78 Accepts]: Start accepts. Automaton has 3421 states and 5293 transitions. Word has length 368 [2025-02-06 02:22:03,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:22:03,657 INFO L471 AbstractCegarLoop]: Abstraction has 3421 states and 5293 transitions. [2025-02-06 02:22:03,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.5) internal successors, (162), 12 states have internal predecessors, (162), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) [2025-02-06 02:22:03,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3421 states and 5293 transitions. [2025-02-06 02:22:03,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-02-06 02:22:03,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:22:03,659 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:22:03,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 02:22:03,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:22:03,861 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:22:03,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:22:03,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1516603290, now seen corresponding path program 1 times [2025-02-06 02:22:03,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:22:03,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982028256] [2025-02-06 02:22:03,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:03,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:22:03,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-02-06 02:22:04,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-02-06 02:22:04,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:04,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 6 proven. 159 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-02-06 02:22:04,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:22:04,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982028256] [2025-02-06 02:22:04,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982028256] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:22:04,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111243892] [2025-02-06 02:22:04,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:04,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:22:04,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:22:04,993 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:22:04,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:22:05,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-02-06 02:22:05,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-02-06 02:22:05,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:05,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:05,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 02:22:05,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:22:06,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2905 proven. 267 refuted. 0 times theorem prover too weak. 2988 trivial. 0 not checked. [2025-02-06 02:22:06,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:22:07,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111243892] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:22:07,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 02:22:07,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2025-02-06 02:22:07,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022825663] [2025-02-06 02:22:07,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 02:22:07,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 02:22:07,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:22:07,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 02:22:07,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-02-06 02:22:07,043 INFO L87 Difference]: Start difference. First operand 3421 states and 5293 transitions. Second operand has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 6 states have call successors, (109), 4 states have call predecessors, (109), 6 states have return successors, (109), 6 states have call predecessors, (109), 6 states have call successors, (109) [2025-02-06 02:22:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:22:09,408 INFO L93 Difference]: Finished difference Result 14503 states and 21770 transitions. [2025-02-06 02:22:09,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-06 02:22:09,409 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 6 states have call successors, (109), 4 states have call predecessors, (109), 6 states have return successors, (109), 6 states have call predecessors, (109), 6 states have call successors, (109) Word has length 369 [2025-02-06 02:22:09,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:22:09,448 INFO L225 Difference]: With dead ends: 14503 [2025-02-06 02:22:09,448 INFO L226 Difference]: Without dead ends: 11157 [2025-02-06 02:22:09,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=657, Invalid=1695, Unknown=0, NotChecked=0, Total=2352 [2025-02-06 02:22:09,459 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 1579 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1579 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:22:09,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1579 Valid, 1328 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 02:22:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11157 states. [2025-02-06 02:22:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11157 to 6421. [2025-02-06 02:22:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6421 states, 5454 states have (on average 1.4453612027869454) internal successors, (7883), 5476 states have internal predecessors, (7883), 814 states have call successors, (814), 152 states have call predecessors, (814), 152 states have return successors, (814), 792 states have call predecessors, (814), 814 states have call successors, (814) [2025-02-06 02:22:09,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6421 states to 6421 states and 9511 transitions. [2025-02-06 02:22:09,830 INFO L78 Accepts]: Start accepts. Automaton has 6421 states and 9511 transitions. Word has length 369 [2025-02-06 02:22:09,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:22:09,831 INFO L471 AbstractCegarLoop]: Abstraction has 6421 states and 9511 transitions. [2025-02-06 02:22:09,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 6 states have call successors, (109), 4 states have call predecessors, (109), 6 states have return successors, (109), 6 states have call predecessors, (109), 6 states have call successors, (109) [2025-02-06 02:22:09,832 INFO L276 IsEmpty]: Start isEmpty. Operand 6421 states and 9511 transitions. [2025-02-06 02:22:09,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-02-06 02:22:09,839 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:22:09,839 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:22:09,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 02:22:10,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:22:10,041 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:22:10,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:22:10,041 INFO L85 PathProgramCache]: Analyzing trace with hash 711408938, now seen corresponding path program 1 times [2025-02-06 02:22:10,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:22:10,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877129268] [2025-02-06 02:22:10,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:10,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:22:10,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-02-06 02:22:10,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-02-06 02:22:10,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:10,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 6 proven. 159 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-02-06 02:22:10,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:22:10,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877129268] [2025-02-06 02:22:10,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877129268] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:22:10,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193733847] [2025-02-06 02:22:10,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:10,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:22:10,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:22:10,834 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:22:10,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 02:22:10,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-02-06 02:22:11,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-02-06 02:22:11,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:11,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:11,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 02:22:11,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:22:13,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3689 proven. 804 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2025-02-06 02:22:13,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:22:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 132 proven. 510 refuted. 0 times theorem prover too weak. 5518 trivial. 0 not checked. [2025-02-06 02:22:15,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193733847] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:22:15,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:22:15,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 25, 17] total 45 [2025-02-06 02:22:15,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795685669] [2025-02-06 02:22:15,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:22:15,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-06 02:22:15,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:22:15,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-06 02:22:15,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=1526, Unknown=0, NotChecked=0, Total=1980 [2025-02-06 02:22:15,570 INFO L87 Difference]: Start difference. First operand 6421 states and 9511 transitions. Second operand has 45 states, 43 states have (on average 6.27906976744186) internal successors, (270), 41 states have internal predecessors, (270), 15 states have call successors, (162), 8 states have call predecessors, (162), 16 states have return successors, (163), 15 states have call predecessors, (163), 15 states have call successors, (163) [2025-02-06 02:22:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:22:23,339 INFO L93 Difference]: Finished difference Result 28444 states and 40847 transitions. [2025-02-06 02:22:23,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2025-02-06 02:22:23,341 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 6.27906976744186) internal successors, (270), 41 states have internal predecessors, (270), 15 states have call successors, (162), 8 states have call predecessors, (162), 16 states have return successors, (163), 15 states have call predecessors, (163), 15 states have call successors, (163) Word has length 370 [2025-02-06 02:22:23,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:22:23,383 INFO L225 Difference]: With dead ends: 28444 [2025-02-06 02:22:23,384 INFO L226 Difference]: Without dead ends: 22122 [2025-02-06 02:22:23,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 727 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7549 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5350, Invalid=17906, Unknown=0, NotChecked=0, Total=23256 [2025-02-06 02:22:23,397 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 3053 mSDsluCounter, 2610 mSDsCounter, 0 mSdLazyCounter, 4753 mSolverCounterSat, 746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3053 SdHoareTripleChecker+Valid, 2912 SdHoareTripleChecker+Invalid, 5499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 746 IncrementalHoareTripleChecker+Valid, 4753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:22:23,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3053 Valid, 2912 Invalid, 5499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [746 Valid, 4753 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-06 02:22:23,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22122 states. [2025-02-06 02:22:24,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22122 to 9806. [2025-02-06 02:22:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9806 states, 7842 states have (on average 1.3889313950522826) internal successors, (10892), 7873 states have internal predecessors, (10892), 1546 states have call successors, (1546), 417 states have call predecessors, (1546), 417 states have return successors, (1546), 1515 states have call predecessors, (1546), 1546 states have call successors, (1546) [2025-02-06 02:22:24,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9806 states to 9806 states and 13984 transitions. [2025-02-06 02:22:24,572 INFO L78 Accepts]: Start accepts. Automaton has 9806 states and 13984 transitions. Word has length 370 [2025-02-06 02:22:24,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:22:24,572 INFO L471 AbstractCegarLoop]: Abstraction has 9806 states and 13984 transitions. [2025-02-06 02:22:24,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 6.27906976744186) internal successors, (270), 41 states have internal predecessors, (270), 15 states have call successors, (162), 8 states have call predecessors, (162), 16 states have return successors, (163), 15 states have call predecessors, (163), 15 states have call successors, (163) [2025-02-06 02:22:24,573 INFO L276 IsEmpty]: Start isEmpty. Operand 9806 states and 13984 transitions. [2025-02-06 02:22:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-02-06 02:22:24,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:22:24,577 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:22:24,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 02:22:24,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 02:22:24,781 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:22:24,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:22:24,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1831968804, now seen corresponding path program 1 times [2025-02-06 02:22:24,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:22:24,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849690803] [2025-02-06 02:22:24,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:24,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:22:24,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-02-06 02:22:24,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-02-06 02:22:24,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:24,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:22:25,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:22:25,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849690803] [2025-02-06 02:22:25,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849690803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:22:25,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:22:25,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:22:25,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849641965] [2025-02-06 02:22:25,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:22:25,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:22:25,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:22:25,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:22:25,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:22:25,112 INFO L87 Difference]: Start difference. First operand 9806 states and 13984 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-02-06 02:22:27,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:22:27,698 INFO L93 Difference]: Finished difference Result 30610 states and 43793 transitions. [2025-02-06 02:22:27,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:22:27,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 371 [2025-02-06 02:22:27,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:22:27,762 INFO L225 Difference]: With dead ends: 30610 [2025-02-06 02:22:27,763 INFO L226 Difference]: Without dead ends: 24150 [2025-02-06 02:22:27,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:22:27,778 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 688 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:22:27,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 1330 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:22:27,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24150 states. [2025-02-06 02:22:29,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24150 to 24146. [2025-02-06 02:22:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24146 states, 19426 states have (on average 1.3934932564604139) internal successors, (27070), 19501 states have internal predecessors, (27070), 3714 states have call successors, (3714), 1005 states have call predecessors, (3714), 1005 states have return successors, (3714), 3639 states have call predecessors, (3714), 3714 states have call successors, (3714) [2025-02-06 02:22:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24146 states to 24146 states and 34498 transitions. [2025-02-06 02:22:29,631 INFO L78 Accepts]: Start accepts. Automaton has 24146 states and 34498 transitions. Word has length 371 [2025-02-06 02:22:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:22:29,632 INFO L471 AbstractCegarLoop]: Abstraction has 24146 states and 34498 transitions. [2025-02-06 02:22:29,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-02-06 02:22:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 24146 states and 34498 transitions. [2025-02-06 02:22:29,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-02-06 02:22:29,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:22:29,637 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:22:29,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:22:29,637 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:22:29,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:22:29,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1538565797, now seen corresponding path program 1 times [2025-02-06 02:22:29,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:22:29,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821978176] [2025-02-06 02:22:29,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:29,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:22:29,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-02-06 02:22:29,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-02-06 02:22:29,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:29,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:30,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 81 proven. 243 refuted. 0 times theorem prover too weak. 5836 trivial. 0 not checked. [2025-02-06 02:22:30,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:22:30,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821978176] [2025-02-06 02:22:30,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821978176] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:22:30,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128386923] [2025-02-06 02:22:30,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:30,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:22:30,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:22:30,553 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:22:30,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 02:22:30,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-02-06 02:22:30,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-02-06 02:22:30,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:30,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:30,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 02:22:30,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:22:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3744 proven. 432 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-02-06 02:22:32,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:22:34,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 192 proven. 450 refuted. 0 times theorem prover too weak. 5518 trivial. 0 not checked. [2025-02-06 02:22:34,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128386923] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:22:34,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:22:34,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15] total 31 [2025-02-06 02:22:34,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373640067] [2025-02-06 02:22:34,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:22:34,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 02:22:34,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:22:34,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 02:22:34,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=661, Unknown=0, NotChecked=0, Total=930 [2025-02-06 02:22:34,144 INFO L87 Difference]: Start difference. First operand 24146 states and 34498 transitions. Second operand has 31 states, 30 states have (on average 7.233333333333333) internal successors, (217), 29 states have internal predecessors, (217), 11 states have call successors, (162), 5 states have call predecessors, (162), 12 states have return successors, (163), 11 states have call predecessors, (163), 11 states have call successors, (163) [2025-02-06 02:22:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:22:38,113 INFO L93 Difference]: Finished difference Result 60512 states and 86115 transitions. [2025-02-06 02:22:38,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 02:22:38,113 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 7.233333333333333) internal successors, (217), 29 states have internal predecessors, (217), 11 states have call successors, (162), 5 states have call predecessors, (162), 12 states have return successors, (163), 11 states have call predecessors, (163), 11 states have call successors, (163) Word has length 371 [2025-02-06 02:22:38,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:22:38,214 INFO L225 Difference]: With dead ends: 60512 [2025-02-06 02:22:38,214 INFO L226 Difference]: Without dead ends: 36481 [2025-02-06 02:22:38,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 725 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=665, Invalid=1405, Unknown=0, NotChecked=0, Total=2070 [2025-02-06 02:22:38,246 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 1039 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:22:38,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 1123 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 02:22:38,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36481 states. [2025-02-06 02:22:39,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36481 to 14294. [2025-02-06 02:22:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14294 states, 11863 states have (on average 1.3814380848014836) internal successors, (16388), 11880 states have internal predecessors, (16388), 1856 states have call successors, (1856), 574 states have call predecessors, (1856), 574 states have return successors, (1856), 1839 states have call predecessors, (1856), 1856 states have call successors, (1856) [2025-02-06 02:22:39,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14294 states to 14294 states and 20100 transitions. [2025-02-06 02:22:39,484 INFO L78 Accepts]: Start accepts. Automaton has 14294 states and 20100 transitions. Word has length 371 [2025-02-06 02:22:39,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:22:39,485 INFO L471 AbstractCegarLoop]: Abstraction has 14294 states and 20100 transitions. [2025-02-06 02:22:39,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 7.233333333333333) internal successors, (217), 29 states have internal predecessors, (217), 11 states have call successors, (162), 5 states have call predecessors, (162), 12 states have return successors, (163), 11 states have call predecessors, (163), 11 states have call successors, (163) [2025-02-06 02:22:39,485 INFO L276 IsEmpty]: Start isEmpty. Operand 14294 states and 20100 transitions. [2025-02-06 02:22:39,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-06 02:22:39,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:22:39,488 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:22:39,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 02:22:39,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 02:22:39,689 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:22:39,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:22:39,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1510162774, now seen corresponding path program 1 times [2025-02-06 02:22:39,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:22:39,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54402873] [2025-02-06 02:22:39,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:39,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:22:39,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-06 02:22:39,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-06 02:22:39,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:39,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 318 proven. 159 refuted. 0 times theorem prover too weak. 5683 trivial. 0 not checked. [2025-02-06 02:22:40,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:22:40,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54402873] [2025-02-06 02:22:40,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54402873] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:22:40,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018812284] [2025-02-06 02:22:40,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:22:40,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:22:40,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:22:40,510 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:22:40,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 02:22:40,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-06 02:22:40,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-06 02:22:40,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:22:40,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:22:40,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 02:22:40,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:22:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 4385 proven. 306 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2025-02-06 02:22:42,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:22:45,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 444 proven. 198 refuted. 0 times theorem prover too weak. 5518 trivial. 0 not checked. [2025-02-06 02:22:45,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018812284] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:22:45,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:22:45,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20, 17] total 41 [2025-02-06 02:22:45,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729496138] [2025-02-06 02:22:45,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:22:45,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-06 02:22:45,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:22:45,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-06 02:22:45,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1309, Unknown=0, NotChecked=0, Total=1640 [2025-02-06 02:22:45,037 INFO L87 Difference]: Start difference. First operand 14294 states and 20100 transitions. Second operand has 41 states, 38 states have (on average 6.2631578947368425) internal successors, (238), 36 states have internal predecessors, (238), 13 states have call successors, (125), 6 states have call predecessors, (125), 13 states have return successors, (127), 13 states have call predecessors, (127), 13 states have call successors, (127)