./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/eca-rers2012/Problem13_label11.c -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 63f4b5f458089380e8f0669a95e988a7b7ab051335671065e81323bd858af55a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:51:15,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:51:15,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:51:15,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:51:15,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:51:15,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:51:15,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:51:15,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:51:15,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:51:15,165 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:51:15,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:51:15,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:51:15,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:51:15,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:51:15,167 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:51:15,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:51:15,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:51:15,167 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:51:15,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:51:15,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:51:15,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:51:15,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:51:15,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:51:15,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:51:15,168 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:51:15,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:51:15,168 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:51:15,168 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:51:15,168 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:51:15,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:51:15,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:51:15,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:51:15,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:51:15,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:51:15,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:51:15,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:51:15,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:51:15,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:51:15,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:51:15,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:51:15,170 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:51:15,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:51:15,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:51:15,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:51:15,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:51:15,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:51:15,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:51:15,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:51:15,171 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 -> 63f4b5f458089380e8f0669a95e988a7b7ab051335671065e81323bd858af55a [2025-01-08 23:51:15,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:51:15,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:51:15,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:51:15,366 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:51:15,366 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:51:15,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label11.c [2025-01-08 23:51:16,545 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3091199c0/76c4f48b42be4c449d945a7563aab2d9/FLAGafb3d19fa [2025-01-08 23:51:17,037 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:51:17,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label11.c [2025-01-08 23:51:17,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3091199c0/76c4f48b42be4c449d945a7563aab2d9/FLAGafb3d19fa [2025-01-08 23:51:17,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3091199c0/76c4f48b42be4c449d945a7563aab2d9 [2025-01-08 23:51:17,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:51:17,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:51:17,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:51:17,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:51:17,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:51:17,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:51:17" (1/1) ... [2025-01-08 23:51:17,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f152dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:17, skipping insertion in model container [2025-01-08 23:51:17,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:51:17" (1/1) ... [2025-01-08 23:51:17,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:51:17,382 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/eca-rers2012/Problem13_label11.c[3906,3919] [2025-01-08 23:51:17,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:51:17,971 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:51:17,982 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/eca-rers2012/Problem13_label11.c[3906,3919] [2025-01-08 23:51:18,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:51:18,325 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:51:18,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:18 WrapperNode [2025-01-08 23:51:18,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:51:18,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:51:18,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:51:18,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:51:18,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:18" (1/1) ... [2025-01-08 23:51:18,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:18" (1/1) ... [2025-01-08 23:51:18,729 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-01-08 23:51:18,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:51:18,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:51:18,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:51:18,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:51:18,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:18" (1/1) ... [2025-01-08 23:51:18,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:18" (1/1) ... [2025-01-08 23:51:18,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:18" (1/1) ... [2025-01-08 23:51:18,997 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-01-08 23:51:18,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:18" (1/1) ... [2025-01-08 23:51:18,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:18" (1/1) ... [2025-01-08 23:51:19,147 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:18" (1/1) ... [2025-01-08 23:51:19,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:18" (1/1) ... [2025-01-08 23:51:19,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:18" (1/1) ... [2025-01-08 23:51:19,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:18" (1/1) ... [2025-01-08 23:51:19,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:18" (1/1) ... [2025-01-08 23:51:19,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:51:19,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:51:19,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:51:19,289 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:51:19,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:18" (1/1) ... [2025-01-08 23:51:19,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:51:19,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:51:19,316 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-01-08 23:51:19,325 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-01-08 23:51:19,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:51:19,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:51:19,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:51:19,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:51:19,385 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:51:19,387 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:51:23,618 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-01-08 23:51:23,619 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:51:23,643 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:51:23,643 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:51:23,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:51:23 BoogieIcfgContainer [2025-01-08 23:51:23,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:51:23,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:51:23,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:51:23,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:51:23,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:51:17" (1/3) ... [2025-01-08 23:51:23,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435872bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:51:23, skipping insertion in model container [2025-01-08 23:51:23,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:18" (2/3) ... [2025-01-08 23:51:23,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435872bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:51:23, skipping insertion in model container [2025-01-08 23:51:23,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:51:23" (3/3) ... [2025-01-08 23:51:23,652 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label11.c [2025-01-08 23:51:23,663 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:51:23,665 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label11.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:51:23,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:51:23,738 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;@70c8c075, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:51:23,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:51:23,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:23,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 23:51:23,748 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:23,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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-01-08 23:51:23,749 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:23,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:23,752 INFO L85 PathProgramCache]: Analyzing trace with hash -406871462, now seen corresponding path program 1 times [2025-01-08 23:51:23,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:23,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956432530] [2025-01-08 23:51:23,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:23,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:23,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-08 23:51:23,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 23:51:23,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:23,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:23,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:23,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956432530] [2025-01-08 23:51:23,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956432530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:23,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:23,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:23,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153404656] [2025-01-08 23:51:23,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:23,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:23,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:23,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:23,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:23,945 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:28,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:28,049 INFO L93 Difference]: Finished difference Result 3160 states and 5840 transitions. [2025-01-08 23:51:28,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:28,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-08 23:51:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:28,079 INFO L225 Difference]: With dead ends: 3160 [2025-01-08 23:51:28,079 INFO L226 Difference]: Without dead ends: 1983 [2025-01-08 23:51:28,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-08 23:51:28,091 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 1077 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3030 mSolverCounterSat, 974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 4004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 3030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:28,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 345 Invalid, 4004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [974 Valid, 3030 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-08 23:51:28,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2025-01-08 23:51:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1930. [2025-01-08 23:51:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1929 states have (on average 1.7973043027475375) internal successors, (3467), 1929 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 3467 transitions. [2025-01-08 23:51:28,171 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 3467 transitions. Word has length 26 [2025-01-08 23:51:28,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:28,171 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 3467 transitions. [2025-01-08 23:51:28,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3467 transitions. [2025-01-08 23:51:28,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-08 23:51:28,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:28,173 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:51:28,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:51:28,173 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:28,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:28,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1517191517, now seen corresponding path program 1 times [2025-01-08 23:51:28,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:28,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279524713] [2025-01-08 23:51:28,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:28,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:28,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-08 23:51:28,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-08 23:51:28,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:28,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:28,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:28,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279524713] [2025-01-08 23:51:28,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279524713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:28,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:28,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:28,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241177315] [2025-01-08 23:51:28,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:28,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:28,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:28,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:28,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:28,397 INFO L87 Difference]: Start difference. First operand 1930 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:31,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:31,471 INFO L93 Difference]: Finished difference Result 5456 states and 9917 transitions. [2025-01-08 23:51:31,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:31,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-01-08 23:51:31,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:31,483 INFO L225 Difference]: With dead ends: 5456 [2025-01-08 23:51:31,483 INFO L226 Difference]: Without dead ends: 3528 [2025-01-08 23:51:31,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-08 23:51:31,488 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 923 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 3187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:31,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1010 Invalid, 3187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-08 23:51:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2025-01-08 23:51:31,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3526. [2025-01-08 23:51:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 3525 states have (on average 1.5670921985815602) internal successors, (5524), 3525 states have internal predecessors, (5524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5524 transitions. [2025-01-08 23:51:31,547 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5524 transitions. Word has length 91 [2025-01-08 23:51:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:31,548 INFO L471 AbstractCegarLoop]: Abstraction has 3526 states and 5524 transitions. [2025-01-08 23:51:31,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:31,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5524 transitions. [2025-01-08 23:51:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-08 23:51:31,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:31,553 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:51:31,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:51:31,553 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:31,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:31,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1772546418, now seen corresponding path program 1 times [2025-01-08 23:51:31,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:31,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218005823] [2025-01-08 23:51:31,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:31,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:31,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-08 23:51:31,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-08 23:51:31,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:31,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:31,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:31,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218005823] [2025-01-08 23:51:31,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218005823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:31,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:31,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:31,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206046045] [2025-01-08 23:51:31,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:31,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:31,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:31,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:31,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:31,730 INFO L87 Difference]: Start difference. First operand 3526 states and 5524 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:34,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:34,976 INFO L93 Difference]: Finished difference Result 10232 states and 16097 transitions. [2025-01-08 23:51:34,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:34,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-01-08 23:51:34,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:34,993 INFO L225 Difference]: With dead ends: 10232 [2025-01-08 23:51:34,993 INFO L226 Difference]: Without dead ends: 6708 [2025-01-08 23:51:34,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-08 23:51:34,999 INFO L435 NwaCegarLoop]: 1005 mSDtfsCounter, 869 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2634 mSolverCounterSat, 724 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 3358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 724 IncrementalHoareTripleChecker+Valid, 2634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:34,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 1138 Invalid, 3358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [724 Valid, 2634 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-08 23:51:35,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6708 states. [2025-01-08 23:51:35,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6708 to 6700. [2025-01-08 23:51:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6700 states, 6699 states have (on average 1.413046723391551) internal successors, (9466), 6699 states have internal predecessors, (9466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6700 states to 6700 states and 9466 transitions. [2025-01-08 23:51:35,084 INFO L78 Accepts]: Start accepts. Automaton has 6700 states and 9466 transitions. Word has length 97 [2025-01-08 23:51:35,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:35,086 INFO L471 AbstractCegarLoop]: Abstraction has 6700 states and 9466 transitions. [2025-01-08 23:51:35,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:35,086 INFO L276 IsEmpty]: Start isEmpty. Operand 6700 states and 9466 transitions. [2025-01-08 23:51:35,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-08 23:51:35,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:35,090 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:51:35,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:51:35,090 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:35,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:35,092 INFO L85 PathProgramCache]: Analyzing trace with hash 456128643, now seen corresponding path program 1 times [2025-01-08 23:51:35,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:35,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652443541] [2025-01-08 23:51:35,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:35,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:35,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-08 23:51:35,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-08 23:51:35,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:35,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:35,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:35,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652443541] [2025-01-08 23:51:35,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652443541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:35,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:35,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:35,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298712542] [2025-01-08 23:51:35,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:35,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:35,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:35,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:35,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:35,262 INFO L87 Difference]: Start difference. First operand 6700 states and 9466 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:38,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:38,148 INFO L93 Difference]: Finished difference Result 17443 states and 24479 transitions. [2025-01-08 23:51:38,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:38,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-01-08 23:51:38,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:38,172 INFO L225 Difference]: With dead ends: 17443 [2025-01-08 23:51:38,173 INFO L226 Difference]: Without dead ends: 10745 [2025-01-08 23:51:38,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-08 23:51:38,181 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 851 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 3121 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 3613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 3121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:38,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 686 Invalid, 3613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 3121 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:51:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10745 states. [2025-01-08 23:51:38,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10745 to 10669. [2025-01-08 23:51:38,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3562992125984252) internal successors, (14469), 10668 states have internal predecessors, (14469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14469 transitions. [2025-01-08 23:51:38,536 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14469 transitions. Word has length 127 [2025-01-08 23:51:38,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:38,537 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14469 transitions. [2025-01-08 23:51:38,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14469 transitions. [2025-01-08 23:51:38,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-08 23:51:38,541 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:38,541 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:51:38,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:51:38,541 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:38,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:38,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1695223978, now seen corresponding path program 1 times [2025-01-08 23:51:38,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:38,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883313664] [2025-01-08 23:51:38,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:38,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:38,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-08 23:51:38,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-08 23:51:38,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:38,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:39,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:39,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883313664] [2025-01-08 23:51:39,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883313664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:39,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:39,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:39,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375798341] [2025-01-08 23:51:39,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:39,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:39,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:39,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:39,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:39,016 INFO L87 Difference]: Start difference. First operand 10669 states and 14469 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:41,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:41,467 INFO L93 Difference]: Finished difference Result 20549 states and 28119 transitions. [2025-01-08 23:51:41,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:41,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2025-01-08 23:51:41,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:41,496 INFO L225 Difference]: With dead ends: 20549 [2025-01-08 23:51:41,496 INFO L226 Difference]: Without dead ends: 10669 [2025-01-08 23:51:41,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-08 23:51:41,503 INFO L435 NwaCegarLoop]: 1083 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:41,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1212 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:51:41,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10669 states. [2025-01-08 23:51:41,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10669 to 10669. [2025-01-08 23:51:41,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3539557555305586) internal successors, (14444), 10668 states have internal predecessors, (14444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:41,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14444 transitions. [2025-01-08 23:51:41,612 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14444 transitions. Word has length 137 [2025-01-08 23:51:41,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:41,612 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14444 transitions. [2025-01-08 23:51:41,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:41,612 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14444 transitions. [2025-01-08 23:51:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-08 23:51:41,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:41,614 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:51:41,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:51:41,614 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:41,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:41,614 INFO L85 PathProgramCache]: Analyzing trace with hash -925831328, now seen corresponding path program 1 times [2025-01-08 23:51:41,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:41,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719445840] [2025-01-08 23:51:41,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:41,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:41,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-08 23:51:41,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-08 23:51:41,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:41,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-08 23:51:41,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:41,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719445840] [2025-01-08 23:51:41,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719445840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:41,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:41,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:41,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910245140] [2025-01-08 23:51:41,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:41,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:41,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:41,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:41,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:41,738 INFO L87 Difference]: Start difference. First operand 10669 states and 14444 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:44,752 INFO L93 Difference]: Finished difference Result 30031 states and 41217 transitions. [2025-01-08 23:51:44,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:44,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2025-01-08 23:51:44,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:44,778 INFO L225 Difference]: With dead ends: 30031 [2025-01-08 23:51:44,778 INFO L226 Difference]: Without dead ends: 20151 [2025-01-08 23:51:44,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-08 23:51:44,785 INFO L435 NwaCegarLoop]: 1013 mSDtfsCounter, 751 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 783 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 3274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 783 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:44,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1163 Invalid, 3274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [783 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:51:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20151 states. [2025-01-08 23:51:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20151 to 19337. [2025-01-08 23:51:44,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19337 states, 19336 states have (on average 1.24244931733554) internal successors, (24024), 19336 states have internal predecessors, (24024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19337 states to 19337 states and 24024 transitions. [2025-01-08 23:51:44,967 INFO L78 Accepts]: Start accepts. Automaton has 19337 states and 24024 transitions. Word has length 151 [2025-01-08 23:51:44,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:44,967 INFO L471 AbstractCegarLoop]: Abstraction has 19337 states and 24024 transitions. [2025-01-08 23:51:44,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:44,968 INFO L276 IsEmpty]: Start isEmpty. Operand 19337 states and 24024 transitions. [2025-01-08 23:51:44,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-01-08 23:51:44,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:44,970 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:51:44,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:51:44,971 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:44,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:44,971 INFO L85 PathProgramCache]: Analyzing trace with hash 741739519, now seen corresponding path program 1 times [2025-01-08 23:51:44,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:44,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179559220] [2025-01-08 23:51:44,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:44,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:44,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-08 23:51:45,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-08 23:51:45,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:45,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 117 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:45,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:45,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179559220] [2025-01-08 23:51:45,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179559220] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:51:45,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211432829] [2025-01-08 23:51:45,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:45,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:51:45,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:51:45,466 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-01-08 23:51:45,470 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-01-08 23:51:45,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-08 23:51:45,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-08 23:51:45,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:45,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:45,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:51:45,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:51:45,937 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:45,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:51:45,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211432829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:45,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:51:45,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:51:45,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098968444] [2025-01-08 23:51:45,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:45,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:45,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:45,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:45,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:51:45,941 INFO L87 Difference]: Start difference. First operand 19337 states and 24024 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:48,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:48,842 INFO L93 Difference]: Finished difference Result 55202 states and 69089 transitions. [2025-01-08 23:51:48,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:48,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2025-01-08 23:51:48,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:48,894 INFO L225 Difference]: With dead ends: 55202 [2025-01-08 23:51:48,894 INFO L226 Difference]: Without dead ends: 36654 [2025-01-08 23:51:48,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:51:48,914 INFO L435 NwaCegarLoop]: 1012 mSDtfsCounter, 727 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 2502 mSolverCounterSat, 765 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 3267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 765 IncrementalHoareTripleChecker+Valid, 2502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:48,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1185 Invalid, 3267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [765 Valid, 2502 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:51:48,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36654 states. [2025-01-08 23:51:49,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36654 to 35867. [2025-01-08 23:51:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35867 states, 35866 states have (on average 1.1654770534768304) internal successors, (41801), 35866 states have internal predecessors, (41801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35867 states to 35867 states and 41801 transitions. [2025-01-08 23:51:49,380 INFO L78 Accepts]: Start accepts. Automaton has 35867 states and 41801 transitions. Word has length 238 [2025-01-08 23:51:49,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:49,381 INFO L471 AbstractCegarLoop]: Abstraction has 35867 states and 41801 transitions. [2025-01-08 23:51:49,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 35867 states and 41801 transitions. [2025-01-08 23:51:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-01-08 23:51:49,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:49,388 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:51:49,395 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-01-08 23:51:49,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:51:49,588 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:49,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:49,589 INFO L85 PathProgramCache]: Analyzing trace with hash 368821258, now seen corresponding path program 1 times [2025-01-08 23:51:49,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:49,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931291600] [2025-01-08 23:51:49,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:49,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:49,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-01-08 23:51:49,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-01-08 23:51:49,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:49,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:49,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:49,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931291600] [2025-01-08 23:51:49,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931291600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:49,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:49,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:51:49,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482606846] [2025-01-08 23:51:49,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:49,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:49,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:49,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:49,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:49,757 INFO L87 Difference]: Start difference. First operand 35867 states and 41801 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:53,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:53,136 INFO L93 Difference]: Finished difference Result 89849 states and 106398 transitions. [2025-01-08 23:51:53,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:53,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2025-01-08 23:51:53,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:53,220 INFO L225 Difference]: With dead ends: 89849 [2025-01-08 23:51:53,220 INFO L226 Difference]: Without dead ends: 54771 [2025-01-08 23:51:53,249 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-01-08 23:51:53,249 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 830 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 908 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 3297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 908 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:53,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 950 Invalid, 3297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [908 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-08 23:51:53,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54771 states. [2025-01-08 23:51:53,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54771 to 53186. [2025-01-08 23:51:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53186 states, 53185 states have (on average 1.1506063739776253) internal successors, (61195), 53185 states have internal predecessors, (61195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:53,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53186 states to 53186 states and 61195 transitions. [2025-01-08 23:51:53,912 INFO L78 Accepts]: Start accepts. Automaton has 53186 states and 61195 transitions. Word has length 253 [2025-01-08 23:51:53,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:53,912 INFO L471 AbstractCegarLoop]: Abstraction has 53186 states and 61195 transitions. [2025-01-08 23:51:53,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:53,913 INFO L276 IsEmpty]: Start isEmpty. Operand 53186 states and 61195 transitions. [2025-01-08 23:51:53,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-01-08 23:51:53,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:53,916 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:51:53,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:51:53,917 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:53,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:53,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2132552140, now seen corresponding path program 1 times [2025-01-08 23:51:53,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:53,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920021340] [2025-01-08 23:51:53,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:53,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:53,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-01-08 23:51:53,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-01-08 23:51:53,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:53,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-08 23:51:54,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:54,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920021340] [2025-01-08 23:51:54,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920021340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:54,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:54,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:51:54,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936629884] [2025-01-08 23:51:54,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:54,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:51:54,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:54,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:51:54,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:51:54,096 INFO L87 Difference]: Start difference. First operand 53186 states and 61195 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:00,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:00,595 INFO L93 Difference]: Finished difference Result 145164 states and 168684 transitions. [2025-01-08 23:52:00,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:52:00,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 314 [2025-01-08 23:52:00,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:00,696 INFO L225 Difference]: With dead ends: 145164 [2025-01-08 23:52:00,696 INFO L226 Difference]: Without dead ends: 92767 [2025-01-08 23:52:00,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-01-08 23:52:00,733 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 1716 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 6349 mSolverCounterSat, 1049 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1716 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 7398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1049 IncrementalHoareTripleChecker+Valid, 6349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:00,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1716 Valid, 1027 Invalid, 7398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1049 Valid, 6349 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-01-08 23:52:00,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92767 states. [2025-01-08 23:52:01,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92767 to 69731. [2025-01-08 23:52:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69731 states, 69730 states have (on average 1.1356374587695397) internal successors, (79188), 69730 states have internal predecessors, (79188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69731 states to 69731 states and 79188 transitions. [2025-01-08 23:52:01,755 INFO L78 Accepts]: Start accepts. Automaton has 69731 states and 79188 transitions. Word has length 314 [2025-01-08 23:52:01,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:01,755 INFO L471 AbstractCegarLoop]: Abstraction has 69731 states and 79188 transitions. [2025-01-08 23:52:01,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 69731 states and 79188 transitions. [2025-01-08 23:52:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-01-08 23:52:01,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:01,759 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:01,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:52:01,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:01,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:01,760 INFO L85 PathProgramCache]: Analyzing trace with hash 488507795, now seen corresponding path program 1 times [2025-01-08 23:52:01,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:01,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288546619] [2025-01-08 23:52:01,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:01,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:01,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-01-08 23:52:01,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-01-08 23:52:01,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:01,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 176 proven. 113 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-08 23:52:02,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:02,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288546619] [2025-01-08 23:52:02,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288546619] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:52:02,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442190960] [2025-01-08 23:52:02,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:02,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:02,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:52:02,785 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-01-08 23:52:02,786 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-01-08 23:52:02,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-01-08 23:52:02,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-01-08 23:52:02,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:02,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:02,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:52:02,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:52:03,121 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-08 23:52:03,122 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:52:03,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442190960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:03,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:52:03,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-01-08 23:52:03,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693345502] [2025-01-08 23:52:03,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:03,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:03,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:03,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:03,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:52:03,123 INFO L87 Difference]: Start difference. First operand 69731 states and 79188 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:06,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:06,504 INFO L93 Difference]: Finished difference Result 191586 states and 218803 transitions. [2025-01-08 23:52:06,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:06,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 332 [2025-01-08 23:52:06,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:06,630 INFO L225 Difference]: With dead ends: 191586 [2025-01-08 23:52:06,630 INFO L226 Difference]: Without dead ends: 122644 [2025-01-08 23:52:06,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:52:06,665 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 1075 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 538 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 3173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 538 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:06,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 925 Invalid, 3173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [538 Valid, 2635 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:52:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122644 states. [2025-01-08 23:52:07,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122644 to 122615. [2025-01-08 23:52:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122615 states, 122614 states have (on average 1.1194724909064218) internal successors, (137263), 122614 states have internal predecessors, (137263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122615 states to 122615 states and 137263 transitions. [2025-01-08 23:52:08,029 INFO L78 Accepts]: Start accepts. Automaton has 122615 states and 137263 transitions. Word has length 332 [2025-01-08 23:52:08,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:08,031 INFO L471 AbstractCegarLoop]: Abstraction has 122615 states and 137263 transitions. [2025-01-08 23:52:08,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:08,031 INFO L276 IsEmpty]: Start isEmpty. Operand 122615 states and 137263 transitions. [2025-01-08 23:52:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-01-08 23:52:08,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:08,043 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:08,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:52:08,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:08,243 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:08,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:08,247 INFO L85 PathProgramCache]: Analyzing trace with hash 80148906, now seen corresponding path program 1 times [2025-01-08 23:52:08,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:08,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590159842] [2025-01-08 23:52:08,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:08,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:08,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-01-08 23:52:08,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-01-08 23:52:08,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:08,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-08 23:52:08,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:08,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590159842] [2025-01-08 23:52:08,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590159842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:08,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:08,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:08,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963591028] [2025-01-08 23:52:08,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:08,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:08,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:08,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:08,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:08,844 INFO L87 Difference]: Start difference. First operand 122615 states and 137263 transitions. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:12,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:12,281 INFO L93 Difference]: Finished difference Result 237174 states and 265863 transitions. [2025-01-08 23:52:12,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:12,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 371 [2025-01-08 23:52:12,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:12,422 INFO L225 Difference]: With dead ends: 237174 [2025-01-08 23:52:12,422 INFO L226 Difference]: Without dead ends: 105895 [2025-01-08 23:52:12,489 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-01-08 23:52:12,489 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 1036 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:12,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1641 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:52:12,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105895 states. [2025-01-08 23:52:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105895 to 98802. [2025-01-08 23:52:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98802 states, 98801 states have (on average 1.0907177052863837) internal successors, (107764), 98801 states have internal predecessors, (107764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98802 states to 98802 states and 107764 transitions. [2025-01-08 23:52:13,834 INFO L78 Accepts]: Start accepts. Automaton has 98802 states and 107764 transitions. Word has length 371 [2025-01-08 23:52:13,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:13,834 INFO L471 AbstractCegarLoop]: Abstraction has 98802 states and 107764 transitions. [2025-01-08 23:52:13,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:13,834 INFO L276 IsEmpty]: Start isEmpty. Operand 98802 states and 107764 transitions. [2025-01-08 23:52:13,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-01-08 23:52:13,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:13,845 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:13,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:52:13,846 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:13,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:13,846 INFO L85 PathProgramCache]: Analyzing trace with hash -240755884, now seen corresponding path program 1 times [2025-01-08 23:52:13,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:13,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410820299] [2025-01-08 23:52:13,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:13,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:13,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-01-08 23:52:13,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-01-08 23:52:13,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:13,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 270 proven. 113 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-08 23:52:15,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:15,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410820299] [2025-01-08 23:52:15,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410820299] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:52:15,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805407252] [2025-01-08 23:52:15,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:15,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:15,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:52:15,209 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-01-08 23:52:15,210 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-01-08 23:52:15,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-01-08 23:52:15,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-01-08 23:52:15,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:15,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:15,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:52:15,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:52:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-01-08 23:52:15,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:52:15,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805407252] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:15,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:52:15,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-01-08 23:52:15,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434333314] [2025-01-08 23:52:15,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:15,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:15,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:15,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:15,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:52:15,598 INFO L87 Difference]: Start difference. First operand 98802 states and 107764 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:18,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:18,920 INFO L93 Difference]: Finished difference Result 196813 states and 214733 transitions. [2025-01-08 23:52:18,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:18,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 381 [2025-01-08 23:52:18,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:19,035 INFO L225 Difference]: With dead ends: 196813 [2025-01-08 23:52:19,035 INFO L226 Difference]: Without dead ends: 98800 [2025-01-08 23:52:19,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:52:19,068 INFO L435 NwaCegarLoop]: 1326 mSDtfsCounter, 1081 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 2825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:19,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 1403 Invalid, 2825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 2387 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:52:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98800 states. [2025-01-08 23:52:19,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98800 to 98012. [2025-01-08 23:52:19,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98012 states, 98011 states have (on average 1.071767454673455) internal successors, (105045), 98011 states have internal predecessors, (105045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98012 states to 98012 states and 105045 transitions. [2025-01-08 23:52:19,967 INFO L78 Accepts]: Start accepts. Automaton has 98012 states and 105045 transitions. Word has length 381 [2025-01-08 23:52:19,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:19,967 INFO L471 AbstractCegarLoop]: Abstraction has 98012 states and 105045 transitions. [2025-01-08 23:52:19,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 98012 states and 105045 transitions. [2025-01-08 23:52:19,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-01-08 23:52:19,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:19,970 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:19,977 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-01-08 23:52:20,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:20,171 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:20,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:20,172 INFO L85 PathProgramCache]: Analyzing trace with hash -701695809, now seen corresponding path program 1 times [2025-01-08 23:52:20,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:20,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758195195] [2025-01-08 23:52:20,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:20,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:20,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-01-08 23:52:20,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-01-08 23:52:20,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:20,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-01-08 23:52:20,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:20,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758195195] [2025-01-08 23:52:20,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758195195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:20,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:20,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:20,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066832371] [2025-01-08 23:52:20,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:20,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:20,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:20,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:20,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:20,294 INFO L87 Difference]: Start difference. First operand 98012 states and 105045 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:23,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:23,875 INFO L93 Difference]: Finished difference Result 226728 states and 244418 transitions. [2025-01-08 23:52:23,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:23,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 382 [2025-01-08 23:52:23,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:24,194 INFO L225 Difference]: With dead ends: 226728 [2025-01-08 23:52:24,194 INFO L226 Difference]: Without dead ends: 129505 [2025-01-08 23:52:24,223 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-01-08 23:52:24,224 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 887 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2368 mSolverCounterSat, 897 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 897 IncrementalHoareTripleChecker+Valid, 2368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:24,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 837 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [897 Valid, 2368 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-08 23:52:24,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129505 states. [2025-01-08 23:52:25,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129505 to 127915. [2025-01-08 23:52:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127915 states, 127914 states have (on average 1.0739872101568242) internal successors, (137378), 127914 states have internal predecessors, (137378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127915 states to 127915 states and 137378 transitions. [2025-01-08 23:52:25,301 INFO L78 Accepts]: Start accepts. Automaton has 127915 states and 137378 transitions. Word has length 382 [2025-01-08 23:52:25,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:25,301 INFO L471 AbstractCegarLoop]: Abstraction has 127915 states and 137378 transitions. [2025-01-08 23:52:25,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 127915 states and 137378 transitions. [2025-01-08 23:52:25,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-01-08 23:52:25,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:25,308 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:25,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:52:25,308 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:25,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:25,309 INFO L85 PathProgramCache]: Analyzing trace with hash -2025975176, now seen corresponding path program 1 times [2025-01-08 23:52:25,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:25,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063808828] [2025-01-08 23:52:25,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:25,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:25,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-01-08 23:52:25,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-01-08 23:52:25,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:25,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:25,694 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:52:25,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:25,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063808828] [2025-01-08 23:52:25,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063808828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:25,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:25,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:25,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132428600] [2025-01-08 23:52:25,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:25,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:25,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:25,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:25,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:25,696 INFO L87 Difference]: Start difference. First operand 127915 states and 137378 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:29,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:29,870 INFO L93 Difference]: Finished difference Result 283388 states and 305881 transitions. [2025-01-08 23:52:29,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:29,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 474 [2025-01-08 23:52:29,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:30,027 INFO L225 Difference]: With dead ends: 283388 [2025-01-08 23:52:30,027 INFO L226 Difference]: Without dead ends: 155475 [2025-01-08 23:52:30,068 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-01-08 23:52:30,069 INFO L435 NwaCegarLoop]: 1712 mSDtfsCounter, 730 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2488 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 3161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 2488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:30,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1849 Invalid, 3161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 2488 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-08 23:52:30,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155475 states. [2025-01-08 23:52:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155475 to 153884. [2025-01-08 23:52:31,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153884 states, 153883 states have (on average 1.0644125731887213) internal successors, (163795), 153883 states have internal predecessors, (163795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153884 states to 153884 states and 163795 transitions. [2025-01-08 23:52:31,743 INFO L78 Accepts]: Start accepts. Automaton has 153884 states and 163795 transitions. Word has length 474 [2025-01-08 23:52:31,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:31,743 INFO L471 AbstractCegarLoop]: Abstraction has 153884 states and 163795 transitions. [2025-01-08 23:52:31,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 153884 states and 163795 transitions. [2025-01-08 23:52:31,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2025-01-08 23:52:31,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:31,753 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:52:31,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:52:31,753 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:31,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:31,753 INFO L85 PathProgramCache]: Analyzing trace with hash 449476592, now seen corresponding path program 1 times [2025-01-08 23:52:31,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:31,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127130092] [2025-01-08 23:52:31,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:31,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:31,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes. [2025-01-08 23:52:31,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements. [2025-01-08 23:52:31,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:31,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:31,895 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2025-01-08 23:52:31,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:31,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127130092] [2025-01-08 23:52:31,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127130092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:31,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:31,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:52:31,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338640212] [2025-01-08 23:52:31,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:31,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:31,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:31,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:31,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:31,897 INFO L87 Difference]: Start difference. First operand 153884 states and 163795 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:33,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:33,940 INFO L93 Difference]: Finished difference Result 305389 states and 325077 transitions. [2025-01-08 23:52:33,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:33,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 511 [2025-01-08 23:52:33,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:34,092 INFO L225 Difference]: With dead ends: 305389 [2025-01-08 23:52:34,093 INFO L226 Difference]: Without dead ends: 152291 [2025-01-08 23:52:34,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-08 23:52:34,161 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 1601 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:34,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1601 Valid, 289 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-08 23:52:34,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152291 states. [2025-01-08 23:52:35,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152291 to 152291. [2025-01-08 23:52:35,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152291 states, 152290 states have (on average 1.0638781272572067) internal successors, (162018), 152290 states have internal predecessors, (162018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152291 states to 152291 states and 162018 transitions. [2025-01-08 23:52:36,179 INFO L78 Accepts]: Start accepts. Automaton has 152291 states and 162018 transitions. Word has length 511 [2025-01-08 23:52:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:36,180 INFO L471 AbstractCegarLoop]: Abstraction has 152291 states and 162018 transitions. [2025-01-08 23:52:36,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:36,180 INFO L276 IsEmpty]: Start isEmpty. Operand 152291 states and 162018 transitions. [2025-01-08 23:52:36,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-01-08 23:52:36,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:36,192 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:52:36,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:52:36,192 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:36,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:36,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1640280090, now seen corresponding path program 1 times [2025-01-08 23:52:36,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:36,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227278120] [2025-01-08 23:52:36,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:36,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:36,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-01-08 23:52:36,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-01-08 23:52:36,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:36,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:52:36,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:36,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227278120] [2025-01-08 23:52:36,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227278120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:36,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:36,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:36,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671346989] [2025-01-08 23:52:36,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:36,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:36,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:36,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:36,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:36,807 INFO L87 Difference]: Start difference. First operand 152291 states and 162018 transitions. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:40,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:40,282 INFO L93 Difference]: Finished difference Result 304585 states and 324092 transitions. [2025-01-08 23:52:40,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:40,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 525 [2025-01-08 23:52:40,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:40,461 INFO L225 Difference]: With dead ends: 304585 [2025-01-08 23:52:40,461 INFO L226 Difference]: Without dead ends: 153083 [2025-01-08 23:52:40,546 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-01-08 23:52:40,547 INFO L435 NwaCegarLoop]: 1741 mSDtfsCounter, 610 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:40,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1868 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:52:40,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153083 states. [2025-01-08 23:52:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153083 to 153078. [2025-01-08 23:52:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153078 states, 153077 states have (on average 1.0637783599103718) internal successors, (162840), 153077 states have internal predecessors, (162840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153078 states to 153078 states and 162840 transitions. [2025-01-08 23:52:42,415 INFO L78 Accepts]: Start accepts. Automaton has 153078 states and 162840 transitions. Word has length 525 [2025-01-08 23:52:42,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:42,416 INFO L471 AbstractCegarLoop]: Abstraction has 153078 states and 162840 transitions. [2025-01-08 23:52:42,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:42,416 INFO L276 IsEmpty]: Start isEmpty. Operand 153078 states and 162840 transitions. [2025-01-08 23:52:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-01-08 23:52:42,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:42,432 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:52:42,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:52:42,432 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:42,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:42,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2113925886, now seen corresponding path program 1 times [2025-01-08 23:52:42,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:42,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333440721] [2025-01-08 23:52:42,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:42,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:42,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-01-08 23:52:42,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-01-08 23:52:42,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:42,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 359 proven. 110 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-08 23:52:43,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:43,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333440721] [2025-01-08 23:52:43,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333440721] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:52:43,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265084794] [2025-01-08 23:52:43,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:43,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:43,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:52:43,459 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-01-08 23:52:43,461 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-01-08 23:52:43,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-01-08 23:52:43,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-01-08 23:52:43,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:43,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:43,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:52:43,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:52:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-01-08 23:52:43,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:52:43,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265084794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:43,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:52:43,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:52:43,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462776476] [2025-01-08 23:52:43,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:43,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:43,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:43,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:43,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:52:43,772 INFO L87 Difference]: Start difference. First operand 153078 states and 162840 transitions. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)