./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label23.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label23.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 fd73ab074a990e2fba4a8f87029e18649db9146d39c1908dcf3532d41f095922 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:49:19,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:49:19,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:49:19,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:49:19,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:49:19,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:49:19,161 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:49:19,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:49:19,162 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:49:19,162 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:49:19,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:49:19,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:49:19,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:49:19,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:49:19,164 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:49:19,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:49:19,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:49:19,164 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:49:19,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:49:19,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:49:19,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:49:19,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:49:19,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:49:19,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:49:19,165 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:49:19,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:49:19,165 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:49:19,165 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:49:19,166 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:49:19,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:49:19,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:49:19,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:49:19,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:49:19,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:49:19,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:49:19,167 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:49:19,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:49:19,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:49:19,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:49:19,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:49:19,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:49:19,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:49:19,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:49:19,167 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 -> fd73ab074a990e2fba4a8f87029e18649db9146d39c1908dcf3532d41f095922 [2025-02-05 11:49:19,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:49:19,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:49:19,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:49:19,470 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:49:19,471 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:49:19,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label23.c [2025-02-05 11:49:20,721 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8b2cf316/cd80ad500c9a4ec2972844bfdf549dc7/FLAG51054da8c [2025-02-05 11:49:21,054 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:49:21,059 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label23.c [2025-02-05 11:49:21,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8b2cf316/cd80ad500c9a4ec2972844bfdf549dc7/FLAG51054da8c [2025-02-05 11:49:21,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8b2cf316/cd80ad500c9a4ec2972844bfdf549dc7 [2025-02-05 11:49:21,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:49:21,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:49:21,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:49:21,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:49:21,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:49:21,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:49:21" (1/1) ... [2025-02-05 11:49:21,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3466a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:21, skipping insertion in model container [2025-02-05 11:49:21,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:49:21" (1/1) ... [2025-02-05 11:49:21,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:49:21,317 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/Problem14_label23.c[3423,3436] [2025-02-05 11:49:21,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:49:21,489 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:49:21,510 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/Problem14_label23.c[3423,3436] [2025-02-05 11:49:21,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:49:21,628 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:49:21,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:21 WrapperNode [2025-02-05 11:49:21,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:49:21,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:49:21,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:49:21,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:49:21,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:21" (1/1) ... [2025-02-05 11:49:21,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:21" (1/1) ... [2025-02-05 11:49:21,730 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-02-05 11:49:21,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:49:21,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:49:21,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:49:21,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:49:21,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:21" (1/1) ... [2025-02-05 11:49:21,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:21" (1/1) ... [2025-02-05 11:49:21,752 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:21" (1/1) ... [2025-02-05 11:49:21,793 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 11:49:21,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:21" (1/1) ... [2025-02-05 11:49:21,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:21" (1/1) ... [2025-02-05 11:49:21,819 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:21" (1/1) ... [2025-02-05 11:49:21,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:21" (1/1) ... [2025-02-05 11:49:21,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:21" (1/1) ... [2025-02-05 11:49:21,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:21" (1/1) ... [2025-02-05 11:49:21,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:49:21,846 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:49:21,846 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:49:21,846 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:49:21,850 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:21" (1/1) ... [2025-02-05 11:49:21,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:49:21,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:21,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:49:21,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:49:21,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:49:21,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:49:21,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:49:21,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:49:21,986 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:49:21,988 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:49:23,469 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-02-05 11:49:23,469 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:49:23,491 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:49:23,492 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:49:23,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:49:23 BoogieIcfgContainer [2025-02-05 11:49:23,492 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:49:23,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:49:23,497 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:49:23,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:49:23,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:49:21" (1/3) ... [2025-02-05 11:49:23,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c22ee7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:49:23, skipping insertion in model container [2025-02-05 11:49:23,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:21" (2/3) ... [2025-02-05 11:49:23,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c22ee7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:49:23, skipping insertion in model container [2025-02-05 11:49:23,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:49:23" (3/3) ... [2025-02-05 11:49:23,504 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label23.c [2025-02-05 11:49:23,518 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:49:23,519 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label23.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:49:23,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:49:23,584 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;@7ce87d39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:49:23,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:49:23,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 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-02-05 11:49:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-05 11:49:23,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:23,595 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, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:23,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:23,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:23,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1176233769, now seen corresponding path program 1 times [2025-02-05 11:49:23,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:23,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322934055] [2025-02-05 11:49:23,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:23,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:23,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 11:49:23,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 11:49:23,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:23,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:49:23,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:23,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322934055] [2025-02-05 11:49:23,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322934055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:23,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:23,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:49:23,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65130346] [2025-02-05 11:49:23,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:23,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:23,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:23,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:23,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:23,935 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 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 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 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-02-05 11:49:24,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:24,896 INFO L93 Difference]: Finished difference Result 669 states and 1197 transitions. [2025-02-05 11:49:24,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:24,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 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 32 [2025-02-05 11:49:24,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:24,910 INFO L225 Difference]: With dead ends: 669 [2025-02-05 11:49:24,911 INFO L226 Difference]: Without dead ends: 360 [2025-02-05 11:49:24,914 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-02-05 11:49:24,918 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 174 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:24,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 77 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:49:24,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-02-05 11:49:24,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-02-05 11:49:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.6378830083565459) internal successors, (588), 359 states have internal predecessors, (588), 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-02-05 11:49:24,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 588 transitions. [2025-02-05 11:49:24,964 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 588 transitions. Word has length 32 [2025-02-05 11:49:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:24,964 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 588 transitions. [2025-02-05 11:49:24,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 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-02-05 11:49:24,965 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 588 transitions. [2025-02-05 11:49:24,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 11:49:24,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:24,967 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, 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-02-05 11:49:24,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:49:24,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:24,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:24,969 INFO L85 PathProgramCache]: Analyzing trace with hash 843342956, now seen corresponding path program 1 times [2025-02-05 11:49:24,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:24,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102333125] [2025-02-05 11:49:24,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:24,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:24,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 11:49:25,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 11:49:25,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:25,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:49:25,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:25,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102333125] [2025-02-05 11:49:25,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102333125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:25,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:25,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:49:25,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391948077] [2025-02-05 11:49:25,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:25,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:25,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:25,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:25,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:25,205 INFO L87 Difference]: Start difference. First operand 360 states and 588 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-02-05 11:49:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:25,914 INFO L93 Difference]: Finished difference Result 1076 states and 1760 transitions. [2025-02-05 11:49:25,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:25,914 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-02-05 11:49:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:25,918 INFO L225 Difference]: With dead ends: 1076 [2025-02-05 11:49:25,919 INFO L226 Difference]: Without dead ends: 718 [2025-02-05 11:49:25,920 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-02-05 11:49:25,921 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:25,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 88 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:49:25,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-02-05 11:49:25,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 716. [2025-02-05 11:49:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.4223776223776223) internal successors, (1017), 715 states have internal predecessors, (1017), 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-02-05 11:49:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1017 transitions. [2025-02-05 11:49:25,962 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1017 transitions. Word has length 97 [2025-02-05 11:49:25,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:25,963 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1017 transitions. [2025-02-05 11:49:25,963 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-02-05 11:49:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1017 transitions. [2025-02-05 11:49:25,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 11:49:25,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:25,965 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, 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] [2025-02-05 11:49:25,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:49:25,966 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:25,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:25,966 INFO L85 PathProgramCache]: Analyzing trace with hash -247923087, now seen corresponding path program 1 times [2025-02-05 11:49:25,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:25,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556381809] [2025-02-05 11:49:25,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:25,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:25,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 11:49:26,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 11:49:26,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:26,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:49:26,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:26,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556381809] [2025-02-05 11:49:26,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556381809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:26,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:26,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:49:26,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580474654] [2025-02-05 11:49:26,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:26,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:26,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:26,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:26,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:26,171 INFO L87 Difference]: Start difference. First operand 716 states and 1017 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:49:26,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:26,767 INFO L93 Difference]: Finished difference Result 1608 states and 2324 transitions. [2025-02-05 11:49:26,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:26,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-02-05 11:49:26,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:26,771 INFO L225 Difference]: With dead ends: 1608 [2025-02-05 11:49:26,771 INFO L226 Difference]: Without dead ends: 894 [2025-02-05 11:49:26,773 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-02-05 11:49:26,773 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:26,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 57 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:49:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-02-05 11:49:26,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2025-02-05 11:49:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.3314669652855544) internal successors, (1189), 893 states have internal predecessors, (1189), 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-02-05 11:49:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1189 transitions. [2025-02-05 11:49:26,801 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1189 transitions. Word has length 98 [2025-02-05 11:49:26,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:26,801 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1189 transitions. [2025-02-05 11:49:26,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:49:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1189 transitions. [2025-02-05 11:49:26,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 11:49:26,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:26,809 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, 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] [2025-02-05 11:49:26,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:49:26,809 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:26,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:26,812 INFO L85 PathProgramCache]: Analyzing trace with hash 712950050, now seen corresponding path program 1 times [2025-02-05 11:49:26,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:26,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935805920] [2025-02-05 11:49:26,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:26,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:26,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 11:49:26,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 11:49:26,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:26,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:27,148 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:49:27,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:27,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935805920] [2025-02-05 11:49:27,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935805920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:27,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:27,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:27,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569786906] [2025-02-05 11:49:27,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:27,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:49:27,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:27,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:49:27,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:49:27,151 INFO L87 Difference]: Start difference. First operand 894 states and 1189 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:49:28,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:28,099 INFO L93 Difference]: Finished difference Result 2144 states and 2782 transitions. [2025-02-05 11:49:28,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:49:28,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-02-05 11:49:28,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:28,105 INFO L225 Difference]: With dead ends: 2144 [2025-02-05 11:49:28,105 INFO L226 Difference]: Without dead ends: 1252 [2025-02-05 11:49:28,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:49:28,108 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 441 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:28,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 123 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:49:28,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2025-02-05 11:49:28,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1250. [2025-02-05 11:49:28,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.257005604483587) internal successors, (1570), 1249 states have internal predecessors, (1570), 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-02-05 11:49:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1570 transitions. [2025-02-05 11:49:28,138 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1570 transitions. Word has length 101 [2025-02-05 11:49:28,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:28,139 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1570 transitions. [2025-02-05 11:49:28,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:49:28,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1570 transitions. [2025-02-05 11:49:28,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 11:49:28,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:28,140 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, 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] [2025-02-05 11:49:28,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:49:28,141 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:28,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:28,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1631127502, now seen corresponding path program 1 times [2025-02-05 11:49:28,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:28,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582243907] [2025-02-05 11:49:28,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:28,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:28,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 11:49:28,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 11:49:28,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:28,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:49:28,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:28,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582243907] [2025-02-05 11:49:28,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582243907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:28,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:28,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:28,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665341617] [2025-02-05 11:49:28,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:28,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:49:28,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:28,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:49:28,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:49:28,390 INFO L87 Difference]: Start difference. First operand 1250 states and 1570 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 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-02-05 11:49:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:29,111 INFO L93 Difference]: Finished difference Result 2885 states and 3573 transitions. [2025-02-05 11:49:29,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:49:29,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 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 112 [2025-02-05 11:49:29,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:29,118 INFO L225 Difference]: With dead ends: 2885 [2025-02-05 11:49:29,119 INFO L226 Difference]: Without dead ends: 1608 [2025-02-05 11:49:29,121 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-02-05 11:49:29,124 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 103 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:29,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 123 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:49:29,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2025-02-05 11:49:29,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1606. [2025-02-05 11:49:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.1314641744548286) internal successors, (1816), 1605 states have internal predecessors, (1816), 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-02-05 11:49:29,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1816 transitions. [2025-02-05 11:49:29,167 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1816 transitions. Word has length 112 [2025-02-05 11:49:29,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:29,168 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1816 transitions. [2025-02-05 11:49:29,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 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-02-05 11:49:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1816 transitions. [2025-02-05 11:49:29,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-05 11:49:29,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:29,174 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:29,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:49:29,174 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:29,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:29,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1117907695, now seen corresponding path program 1 times [2025-02-05 11:49:29,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:29,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506426391] [2025-02-05 11:49:29,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:29,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:29,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 11:49:29,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 11:49:29,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:29,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:49:29,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:29,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506426391] [2025-02-05 11:49:29,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506426391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:29,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:29,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:29,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457089919] [2025-02-05 11:49:29,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:29,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:29,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:29,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:29,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:29,471 INFO L87 Difference]: Start difference. First operand 1606 states and 1816 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-02-05 11:49:30,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:30,033 INFO L93 Difference]: Finished difference Result 3922 states and 4494 transitions. [2025-02-05 11:49:30,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:30,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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 206 [2025-02-05 11:49:30,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:30,043 INFO L225 Difference]: With dead ends: 3922 [2025-02-05 11:49:30,044 INFO L226 Difference]: Without dead ends: 2318 [2025-02-05 11:49:30,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:30,048 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:30,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 77 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:49:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2025-02-05 11:49:30,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2140. [2025-02-05 11:49:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.1173445535296869) internal successors, (2390), 2139 states have internal predecessors, (2390), 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-02-05 11:49:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2390 transitions. [2025-02-05 11:49:30,098 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2390 transitions. Word has length 206 [2025-02-05 11:49:30,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:30,098 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2390 transitions. [2025-02-05 11:49:30,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-02-05 11:49:30,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2390 transitions. [2025-02-05 11:49:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-02-05 11:49:30,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:30,104 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, 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, 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] [2025-02-05 11:49:30,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:49:30,105 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:30,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:30,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1380898295, now seen corresponding path program 1 times [2025-02-05 11:49:30,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:30,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994263650] [2025-02-05 11:49:30,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:30,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:30,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-02-05 11:49:30,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-02-05 11:49:30,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:30,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:30,468 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-02-05 11:49:30,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:30,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994263650] [2025-02-05 11:49:30,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994263650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:30,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:30,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:30,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593378420] [2025-02-05 11:49:30,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:30,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:49:30,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:30,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:49:30,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:49:30,471 INFO L87 Difference]: Start difference. First operand 2140 states and 2390 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 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-02-05 11:49:31,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:31,093 INFO L93 Difference]: Finished difference Result 4336 states and 4860 transitions. [2025-02-05 11:49:31,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:49:31,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 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 323 [2025-02-05 11:49:31,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:31,102 INFO L225 Difference]: With dead ends: 4336 [2025-02-05 11:49:31,102 INFO L226 Difference]: Without dead ends: 2318 [2025-02-05 11:49:31,105 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-02-05 11:49:31,106 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 141 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:31,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 17 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:49:31,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2025-02-05 11:49:31,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2140. [2025-02-05 11:49:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.077606358111267) internal successors, (2305), 2139 states have internal predecessors, (2305), 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-02-05 11:49:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2305 transitions. [2025-02-05 11:49:31,167 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2305 transitions. Word has length 323 [2025-02-05 11:49:31,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:31,168 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2305 transitions. [2025-02-05 11:49:31,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 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-02-05 11:49:31,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2305 transitions. [2025-02-05 11:49:31,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2025-02-05 11:49:31,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:31,176 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, 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, 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] [2025-02-05 11:49:31,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:49:31,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:31,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:31,177 INFO L85 PathProgramCache]: Analyzing trace with hash -835845615, now seen corresponding path program 1 times [2025-02-05 11:49:31,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:31,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531159577] [2025-02-05 11:49:31,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:31,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:31,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-02-05 11:49:31,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-02-05 11:49:31,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:31,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-02-05 11:49:31,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:31,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531159577] [2025-02-05 11:49:31,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531159577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:31,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:31,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:31,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759590506] [2025-02-05 11:49:31,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:31,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:31,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:31,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:31,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:31,697 INFO L87 Difference]: Start difference. First operand 2140 states and 2305 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-02-05 11:49:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:32,221 INFO L93 Difference]: Finished difference Result 4456 states and 4866 transitions. [2025-02-05 11:49:32,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:32,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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 418 [2025-02-05 11:49:32,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:32,229 INFO L225 Difference]: With dead ends: 4456 [2025-02-05 11:49:32,230 INFO L226 Difference]: Without dead ends: 2496 [2025-02-05 11:49:32,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:32,256 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:32,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 244 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:49:32,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-02-05 11:49:32,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 1962. [2025-02-05 11:49:32,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.0775114737378888) internal successors, (2113), 1961 states have internal predecessors, (2113), 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-02-05 11:49:32,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2113 transitions. [2025-02-05 11:49:32,291 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2113 transitions. Word has length 418 [2025-02-05 11:49:32,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:32,292 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2113 transitions. [2025-02-05 11:49:32,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-02-05 11:49:32,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2113 transitions. [2025-02-05 11:49:32,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-02-05 11:49:32,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:32,300 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:32,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:49:32,302 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:32,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:32,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1459336480, now seen corresponding path program 1 times [2025-02-05 11:49:32,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:32,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828809872] [2025-02-05 11:49:32,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:32,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:32,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-02-05 11:49:32,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-02-05 11:49:32,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:32,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-02-05 11:49:32,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:32,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828809872] [2025-02-05 11:49:32,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828809872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:32,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:32,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:32,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798111909] [2025-02-05 11:49:32,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:32,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:32,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:32,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:32,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:32,766 INFO L87 Difference]: Start difference. First operand 1962 states and 2113 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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-02-05 11:49:33,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:33,263 INFO L93 Difference]: Finished difference Result 4278 states and 4685 transitions. [2025-02-05 11:49:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:33,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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 425 [2025-02-05 11:49:33,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:33,272 INFO L225 Difference]: With dead ends: 4278 [2025-02-05 11:49:33,272 INFO L226 Difference]: Without dead ends: 2496 [2025-02-05 11:49:33,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:33,276 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 113 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:33,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 220 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:49:33,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-02-05 11:49:33,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2140. [2025-02-05 11:49:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.0869565217391304) internal successors, (2325), 2139 states have internal predecessors, (2325), 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-02-05 11:49:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2325 transitions. [2025-02-05 11:49:33,320 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2325 transitions. Word has length 425 [2025-02-05 11:49:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:33,321 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2325 transitions. [2025-02-05 11:49:33,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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-02-05 11:49:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2325 transitions. [2025-02-05 11:49:33,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-02-05 11:49:33,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:33,339 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:33,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:49:33,339 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:33,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:33,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1876544827, now seen corresponding path program 1 times [2025-02-05 11:49:33,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:33,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671004960] [2025-02-05 11:49:33,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:33,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:33,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-02-05 11:49:33,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-02-05 11:49:33,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:33,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-02-05 11:49:33,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:33,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671004960] [2025-02-05 11:49:33,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671004960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:33,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:33,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:33,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589672664] [2025-02-05 11:49:33,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:33,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:33,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:33,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:33,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:33,693 INFO L87 Difference]: Start difference. First operand 2140 states and 2325 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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-02-05 11:49:34,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:34,229 INFO L93 Difference]: Finished difference Result 4990 states and 5478 transitions. [2025-02-05 11:49:34,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:34,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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 466 [2025-02-05 11:49:34,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:34,240 INFO L225 Difference]: With dead ends: 4990 [2025-02-05 11:49:34,240 INFO L226 Difference]: Without dead ends: 3030 [2025-02-05 11:49:34,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:34,243 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 74 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:34,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 50 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:49:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2025-02-05 11:49:34,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 3030. [2025-02-05 11:49:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3030 states, 3029 states have (on average 1.0822053482997689) internal successors, (3278), 3029 states have internal predecessors, (3278), 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-02-05 11:49:34,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3278 transitions. [2025-02-05 11:49:34,319 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3278 transitions. Word has length 466 [2025-02-05 11:49:34,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:34,320 INFO L471 AbstractCegarLoop]: Abstraction has 3030 states and 3278 transitions. [2025-02-05 11:49:34,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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-02-05 11:49:34,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3278 transitions. [2025-02-05 11:49:34,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-02-05 11:49:34,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:34,327 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, 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:34,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:49:34,328 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:34,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:34,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1402942835, now seen corresponding path program 1 times [2025-02-05 11:49:34,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:34,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509196089] [2025-02-05 11:49:34,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:34,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:34,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-02-05 11:49:34,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-02-05 11:49:34,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:34,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-02-05 11:49:34,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:34,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509196089] [2025-02-05 11:49:34,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509196089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:34,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:34,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:49:34,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317850477] [2025-02-05 11:49:34,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:34,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:49:34,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:34,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:49:34,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:49:34,843 INFO L87 Difference]: Start difference. First operand 3030 states and 3278 transitions. Second operand has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 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-02-05 11:49:35,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:35,646 INFO L93 Difference]: Finished difference Result 6414 states and 6952 transitions. [2025-02-05 11:49:35,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:49:35,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 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 502 [2025-02-05 11:49:35,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:35,659 INFO L225 Difference]: With dead ends: 6414 [2025-02-05 11:49:35,659 INFO L226 Difference]: Without dead ends: 3564 [2025-02-05 11:49:35,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:49:35,665 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 216 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:35,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 67 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:49:35,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2025-02-05 11:49:35,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3386. [2025-02-05 11:49:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.0729689807976366) internal successors, (3632), 3385 states have internal predecessors, (3632), 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-02-05 11:49:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3632 transitions. [2025-02-05 11:49:35,721 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3632 transitions. Word has length 502 [2025-02-05 11:49:35,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:35,723 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 3632 transitions. [2025-02-05 11:49:35,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 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-02-05 11:49:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3632 transitions. [2025-02-05 11:49:35,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2025-02-05 11:49:35,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:35,734 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, 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, 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, 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] [2025-02-05 11:49:35,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:49:35,734 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:35,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:35,735 INFO L85 PathProgramCache]: Analyzing trace with hash -927831216, now seen corresponding path program 1 times [2025-02-05 11:49:35,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:35,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523292571] [2025-02-05 11:49:35,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:35,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:35,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 580 statements into 1 equivalence classes. [2025-02-05 11:49:35,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 580 of 580 statements. [2025-02-05 11:49:35,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:35,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1061 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-02-05 11:49:36,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:36,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523292571] [2025-02-05 11:49:36,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523292571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:36,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:36,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:36,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836607724] [2025-02-05 11:49:36,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:36,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:36,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:36,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:36,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:36,240 INFO L87 Difference]: Start difference. First operand 3386 states and 3632 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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-02-05 11:49:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:36,780 INFO L93 Difference]: Finished difference Result 7126 states and 7723 transitions. [2025-02-05 11:49:36,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:36,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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 580 [2025-02-05 11:49:36,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:36,795 INFO L225 Difference]: With dead ends: 7126 [2025-02-05 11:49:36,795 INFO L226 Difference]: Without dead ends: 3920 [2025-02-05 11:49:36,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:36,801 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:36,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 227 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:49:36,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2025-02-05 11:49:36,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2025-02-05 11:49:36,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3741 states have (on average 1.0684309008286554) internal successors, (3997), 3741 states have internal predecessors, (3997), 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-02-05 11:49:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3997 transitions. [2025-02-05 11:49:36,876 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3997 transitions. Word has length 580 [2025-02-05 11:49:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:36,877 INFO L471 AbstractCegarLoop]: Abstraction has 3742 states and 3997 transitions. [2025-02-05 11:49:36,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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-02-05 11:49:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3997 transitions. [2025-02-05 11:49:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2025-02-05 11:49:36,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:36,882 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, 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, 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, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:36,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:49:36,883 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:36,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:36,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1508782741, now seen corresponding path program 1 times [2025-02-05 11:49:36,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:36,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917749003] [2025-02-05 11:49:36,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:36,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:36,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 621 statements into 1 equivalence classes. [2025-02-05 11:49:36,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 621 of 621 statements. [2025-02-05 11:49:36,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:36,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:37,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 792 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-02-05 11:49:37,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:37,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917749003] [2025-02-05 11:49:37,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917749003] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:37,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806273011] [2025-02-05 11:49:37,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:37,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:37,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:37,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:49:37,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:49:37,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 621 statements into 1 equivalence classes. [2025-02-05 11:49:37,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 621 of 621 statements. [2025-02-05 11:49:37,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:37,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:37,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:49:37,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2025-02-05 11:49:37,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:49:37,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806273011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:37,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:49:37,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 11:49:37,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643749260] [2025-02-05 11:49:37,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:37,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:37,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:37,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:37,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:49:37,646 INFO L87 Difference]: Start difference. First operand 3742 states and 3997 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-02-05 11:49:38,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:38,118 INFO L93 Difference]: Finished difference Result 8550 states and 9126 transitions. [2025-02-05 11:49:38,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:38,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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 621 [2025-02-05 11:49:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:38,139 INFO L225 Difference]: With dead ends: 8550 [2025-02-05 11:49:38,139 INFO L226 Difference]: Without dead ends: 4098 [2025-02-05 11:49:38,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 621 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:49:38,149 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 149 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:38,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 241 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:38,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2025-02-05 11:49:38,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3742. [2025-02-05 11:49:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3741 states have (on average 1.0622828120823309) internal successors, (3974), 3741 states have internal predecessors, (3974), 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-02-05 11:49:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3974 transitions. [2025-02-05 11:49:38,249 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3974 transitions. Word has length 621 [2025-02-05 11:49:38,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:38,250 INFO L471 AbstractCegarLoop]: Abstraction has 3742 states and 3974 transitions. [2025-02-05 11:49:38,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-02-05 11:49:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3974 transitions. [2025-02-05 11:49:38,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-02-05 11:49:38,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:38,256 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:38,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 11:49:38,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 11:49:38,460 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:38,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:38,460 INFO L85 PathProgramCache]: Analyzing trace with hash 375533931, now seen corresponding path program 1 times [2025-02-05 11:49:38,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:38,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592967167] [2025-02-05 11:49:38,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:38,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:38,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-02-05 11:49:38,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-02-05 11:49:38,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:38,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 1186 proven. 110 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-02-05 11:49:38,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:38,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592967167] [2025-02-05 11:49:38,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592967167] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:38,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524520702] [2025-02-05 11:49:38,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:38,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:38,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:38,893 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:49:38,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 11:49:38,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-02-05 11:49:39,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-02-05 11:49:39,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:39,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:39,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:49:39,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 1186 proven. 110 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-02-05 11:49:39,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:49:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 1186 proven. 110 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-02-05 11:49:39,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524520702] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:49:39,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:49:39,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-05 11:49:39,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137875088] [2025-02-05 11:49:39,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:49:39,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 11:49:39,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:39,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 11:49:39,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:49:39,783 INFO L87 Difference]: Start difference. First operand 3742 states and 3974 transitions. Second operand has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 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-02-05 11:49:40,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:40,774 INFO L93 Difference]: Finished difference Result 8906 states and 9462 transitions. [2025-02-05 11:49:40,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 11:49:40,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 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 700 [2025-02-05 11:49:40,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:40,795 INFO L225 Difference]: With dead ends: 8906 [2025-02-05 11:49:40,795 INFO L226 Difference]: Without dead ends: 5344 [2025-02-05 11:49:40,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1402 GetRequests, 1398 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:49:40,800 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 201 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:40,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 65 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:49:40,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2025-02-05 11:49:40,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4454. [2025-02-05 11:49:40,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.060408713227038) internal successors, (4722), 4453 states have internal predecessors, (4722), 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-02-05 11:49:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4722 transitions. [2025-02-05 11:49:40,878 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4722 transitions. Word has length 700 [2025-02-05 11:49:40,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:40,880 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4722 transitions. [2025-02-05 11:49:40,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 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-02-05 11:49:40,880 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4722 transitions. [2025-02-05 11:49:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2025-02-05 11:49:40,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:40,890 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2025-02-05 11:49:40,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 11:49:41,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:41,091 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:41,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:41,092 INFO L85 PathProgramCache]: Analyzing trace with hash -969769014, now seen corresponding path program 1 times [2025-02-05 11:49:41,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:41,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261796290] [2025-02-05 11:49:41,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:41,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:41,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 759 statements into 1 equivalence classes. [2025-02-05 11:49:41,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 759 of 759 statements. [2025-02-05 11:49:41,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:41,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1688 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 11:49:42,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:42,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261796290] [2025-02-05 11:49:42,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261796290] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:42,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939974895] [2025-02-05 11:49:42,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:42,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:42,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:42,179 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:49:42,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 11:49:42,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 759 statements into 1 equivalence classes. [2025-02-05 11:49:42,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 759 of 759 statements. [2025-02-05 11:49:42,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:42,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:42,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 11:49:42,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1688 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 1259 trivial. 0 not checked. [2025-02-05 11:49:44,727 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:49:44,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939974895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:44,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:49:44,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:49:44,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112745879] [2025-02-05 11:49:44,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:44,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:49:44,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:44,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:49:44,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:49:44,730 INFO L87 Difference]: Start difference. First operand 4454 states and 4722 transitions. Second operand has 4 states, 4 states have (on average 64.25) internal successors, (257), 3 states have internal predecessors, (257), 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-02-05 11:49:45,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:45,302 INFO L93 Difference]: Finished difference Result 8935 states and 9475 transitions. [2025-02-05 11:49:45,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:49:45,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 3 states have internal predecessors, (257), 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 759 [2025-02-05 11:49:45,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:45,313 INFO L225 Difference]: With dead ends: 8935 [2025-02-05 11:49:45,313 INFO L226 Difference]: Without dead ends: 4454 [2025-02-05 11:49:45,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 757 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:49:45,318 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 131 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:45,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 46 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:49:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-02-05 11:49:45,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2025-02-05 11:49:45,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0442398383112508) internal successors, (4650), 4453 states have internal predecessors, (4650), 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-02-05 11:49:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4650 transitions. [2025-02-05 11:49:45,392 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4650 transitions. Word has length 759 [2025-02-05 11:49:45,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:45,393 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4650 transitions. [2025-02-05 11:49:45,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 3 states have internal predecessors, (257), 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-02-05 11:49:45,394 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4650 transitions. [2025-02-05 11:49:45,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 936 [2025-02-05 11:49:45,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:45,408 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 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, 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] [2025-02-05 11:49:45,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 11:49:45,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:45,610 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:45,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:45,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1546998862, now seen corresponding path program 1 times [2025-02-05 11:49:45,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:45,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205719045] [2025-02-05 11:49:45,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:45,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:45,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 935 statements into 1 equivalence classes. [2025-02-05 11:49:45,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 935 of 935 statements. [2025-02-05 11:49:45,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:45,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:46,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2745 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2025-02-05 11:49:46,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:46,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205719045] [2025-02-05 11:49:46,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205719045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:46,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:46,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:46,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60508183] [2025-02-05 11:49:46,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:46,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:46,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:46,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:46,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:46,154 INFO L87 Difference]: Start difference. First operand 4454 states and 4650 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:49:46,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:46,719 INFO L93 Difference]: Finished difference Result 5168 states and 5386 transitions. [2025-02-05 11:49:46,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:46,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 935 [2025-02-05 11:49:46,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:46,729 INFO L225 Difference]: With dead ends: 5168 [2025-02-05 11:49:46,729 INFO L226 Difference]: Without dead ends: 5166 [2025-02-05 11:49:46,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:46,732 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 170 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:46,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 11 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:49:46,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2025-02-05 11:49:46,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4454. [2025-02-05 11:49:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0437907028969233) internal successors, (4648), 4453 states have internal predecessors, (4648), 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-02-05 11:49:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4648 transitions. [2025-02-05 11:49:46,777 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4648 transitions. Word has length 935 [2025-02-05 11:49:46,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:46,778 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4648 transitions. [2025-02-05 11:49:46,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:49:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4648 transitions. [2025-02-05 11:49:46,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 999 [2025-02-05 11:49:46,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:46,787 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 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, 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, 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] [2025-02-05 11:49:46,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 11:49:46,788 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:46,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:46,788 INFO L85 PathProgramCache]: Analyzing trace with hash -312310498, now seen corresponding path program 1 times [2025-02-05 11:49:46,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:46,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827041773] [2025-02-05 11:49:46,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:46,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:46,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 998 statements into 1 equivalence classes. [2025-02-05 11:49:46,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 998 of 998 statements. [2025-02-05 11:49:46,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:46,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3297 backedges. 828 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2025-02-05 11:49:47,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:47,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827041773] [2025-02-05 11:49:47,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827041773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:47,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:47,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:47,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170943126] [2025-02-05 11:49:47,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:47,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:47,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:47,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:47,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:47,662 INFO L87 Difference]: Start difference. First operand 4454 states and 4648 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-02-05 11:49:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:48,059 INFO L93 Difference]: Finished difference Result 8728 states and 9115 transitions. [2025-02-05 11:49:48,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:48,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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 998 [2025-02-05 11:49:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:48,068 INFO L225 Difference]: With dead ends: 8728 [2025-02-05 11:49:48,068 INFO L226 Difference]: Without dead ends: 4454 [2025-02-05 11:49:48,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:48,073 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 111 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:48,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 227 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:48,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-02-05 11:49:48,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2025-02-05 11:49:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0397484841679767) internal successors, (4630), 4453 states have internal predecessors, (4630), 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-02-05 11:49:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4630 transitions. [2025-02-05 11:49:48,116 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4630 transitions. Word has length 998 [2025-02-05 11:49:48,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:48,117 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4630 transitions. [2025-02-05 11:49:48,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-02-05 11:49:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4630 transitions. [2025-02-05 11:49:48,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1047 [2025-02-05 11:49:48,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:48,127 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:48,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:49:48,127 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:48,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:48,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1633561178, now seen corresponding path program 1 times [2025-02-05 11:49:48,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:48,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689306672] [2025-02-05 11:49:48,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:48,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:48,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1046 statements into 1 equivalence classes. [2025-02-05 11:49:48,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1046 of 1046 statements. [2025-02-05 11:49:48,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:48,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3494 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 3225 trivial. 0 not checked. [2025-02-05 11:49:49,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:49,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689306672] [2025-02-05 11:49:49,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689306672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:49,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:49,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:49,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073790546] [2025-02-05 11:49:49,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:49,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:49,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:49,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:49,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:49,199 INFO L87 Difference]: Start difference. First operand 4454 states and 4630 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-02-05 11:49:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:49,552 INFO L93 Difference]: Finished difference Result 4812 states and 5040 transitions. [2025-02-05 11:49:49,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:49,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 1046 [2025-02-05 11:49:49,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:49,561 INFO L225 Difference]: With dead ends: 4812 [2025-02-05 11:49:49,562 INFO L226 Difference]: Without dead ends: 4810 [2025-02-05 11:49:49,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:49,563 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 152 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:49,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 15 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 11:49:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2025-02-05 11:49:49,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4276. [2025-02-05 11:49:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.0383625730994153) internal successors, (4439), 4275 states have internal predecessors, (4439), 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-02-05 11:49:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4439 transitions. [2025-02-05 11:49:49,609 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4439 transitions. Word has length 1046 [2025-02-05 11:49:49,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:49,610 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4439 transitions. [2025-02-05 11:49:49,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-02-05 11:49:49,610 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4439 transitions. [2025-02-05 11:49:49,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1056 [2025-02-05 11:49:49,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:49,620 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:49,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 11:49:49,620 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:49,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:49,621 INFO L85 PathProgramCache]: Analyzing trace with hash -703596662, now seen corresponding path program 1 times [2025-02-05 11:49:49,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:49,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302837299] [2025-02-05 11:49:49,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:49,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:49,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1055 statements into 1 equivalence classes. [2025-02-05 11:49:49,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1055 of 1055 statements. [2025-02-05 11:49:49,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:49,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3557 backedges. 1609 proven. 0 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2025-02-05 11:49:50,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:50,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302837299] [2025-02-05 11:49:50,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302837299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:50,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:50,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:49:50,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462274083] [2025-02-05 11:49:50,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:50,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:49:50,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:50,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:49:50,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:49:50,567 INFO L87 Difference]: Start difference. First operand 4276 states and 4439 transitions. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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-02-05 11:49:51,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:51,210 INFO L93 Difference]: Finished difference Result 8550 states and 8917 transitions. [2025-02-05 11:49:51,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:49:51,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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 1055 [2025-02-05 11:49:51,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:51,220 INFO L225 Difference]: With dead ends: 8550 [2025-02-05 11:49:51,220 INFO L226 Difference]: Without dead ends: 4454 [2025-02-05 11:49:51,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:49:51,225 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 167 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:51,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 212 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:49:51,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-02-05 11:49:51,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2025-02-05 11:49:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0332360206602291) internal successors, (4601), 4453 states have internal predecessors, (4601), 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-02-05 11:49:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4601 transitions. [2025-02-05 11:49:51,270 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4601 transitions. Word has length 1055 [2025-02-05 11:49:51,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:51,270 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4601 transitions. [2025-02-05 11:49:51,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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-02-05 11:49:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4601 transitions. [2025-02-05 11:49:51,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2025-02-05 11:49:51,281 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:51,282 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:51,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 11:49:51,282 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:51,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:51,283 INFO L85 PathProgramCache]: Analyzing trace with hash 684708893, now seen corresponding path program 1 times [2025-02-05 11:49:51,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:51,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071992156] [2025-02-05 11:49:51,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:51,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:51,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1108 statements into 1 equivalence classes. [2025-02-05 11:49:51,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1108 of 1108 statements. [2025-02-05 11:49:51,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:51,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3659 backedges. 2613 proven. 72 refuted. 0 times theorem prover too weak. 974 trivial. 0 not checked. [2025-02-05 11:49:52,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:52,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071992156] [2025-02-05 11:49:52,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071992156] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:52,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461919994] [2025-02-05 11:49:52,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:52,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:52,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:52,644 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:49:52,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 11:49:52,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1108 statements into 1 equivalence classes. [2025-02-05 11:49:52,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1108 of 1108 statements. [2025-02-05 11:49:52,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:52,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:52,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 11:49:52,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:53,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3659 backedges. 2522 proven. 716 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2025-02-05 11:49:53,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:49:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3659 backedges. 2685 proven. 0 refuted. 0 times theorem prover too weak. 974 trivial. 0 not checked. [2025-02-05 11:49:54,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461919994] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:54,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 11:49:54,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2025-02-05 11:49:54,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813354399] [2025-02-05 11:49:54,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:54,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 11:49:54,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:54,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 11:49:54,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:49:54,424 INFO L87 Difference]: Start difference. First operand 4454 states and 4601 transitions. Second operand has 5 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 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-02-05 11:49:54,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:54,845 INFO L93 Difference]: Finished difference Result 9262 states and 9581 transitions. [2025-02-05 11:49:54,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:49:54,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 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 1108 [2025-02-05 11:49:54,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:54,856 INFO L225 Difference]: With dead ends: 9262 [2025-02-05 11:49:54,857 INFO L226 Difference]: Without dead ends: 4988 [2025-02-05 11:49:54,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2219 GetRequests, 2211 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:49:54,862 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 47 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:54,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 9 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:54,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2025-02-05 11:49:54,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4454. [2025-02-05 11:49:54,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0332360206602291) internal successors, (4601), 4453 states have internal predecessors, (4601), 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-02-05 11:49:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4601 transitions. [2025-02-05 11:49:54,936 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4601 transitions. Word has length 1108 [2025-02-05 11:49:54,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:54,937 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4601 transitions. [2025-02-05 11:49:54,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 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-02-05 11:49:54,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4601 transitions. [2025-02-05 11:49:54,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1353 [2025-02-05 11:49:54,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:54,965 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:54,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 11:49:55,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:55,166 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:55,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:55,168 INFO L85 PathProgramCache]: Analyzing trace with hash -24072232, now seen corresponding path program 1 times [2025-02-05 11:49:55,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:55,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017426744] [2025-02-05 11:49:55,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:55,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:55,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1352 statements into 1 equivalence classes. [2025-02-05 11:49:55,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1352 of 1352 statements. [2025-02-05 11:49:55,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:55,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:56,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5674 backedges. 4289 proven. 72 refuted. 0 times theorem prover too weak. 1313 trivial. 0 not checked. [2025-02-05 11:49:56,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:56,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017426744] [2025-02-05 11:49:56,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017426744] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:56,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210130346] [2025-02-05 11:49:56,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:56,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:56,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:56,548 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:49:56,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 11:49:56,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1352 statements into 1 equivalence classes. [2025-02-05 11:49:56,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1352 of 1352 statements. [2025-02-05 11:49:56,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:56,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:56,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 1633 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 11:49:56,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5674 backedges. 4002 proven. 0 refuted. 0 times theorem prover too weak. 1672 trivial. 0 not checked. [2025-02-05 11:49:57,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:49:57,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210130346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:57,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:49:57,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-02-05 11:49:57,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740729495] [2025-02-05 11:49:57,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:57,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:49:57,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:57,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:49:57,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:49:57,258 INFO L87 Difference]: Start difference. First operand 4454 states and 4601 transitions. Second operand has 4 states, 4 states have (on average 164.5) internal successors, (658), 4 states have internal predecessors, (658), 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-02-05 11:49:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:57,796 INFO L93 Difference]: Finished difference Result 9974 states and 10308 transitions. [2025-02-05 11:49:57,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:49:57,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 164.5) internal successors, (658), 4 states have internal predecessors, (658), 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 1352 [2025-02-05 11:49:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:57,809 INFO L225 Difference]: With dead ends: 9974 [2025-02-05 11:49:57,809 INFO L226 Difference]: Without dead ends: 5700 [2025-02-05 11:49:57,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1356 GetRequests, 1351 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:49:57,815 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 69 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:57,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 44 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:49:57,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2025-02-05 11:49:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 4988. [2025-02-05 11:49:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4988 states, 4987 states have (on average 1.0328855023059955) internal successors, (5151), 4987 states have internal predecessors, (5151), 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-02-05 11:49:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5151 transitions. [2025-02-05 11:49:57,873 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5151 transitions. Word has length 1352 [2025-02-05 11:49:57,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:57,874 INFO L471 AbstractCegarLoop]: Abstraction has 4988 states and 5151 transitions. [2025-02-05 11:49:57,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 164.5) internal successors, (658), 4 states have internal predecessors, (658), 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-02-05 11:49:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5151 transitions. [2025-02-05 11:49:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1355 [2025-02-05 11:49:57,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:57,890 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:57,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 11:49:58,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:58,091 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:58,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:58,092 INFO L85 PathProgramCache]: Analyzing trace with hash 680192090, now seen corresponding path program 1 times [2025-02-05 11:49:58,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:58,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188936833] [2025-02-05 11:49:58,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:58,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:58,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1354 statements into 1 equivalence classes. [2025-02-05 11:49:58,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1354 of 1354 statements. [2025-02-05 11:49:58,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:58,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5336 backedges. 3492 proven. 7 refuted. 0 times theorem prover too weak. 1837 trivial. 0 not checked. [2025-02-05 11:49:59,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:59,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188936833] [2025-02-05 11:49:59,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188936833] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:59,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551299406] [2025-02-05 11:49:59,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:59,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:59,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:59,006 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:49:59,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 11:49:59,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1354 statements into 1 equivalence classes. [2025-02-05 11:49:59,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1354 of 1354 statements. [2025-02-05 11:49:59,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:59,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:59,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:49:59,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5336 backedges. 3499 proven. 0 refuted. 0 times theorem prover too weak. 1837 trivial. 0 not checked. [2025-02-05 11:49:59,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:49:59,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551299406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:59,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:49:59,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:49:59,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55531172] [2025-02-05 11:49:59,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:59,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:59,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:59,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:59,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:49:59,565 INFO L87 Difference]: Start difference. First operand 4988 states and 5151 transitions. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 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-02-05 11:49:59,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:59,903 INFO L93 Difference]: Finished difference Result 10152 states and 10498 transitions. [2025-02-05 11:49:59,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:59,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 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 1354 [2025-02-05 11:49:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:59,910 INFO L225 Difference]: With dead ends: 10152 [2025-02-05 11:49:59,910 INFO L226 Difference]: Without dead ends: 5344 [2025-02-05 11:49:59,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1357 GetRequests, 1353 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:49:59,916 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 4 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:59,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 225 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 11:49:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2025-02-05 11:49:59,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4988. [2025-02-05 11:49:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4988 states, 4987 states have (on average 1.030278724684179) internal successors, (5138), 4987 states have internal predecessors, (5138), 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-02-05 11:49:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5138 transitions. [2025-02-05 11:49:59,962 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5138 transitions. Word has length 1354 [2025-02-05 11:49:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:59,963 INFO L471 AbstractCegarLoop]: Abstraction has 4988 states and 5138 transitions. [2025-02-05 11:49:59,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 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-02-05 11:49:59,963 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5138 transitions. [2025-02-05 11:49:59,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1484 [2025-02-05 11:49:59,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:59,979 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:59,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 11:50:00,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-05 11:50:00,180 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:50:00,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:50:00,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1052708593, now seen corresponding path program 1 times [2025-02-05 11:50:00,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:50:00,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137685431] [2025-02-05 11:50:00,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:50:00,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:50:00,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1483 statements into 1 equivalence classes. [2025-02-05 11:50:00,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1483 of 1483 statements. [2025-02-05 11:50:00,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:50:00,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:50:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 4080 proven. 495 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2025-02-05 11:50:01,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:50:01,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137685431] [2025-02-05 11:50:01,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137685431] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:50:01,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439290381] [2025-02-05 11:50:01,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:50:01,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:50:01,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:50:01,966 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:50:01,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 11:50:02,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1483 statements into 1 equivalence classes. [2025-02-05 11:50:02,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1483 of 1483 statements. [2025-02-05 11:50:02,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:50:02,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:50:02,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 1765 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:50:02,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:50:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 4163 proven. 0 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2025-02-05 11:50:03,264 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:50:03,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439290381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:50:03,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:50:03,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-02-05 11:50:03,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402647713] [2025-02-05 11:50:03,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:50:03,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:50:03,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:50:03,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:50:03,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:50:03,267 INFO L87 Difference]: Start difference. First operand 4988 states and 5138 transitions. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 3 states have internal predecessors, (486), 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-02-05 11:50:03,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:50:03,759 INFO L93 Difference]: Finished difference Result 9796 states and 10095 transitions. [2025-02-05 11:50:03,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:50:03,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 3 states have internal predecessors, (486), 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 1483 [2025-02-05 11:50:03,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:50:03,765 INFO L225 Difference]: With dead ends: 9796 [2025-02-05 11:50:03,765 INFO L226 Difference]: Without dead ends: 4810 [2025-02-05 11:50:03,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1489 GetRequests, 1482 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:50:03,770 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 67 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:50:03,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 48 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:50:03,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2025-02-05 11:50:03,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4810. [2025-02-05 11:50:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.0297359118319818) internal successors, (4952), 4809 states have internal predecessors, (4952), 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-02-05 11:50:03,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4952 transitions. [2025-02-05 11:50:03,818 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4952 transitions. Word has length 1483 [2025-02-05 11:50:03,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:50:03,818 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 4952 transitions. [2025-02-05 11:50:03,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 3 states have internal predecessors, (486), 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-02-05 11:50:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4952 transitions. [2025-02-05 11:50:03,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1513 [2025-02-05 11:50:03,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:50:03,835 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:50:03,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 11:50:04,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:50:04,037 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:50:04,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:50:04,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2053301966, now seen corresponding path program 1 times [2025-02-05 11:50:04,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:50:04,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254834210] [2025-02-05 11:50:04,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:50:04,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:50:04,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1512 statements into 1 equivalence classes. [2025-02-05 11:50:04,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1512 of 1512 statements. [2025-02-05 11:50:04,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:50:04,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:50:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6641 backedges. 4073 proven. 95 refuted. 0 times theorem prover too weak. 2473 trivial. 0 not checked. [2025-02-05 11:50:05,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:50:05,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254834210] [2025-02-05 11:50:05,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254834210] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:50:05,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283782737] [2025-02-05 11:50:05,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:50:05,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:50:05,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:50:05,332 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:50:05,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 11:50:05,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1512 statements into 1 equivalence classes. [2025-02-05 11:50:05,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1512 of 1512 statements. [2025-02-05 11:50:05,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:50:05,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:50:05,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 1794 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:50:05,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:50:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6641 backedges. 4168 proven. 0 refuted. 0 times theorem prover too weak. 2473 trivial. 0 not checked. [2025-02-05 11:50:05,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:50:05,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283782737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:50:05,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:50:05,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:50:05,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077392896] [2025-02-05 11:50:05,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:50:05,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:50:05,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:50:05,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:50:05,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:50:05,939 INFO L87 Difference]: Start difference. First operand 4810 states and 4952 transitions. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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-02-05 11:50:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:50:06,263 INFO L93 Difference]: Finished difference Result 9440 states and 9723 transitions. [2025-02-05 11:50:06,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:50:06,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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 1512 [2025-02-05 11:50:06,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:50:06,267 INFO L225 Difference]: With dead ends: 9440 [2025-02-05 11:50:06,267 INFO L226 Difference]: Without dead ends: 4810 [2025-02-05 11:50:06,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1515 GetRequests, 1511 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:50:06,272 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:50:06,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 215 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 11:50:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2025-02-05 11:50:06,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4632. [2025-02-05 11:50:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.0239689052040597) internal successors, (4742), 4631 states have internal predecessors, (4742), 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-02-05 11:50:06,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4742 transitions. [2025-02-05 11:50:06,305 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4742 transitions. Word has length 1512 [2025-02-05 11:50:06,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:50:06,306 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 4742 transitions. [2025-02-05 11:50:06,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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-02-05 11:50:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4742 transitions. [2025-02-05 11:50:06,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1890 [2025-02-05 11:50:06,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:50:06,322 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:50:06,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 11:50:06,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:50:06,523 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:50:06,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:50:06,524 INFO L85 PathProgramCache]: Analyzing trace with hash -630634742, now seen corresponding path program 1 times [2025-02-05 11:50:06,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:50:06,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966251332] [2025-02-05 11:50:06,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:50:06,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:50:06,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1889 statements into 1 equivalence classes. [2025-02-05 11:50:06,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1889 of 1889 statements. [2025-02-05 11:50:06,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:50:06,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:50:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 11220 backedges. 449 proven. 0 refuted. 0 times theorem prover too weak. 10771 trivial. 0 not checked. [2025-02-05 11:50:07,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:50:07,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966251332] [2025-02-05 11:50:07,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966251332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:50:07,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:50:07,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:50:07,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700647888] [2025-02-05 11:50:07,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:50:07,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:50:07,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:50:07,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:50:07,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:50:07,744 INFO L87 Difference]: Start difference. First operand 4632 states and 4742 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-02-05 11:50:08,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:50:08,130 INFO L93 Difference]: Finished difference Result 10150 states and 10392 transitions. [2025-02-05 11:50:08,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:50:08,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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 1889 [2025-02-05 11:50:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:50:08,132 INFO L225 Difference]: With dead ends: 10150 [2025-02-05 11:50:08,132 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:50:08,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:50:08,138 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 162 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:50:08,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 191 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:50:08,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:50:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:50:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-02-05 11:50:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:50:08,140 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1889 [2025-02-05 11:50:08,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:50:08,140 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:50:08,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-02-05 11:50:08,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:50:08,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:50:08,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:50:08,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 11:50:08,146 INFO L422 BasicCegarLoop]: Path program 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] [2025-02-05 11:50:08,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 11:50:08,953 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 11:50:08,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:50:08 BoogieIcfgContainer [2025-02-05 11:50:08,981 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 11:50:08,982 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 11:50:08,982 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 11:50:08,982 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 11:50:08,985 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:49:23" (3/4) ... [2025-02-05 11:50:08,987 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 11:50:09,016 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 11:50:09,019 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 11:50:09,020 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 11:50:09,021 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 11:50:09,162 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 11:50:09,163 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 11:50:09,163 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 11:50:09,166 INFO L158 Benchmark]: Toolchain (without parser) took 48054.55ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 128.0MB in the beginning and 331.4MB in the end (delta: -203.4MB). Peak memory consumption was 277.9MB. Max. memory is 16.1GB. [2025-02-05 11:50:09,166 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 209.7MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 11:50:09,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.74ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 95.7MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 11:50:09,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.74ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 86.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 11:50:09,167 INFO L158 Benchmark]: Boogie Preprocessor took 113.96ms. Allocated memory is still 167.8MB. Free memory was 86.2MB in the beginning and 75.1MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 11:50:09,168 INFO L158 Benchmark]: IcfgBuilder took 1646.13ms. Allocated memory is still 167.8MB. Free memory was 75.1MB in the beginning and 112.5MB in the end (delta: -37.4MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2025-02-05 11:50:09,168 INFO L158 Benchmark]: TraceAbstraction took 45484.01ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 111.6MB in the beginning and 344.2MB in the end (delta: -232.7MB). Peak memory consumption was 388.3MB. Max. memory is 16.1GB. [2025-02-05 11:50:09,168 INFO L158 Benchmark]: Witness Printer took 181.57ms. Allocated memory is still 645.9MB. Free memory was 344.2MB in the beginning and 331.4MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 11:50:09,169 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 209.7MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.74ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 95.7MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.74ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 86.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.96ms. Allocated memory is still 167.8MB. Free memory was 86.2MB in the beginning and 75.1MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1646.13ms. Allocated memory is still 167.8MB. Free memory was 75.1MB in the beginning and 112.5MB in the end (delta: -37.4MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. * TraceAbstraction took 45484.01ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 111.6MB in the beginning and 344.2MB in the end (delta: -232.7MB). Peak memory consumption was 388.3MB. Max. memory is 16.1GB. * Witness Printer took 181.57ms. Allocated memory is still 645.9MB. Free memory was 344.2MB in the beginning and 331.4MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 110]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.6s, OverallIterations: 25, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3289 SdHoareTripleChecker+Valid, 13.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3289 mSDsluCounter, 2919 SdHoareTripleChecker+Invalid, 11.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 1373 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14374 IncrementalHoareTripleChecker+Invalid, 15747 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1373 mSolverCounterUnsat, 2762 mSDtfsCounter, 14374 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10779 GetRequests, 10715 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4988occurred in iteration=21, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 5880 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 21.2s InterpolantComputationTime, 27061 NumberOfCodeBlocks, 27061 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 28834 ConstructedInterpolants, 0 QuantifiedInterpolants, 75144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 10751 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 35 InterpolantComputations, 24 PerfectInterpolantSequences, 96809/99031 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Location Invariant Derived location invariant: (((((((((((((((((a12 <= 11) && (a24 == 1)) && (a15 <= 8)) && (a21 == 9)) || ((((a24 == 1) && (a21 == 6)) && (a12 <= 600129)) && (0 <= ((long long) 41 + a12)))) || (((((7 <= a15) && (a12 <= 80)) && (a24 == 1)) && (a15 <= 8)) && (0 <= ((long long) 41 + a12)))) || ((a24 == 1) && (a15 <= 5))) || ((((7 <= a15) && (a21 == 8)) && (a24 == 1)) && (a12 <= 600129))) || (((((a24 == 1) && (9 <= a15)) && (7 == a21)) && (a12 <= 600129)) && (0 <= ((long long) 41 + a12)))) || (((((7 <= a15) && (a12 <= 80)) && (a24 == 1)) && (7 == a21)) && (a15 <= 8))) || ((((a12 <= 11) && (a24 == 1)) && (10 <= a21)) && (0 <= ((long long) 41 + a12)))) || ((((7 <= a15) && (a24 == 1)) && (a15 <= 8)) && (((long long) 49 + a12) <= 0))) || ((((a24 == 1) && (a21 == 9)) && (a12 <= 600129)) && (81 <= a12))) || (((a12 <= 80) && (a21 == 8)) && (a24 == 1))) || (((((7 <= a15) && (a24 == 1)) || ((a24 == 1) && (a21 != 10))) && (a12 <= 600129)) && (10 <= a21))) || (((a21 <= 6) && (((long long) 49 + a12) <= 0)) && (a15 <= 5))) || (((((a24 == 1) && (a15 <= 8)) && (a21 <= 6)) && (a12 <= 600129)) && (0 <= ((long long) 41 + a12)))) RESULT: Ultimate proved your program to be correct! [2025-02-05 11:50:09,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE