./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label29.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/Problem01_label29.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 85e05dcbef11985a579e446d2c280cce8be43c2367f7e9a1fa9ca1daed3123bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:43:01,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:43:02,005 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:43:02,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:43:02,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:43:02,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:43:02,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:43:02,027 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:43:02,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:43:02,028 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:43:02,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:43:02,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:43:02,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:43:02,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:43:02,029 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:43:02,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:43:02,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:43:02,029 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:43:02,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:43:02,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:43:02,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:43:02,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:43:02,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:43:02,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:43:02,030 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:43:02,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:43:02,030 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:43:02,030 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:43:02,031 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:43:02,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:43:02,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:43:02,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:43:02,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:43:02,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:43:02,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:43:02,031 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:43:02,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:43:02,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:43:02,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:43:02,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:43:02,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:43:02,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:43:02,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:43:02,031 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 -> 85e05dcbef11985a579e446d2c280cce8be43c2367f7e9a1fa9ca1daed3123bb [2025-02-05 10:43:02,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:43:02,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:43:02,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:43:02,256 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:43:02,256 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:43:02,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2025-02-05 10:43:03,373 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a807fb2f/7c00a762c93a497c84d652c2cac78fa1/FLAGe1243d16f [2025-02-05 10:43:03,649 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:43:03,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2025-02-05 10:43:03,660 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a807fb2f/7c00a762c93a497c84d652c2cac78fa1/FLAGe1243d16f [2025-02-05 10:43:03,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a807fb2f/7c00a762c93a497c84d652c2cac78fa1 [2025-02-05 10:43:03,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:43:03,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:43:03,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:43:03,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:43:03,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:43:03,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:43:03" (1/1) ... [2025-02-05 10:43:03,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2823c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:03, skipping insertion in model container [2025-02-05 10:43:03,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:43:03" (1/1) ... [2025-02-05 10:43:03,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:43:04,174 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/Problem01_label29.c[18109,18122] [2025-02-05 10:43:04,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:43:04,224 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:43:04,289 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/Problem01_label29.c[18109,18122] [2025-02-05 10:43:04,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:43:04,315 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:43:04,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:04 WrapperNode [2025-02-05 10:43:04,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:43:04,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:43:04,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:43:04,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:43:04,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:04" (1/1) ... [2025-02-05 10:43:04,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:04" (1/1) ... [2025-02-05 10:43:04,363 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-02-05 10:43:04,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:43:04,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:43:04,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:43:04,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:43:04,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:04" (1/1) ... [2025-02-05 10:43:04,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:04" (1/1) ... [2025-02-05 10:43:04,380 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:04" (1/1) ... [2025-02-05 10:43:04,406 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 10:43:04,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:04" (1/1) ... [2025-02-05 10:43:04,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:04" (1/1) ... [2025-02-05 10:43:04,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:04" (1/1) ... [2025-02-05 10:43:04,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:04" (1/1) ... [2025-02-05 10:43:04,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:04" (1/1) ... [2025-02-05 10:43:04,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:04" (1/1) ... [2025-02-05 10:43:04,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:43:04,448 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:43:04,448 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:43:04,448 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:43:04,449 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:04" (1/1) ... [2025-02-05 10:43:04,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:43:04,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:43:04,475 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 10:43:04,478 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 10:43:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:43:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:43:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:43:04,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:43:04,548 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:43:04,549 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:43:05,282 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-02-05 10:43:05,283 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:43:05,291 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:43:05,291 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:43:05,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:43:05 BoogieIcfgContainer [2025-02-05 10:43:05,292 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:43:05,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:43:05,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:43:05,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:43:05,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:43:03" (1/3) ... [2025-02-05 10:43:05,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f11d0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:43:05, skipping insertion in model container [2025-02-05 10:43:05,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:04" (2/3) ... [2025-02-05 10:43:05,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f11d0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:43:05, skipping insertion in model container [2025-02-05 10:43:05,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:43:05" (3/3) ... [2025-02-05 10:43:05,299 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label29.c [2025-02-05 10:43:05,313 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:43:05,314 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label29.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:43:05,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:43:05,363 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;@6d6be35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:43:05,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:43:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 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 10:43:05,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 10:43:05,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:05,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:43:05,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:05,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:05,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1392211374, now seen corresponding path program 1 times [2025-02-05 10:43:05,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:05,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481520094] [2025-02-05 10:43:05,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:05,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:05,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 10:43:05,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 10:43:05,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:05,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:06,061 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 10:43:06,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:06,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481520094] [2025-02-05 10:43:06,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481520094] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:06,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:06,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:43:06,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162049757] [2025-02-05 10:43:06,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:06,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:43:06,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:06,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:43:06,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:43:06,088 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 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 10:43:06,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:06,944 INFO L93 Difference]: Finished difference Result 662 states and 1174 transitions. [2025-02-05 10:43:06,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:43:06,946 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 10:43:06,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:06,955 INFO L225 Difference]: With dead ends: 662 [2025-02-05 10:43:06,957 INFO L226 Difference]: Without dead ends: 397 [2025-02-05 10:43:06,960 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 10:43:06,961 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 353 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:06,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 81 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 10:43:06,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-02-05 10:43:07,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2025-02-05 10:43:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.3055555555555556) internal successors, (517), 396 states have internal predecessors, (517), 0 states have call successors, (0), 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 10:43:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 517 transitions. [2025-02-05 10:43:07,012 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 517 transitions. Word has length 101 [2025-02-05 10:43:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:07,013 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 517 transitions. [2025-02-05 10:43:07,013 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 10:43:07,013 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 517 transitions. [2025-02-05 10:43:07,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 10:43:07,018 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:07,019 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:07,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:43:07,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:07,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:07,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1678657389, now seen corresponding path program 1 times [2025-02-05 10:43:07,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:07,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286183986] [2025-02-05 10:43:07,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:07,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:07,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 10:43:07,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 10:43:07,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:07,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:43:07,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:07,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286183986] [2025-02-05 10:43:07,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286183986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:07,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:07,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:43:07,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098655545] [2025-02-05 10:43:07,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:07,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:43:07,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:07,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:43:07,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:43:07,415 INFO L87 Difference]: Start difference. First operand 397 states and 517 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:07,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:07,976 INFO L93 Difference]: Finished difference Result 887 states and 1235 transitions. [2025-02-05 10:43:07,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:43:07,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-02-05 10:43:07,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:07,979 INFO L225 Difference]: With dead ends: 887 [2025-02-05 10:43:07,979 INFO L226 Difference]: Without dead ends: 528 [2025-02-05 10:43:07,980 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 10:43:07,981 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 128 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:07,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 81 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:43:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-02-05 10:43:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 397. [2025-02-05 10:43:07,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.196969696969697) internal successors, (474), 396 states have internal predecessors, (474), 0 states have call successors, (0), 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 10:43:07,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 474 transitions. [2025-02-05 10:43:07,994 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 474 transitions. Word has length 108 [2025-02-05 10:43:07,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:07,994 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 474 transitions. [2025-02-05 10:43:07,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:07,994 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 474 transitions. [2025-02-05 10:43:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 10:43:07,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:07,996 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:07,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:43:07,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:07,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1308790560, now seen corresponding path program 1 times [2025-02-05 10:43:07,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:07,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175785758] [2025-02-05 10:43:07,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:07,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:08,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 10:43:08,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 10:43:08,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:08,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:08,146 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:43:08,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:08,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175785758] [2025-02-05 10:43:08,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175785758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:08,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:08,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:43:08,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567678458] [2025-02-05 10:43:08,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:08,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:43:08,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:08,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:43:08,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:43:08,147 INFO L87 Difference]: Start difference. First operand 397 states and 474 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 10:43:08,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:08,539 INFO L93 Difference]: Finished difference Result 1054 states and 1283 transitions. [2025-02-05 10:43:08,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:43:08,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-02-05 10:43:08,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:08,541 INFO L225 Difference]: With dead ends: 1054 [2025-02-05 10:43:08,541 INFO L226 Difference]: Without dead ends: 659 [2025-02-05 10:43:08,542 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 10:43:08,542 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 382 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:08,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 32 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:43:08,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-02-05 10:43:08,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2025-02-05 10:43:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.1930091185410334) internal successors, (785), 658 states have internal predecessors, (785), 0 states have call successors, (0), 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 10:43:08,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 785 transitions. [2025-02-05 10:43:08,562 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 785 transitions. Word has length 116 [2025-02-05 10:43:08,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:08,562 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 785 transitions. [2025-02-05 10:43:08,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 10:43:08,562 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 785 transitions. [2025-02-05 10:43:08,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 10:43:08,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:08,565 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:43:08,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:43:08,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:08,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:08,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1245395692, now seen corresponding path program 1 times [2025-02-05 10:43:08,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:08,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321377701] [2025-02-05 10:43:08,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:08,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 10:43:08,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 10:43:08,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:08,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:08,686 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 10:43:08,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:08,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321377701] [2025-02-05 10:43:08,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321377701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:08,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:08,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:43:08,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531456397] [2025-02-05 10:43:08,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:08,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:43:08,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:08,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:43:08,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:08,688 INFO L87 Difference]: Start difference. First operand 659 states and 785 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 10:43:08,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:08,973 INFO L93 Difference]: Finished difference Result 1840 states and 2182 transitions. [2025-02-05 10:43:08,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:43:08,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 125 [2025-02-05 10:43:08,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:08,977 INFO L225 Difference]: With dead ends: 1840 [2025-02-05 10:43:08,977 INFO L226 Difference]: Without dead ends: 1183 [2025-02-05 10:43:08,978 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 10:43:08,979 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:08,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 28 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:43:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-02-05 10:43:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1052. [2025-02-05 10:43:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.1998097050428163) internal successors, (1261), 1051 states have internal predecessors, (1261), 0 states have call successors, (0), 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 10:43:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1261 transitions. [2025-02-05 10:43:09,000 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1261 transitions. Word has length 125 [2025-02-05 10:43:09,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:09,000 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1261 transitions. [2025-02-05 10:43:09,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 10:43:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1261 transitions. [2025-02-05 10:43:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 10:43:09,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:09,002 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:09,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:43:09,002 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:09,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:09,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1984159301, now seen corresponding path program 1 times [2025-02-05 10:43:09,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:09,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046629971] [2025-02-05 10:43:09,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:09,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:09,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 10:43:09,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 10:43:09,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:09,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:09,161 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:43:09,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:09,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046629971] [2025-02-05 10:43:09,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046629971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:09,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:09,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:43:09,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759188857] [2025-02-05 10:43:09,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:09,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:43:09,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:09,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:43:09,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:09,163 INFO L87 Difference]: Start difference. First operand 1052 states and 1261 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:09,484 INFO L93 Difference]: Finished difference Result 2364 states and 2813 transitions. [2025-02-05 10:43:09,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:43:09,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-02-05 10:43:09,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:09,489 INFO L225 Difference]: With dead ends: 2364 [2025-02-05 10:43:09,489 INFO L226 Difference]: Without dead ends: 1314 [2025-02-05 10:43:09,490 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 10:43:09,491 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 121 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:09,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 191 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:43:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-02-05 10:43:09,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2025-02-05 10:43:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.1598984771573604) internal successors, (1371), 1182 states have internal predecessors, (1371), 0 states have call successors, (0), 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 10:43:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1371 transitions. [2025-02-05 10:43:09,511 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1371 transitions. Word has length 131 [2025-02-05 10:43:09,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:09,511 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1371 transitions. [2025-02-05 10:43:09,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:09,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1371 transitions. [2025-02-05 10:43:09,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 10:43:09,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:09,514 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:43:09,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:43:09,514 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:09,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:09,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1846653538, now seen corresponding path program 1 times [2025-02-05 10:43:09,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:09,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277031599] [2025-02-05 10:43:09,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:09,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:09,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 10:43:09,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 10:43:09,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:09,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:43:09,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:09,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277031599] [2025-02-05 10:43:09,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277031599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:09,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:09,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:43:09,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777046714] [2025-02-05 10:43:09,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:09,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:43:09,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:09,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:43:09,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:43:09,691 INFO L87 Difference]: Start difference. First operand 1183 states and 1371 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:10,238 INFO L93 Difference]: Finished difference Result 2757 states and 3174 transitions. [2025-02-05 10:43:10,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:43:10,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-02-05 10:43:10,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:10,243 INFO L225 Difference]: With dead ends: 2757 [2025-02-05 10:43:10,243 INFO L226 Difference]: Without dead ends: 1445 [2025-02-05 10:43:10,244 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 10:43:10,246 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 250 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:10,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 40 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:43:10,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2025-02-05 10:43:10,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2025-02-05 10:43:10,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.1350415512465375) internal successors, (1639), 1444 states have internal predecessors, (1639), 0 states have call successors, (0), 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 10:43:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1639 transitions. [2025-02-05 10:43:10,269 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1639 transitions. Word has length 145 [2025-02-05 10:43:10,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:10,270 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1639 transitions. [2025-02-05 10:43:10,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:10,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1639 transitions. [2025-02-05 10:43:10,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 10:43:10,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:10,274 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:43:10,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:43:10,274 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:10,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:10,275 INFO L85 PathProgramCache]: Analyzing trace with hash -672088099, now seen corresponding path program 1 times [2025-02-05 10:43:10,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:10,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135398748] [2025-02-05 10:43:10,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:10,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:10,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 10:43:10,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 10:43:10,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:10,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:43:10,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:10,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135398748] [2025-02-05 10:43:10,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135398748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:10,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:10,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:43:10,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190944111] [2025-02-05 10:43:10,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:10,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:43:10,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:10,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:43:10,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:10,458 INFO L87 Difference]: Start difference. First operand 1445 states and 1639 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 10:43:10,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:10,742 INFO L93 Difference]: Finished difference Result 3281 states and 3750 transitions. [2025-02-05 10:43:10,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:43:10,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 148 [2025-02-05 10:43:10,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:10,748 INFO L225 Difference]: With dead ends: 3281 [2025-02-05 10:43:10,748 INFO L226 Difference]: Without dead ends: 1838 [2025-02-05 10:43:10,749 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 10:43:10,750 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 131 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:10,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 30 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:43:10,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-02-05 10:43:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2025-02-05 10:43:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.1371629542790151) internal successors, (1940), 1706 states have internal predecessors, (1940), 0 states have call successors, (0), 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 10:43:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1940 transitions. [2025-02-05 10:43:10,778 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1940 transitions. Word has length 148 [2025-02-05 10:43:10,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:10,778 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 1940 transitions. [2025-02-05 10:43:10,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 10:43:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1940 transitions. [2025-02-05 10:43:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-02-05 10:43:10,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:10,782 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:43:10,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:43:10,782 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:10,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:10,782 INFO L85 PathProgramCache]: Analyzing trace with hash 180680807, now seen corresponding path program 1 times [2025-02-05 10:43:10,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:10,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470700488] [2025-02-05 10:43:10,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:10,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:10,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-05 10:43:10,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-05 10:43:10,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:10,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-02-05 10:43:10,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:10,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470700488] [2025-02-05 10:43:10,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470700488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:10,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:10,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:43:10,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485536475] [2025-02-05 10:43:10,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:10,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:43:10,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:10,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:43:10,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:43:10,982 INFO L87 Difference]: Start difference. First operand 1707 states and 1940 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 10:43:11,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:11,479 INFO L93 Difference]: Finished difference Result 3412 states and 3878 transitions. [2025-02-05 10:43:11,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:43:11,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 222 [2025-02-05 10:43:11,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:11,484 INFO L225 Difference]: With dead ends: 3412 [2025-02-05 10:43:11,484 INFO L226 Difference]: Without dead ends: 1707 [2025-02-05 10:43:11,486 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 10:43:11,486 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 238 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:11,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 46 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:43:11,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2025-02-05 10:43:11,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1707. [2025-02-05 10:43:11,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.1301289566236812) internal successors, (1928), 1706 states have internal predecessors, (1928), 0 states have call successors, (0), 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 10:43:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1928 transitions. [2025-02-05 10:43:11,520 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1928 transitions. Word has length 222 [2025-02-05 10:43:11,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:11,520 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 1928 transitions. [2025-02-05 10:43:11,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 10:43:11,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1928 transitions. [2025-02-05 10:43:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-02-05 10:43:11,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:11,525 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 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] [2025-02-05 10:43:11,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:43:11,525 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:11,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash 159724751, now seen corresponding path program 1 times [2025-02-05 10:43:11,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:11,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265048216] [2025-02-05 10:43:11,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:11,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:11,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-02-05 10:43:11,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-02-05 10:43:11,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:11,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 185 proven. 88 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 10:43:11,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:11,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265048216] [2025-02-05 10:43:11,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265048216] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:43:11,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788906743] [2025-02-05 10:43:11,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:11,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:43:11,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:43:11,876 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 10:43:11,878 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 10:43:11,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-02-05 10:43:11,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-02-05 10:43:11,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:11,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:11,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:43:11,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:43:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-02-05 10:43:12,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:43:12,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788906743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:12,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:43:12,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 10:43:12,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437956472] [2025-02-05 10:43:12,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:12,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:43:12,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:12,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:43:12,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:43:12,126 INFO L87 Difference]: Start difference. First operand 1707 states and 1928 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 10:43:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:12,411 INFO L93 Difference]: Finished difference Result 3412 states and 3854 transitions. [2025-02-05 10:43:12,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:43:12,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 248 [2025-02-05 10:43:12,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:12,416 INFO L225 Difference]: With dead ends: 3412 [2025-02-05 10:43:12,416 INFO L226 Difference]: Without dead ends: 1707 [2025-02-05 10:43:12,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:43:12,419 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 37 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:12,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 164 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:43:12,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2025-02-05 10:43:12,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2025-02-05 10:43:12,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.107936507936508) internal successors, (1745), 1575 states have internal predecessors, (1745), 0 states have call successors, (0), 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 10:43:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1745 transitions. [2025-02-05 10:43:12,453 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1745 transitions. Word has length 248 [2025-02-05 10:43:12,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:12,454 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 1745 transitions. [2025-02-05 10:43:12,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 10:43:12,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1745 transitions. [2025-02-05 10:43:12,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-05 10:43:12,459 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:12,459 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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, 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] [2025-02-05 10:43:12,486 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 10:43:12,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:43:12,660 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:12,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:12,661 INFO L85 PathProgramCache]: Analyzing trace with hash 988198981, now seen corresponding path program 1 times [2025-02-05 10:43:12,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:12,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577284746] [2025-02-05 10:43:12,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:12,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:12,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-05 10:43:12,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-05 10:43:12,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:12,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-02-05 10:43:12,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:12,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577284746] [2025-02-05 10:43:12,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577284746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:12,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:12,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:43:12,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467655429] [2025-02-05 10:43:12,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:12,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:43:12,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:12,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:43:12,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:12,804 INFO L87 Difference]: Start difference. First operand 1576 states and 1745 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 10:43:13,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:13,133 INFO L93 Difference]: Finished difference Result 3805 states and 4208 transitions. [2025-02-05 10:43:13,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:43:13,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 262 [2025-02-05 10:43:13,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:13,139 INFO L225 Difference]: With dead ends: 3805 [2025-02-05 10:43:13,139 INFO L226 Difference]: Without dead ends: 2231 [2025-02-05 10:43:13,140 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 10:43:13,140 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 141 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:13,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 29 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:43:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2025-02-05 10:43:13,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1576. [2025-02-05 10:43:13,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.107936507936508) internal successors, (1745), 1575 states have internal predecessors, (1745), 0 states have call successors, (0), 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 10:43:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1745 transitions. [2025-02-05 10:43:13,166 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1745 transitions. Word has length 262 [2025-02-05 10:43:13,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:13,166 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 1745 transitions. [2025-02-05 10:43:13,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 10:43:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1745 transitions. [2025-02-05 10:43:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-02-05 10:43:13,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:13,169 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 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, 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] [2025-02-05 10:43:13,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 10:43:13,170 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:13,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:13,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1459719665, now seen corresponding path program 1 times [2025-02-05 10:43:13,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:13,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783192796] [2025-02-05 10:43:13,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:13,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:13,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-02-05 10:43:13,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-02-05 10:43:13,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:13,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 246 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:43:13,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:13,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783192796] [2025-02-05 10:43:13,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783192796] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:43:13,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589519944] [2025-02-05 10:43:13,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:13,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:43:13,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:43:13,633 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 10:43:13,634 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 10:43:13,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-02-05 10:43:13,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-02-05 10:43:13,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:13,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:13,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:43:13,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:43:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-05 10:43:13,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:43:13,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589519944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:13,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:43:13,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 10:43:13,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075084622] [2025-02-05 10:43:13,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:13,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:43:13,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:13,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:43:13,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:43:13,952 INFO L87 Difference]: Start difference. First operand 1576 states and 1745 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 10:43:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:14,240 INFO L93 Difference]: Finished difference Result 3543 states and 3960 transitions. [2025-02-05 10:43:14,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:43:14,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 266 [2025-02-05 10:43:14,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:14,246 INFO L225 Difference]: With dead ends: 3543 [2025-02-05 10:43:14,246 INFO L226 Difference]: Without dead ends: 1969 [2025-02-05 10:43:14,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:43:14,249 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 37 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:14,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 172 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:43:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-02-05 10:43:14,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2025-02-05 10:43:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.1077235772357723) internal successors, (2180), 1968 states have internal predecessors, (2180), 0 states have call successors, (0), 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 10:43:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2180 transitions. [2025-02-05 10:43:14,278 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2180 transitions. Word has length 266 [2025-02-05 10:43:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:14,278 INFO L471 AbstractCegarLoop]: Abstraction has 1969 states and 2180 transitions. [2025-02-05 10:43:14,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 10:43:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2180 transitions. [2025-02-05 10:43:14,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-05 10:43:14,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:14,283 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 10:43:14,290 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 10:43:14,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:43:14,484 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:14,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:14,485 INFO L85 PathProgramCache]: Analyzing trace with hash 941258455, now seen corresponding path program 1 times [2025-02-05 10:43:14,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:14,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178709238] [2025-02-05 10:43:14,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:14,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:14,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 10:43:14,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 10:43:14,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:14,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 371 proven. 174 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 10:43:15,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:15,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178709238] [2025-02-05 10:43:15,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178709238] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:43:15,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746090983] [2025-02-05 10:43:15,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:15,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:43:15,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:43:15,007 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 10:43:15,011 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 10:43:15,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 10:43:15,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 10:43:15,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:15,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:15,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:43:15,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:43:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-02-05 10:43:15,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:43:15,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746090983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:15,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:43:15,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 10:43:15,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027024869] [2025-02-05 10:43:15,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:15,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:43:15,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:15,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:43:15,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:43:15,159 INFO L87 Difference]: Start difference. First operand 1969 states and 2180 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 10:43:15,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:15,447 INFO L93 Difference]: Finished difference Result 3934 states and 4320 transitions. [2025-02-05 10:43:15,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:43:15,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 307 [2025-02-05 10:43:15,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:15,450 INFO L225 Difference]: With dead ends: 3934 [2025-02-05 10:43:15,450 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 10:43:15,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:43:15,453 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 140 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:15,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 27 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:43:15,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 10:43:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 10:43:15,454 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 10:43:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 10:43:15,454 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 307 [2025-02-05 10:43:15,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:15,454 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 10:43:15,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 10:43:15,454 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 10:43:15,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 10:43:15,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:43:15,464 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 10:43:15,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:43:15,660 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:15,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 10:43:15,964 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:43:15,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:43:15 BoogieIcfgContainer [2025-02-05 10:43:15,983 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:43:15,984 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:43:15,984 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:43:15,984 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:43:15,984 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:43:05" (3/4) ... [2025-02-05 10:43:15,986 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 10:43:16,004 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 10:43:16,005 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 10:43:16,005 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 10:43:16,006 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 10:43:16,109 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 10:43:16,109 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 10:43:16,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:43:16,110 INFO L158 Benchmark]: Toolchain (without parser) took 12156.28ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 108.9MB in the beginning and 230.3MB in the end (delta: -121.4MB). Peak memory consumption was 190.6MB. Max. memory is 16.1GB. [2025-02-05 10:43:16,110 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:43:16,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.01ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 82.0MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 10:43:16,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.75ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 76.8MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:43:16,111 INFO L158 Benchmark]: Boogie Preprocessor took 82.22ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 72.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:43:16,111 INFO L158 Benchmark]: IcfgBuilder took 844.24ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 57.7MB in the end (delta: 15.0MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. [2025-02-05 10:43:16,112 INFO L158 Benchmark]: TraceAbstraction took 10690.05ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 57.0MB in the beginning and 242.8MB in the end (delta: -185.9MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2025-02-05 10:43:16,112 INFO L158 Benchmark]: Witness Printer took 125.14ms. Allocated memory is still 453.0MB. Free memory was 242.8MB in the beginning and 230.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:43:16,113 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.25ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.01ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 82.0MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.75ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 76.8MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.22ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 72.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 844.24ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 57.7MB in the end (delta: 15.0MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. * TraceAbstraction took 10690.05ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 57.0MB in the beginning and 242.8MB in the end (delta: -185.9MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. * Witness Printer took 125.14ms. Allocated memory is still 453.0MB. Free memory was 242.8MB in the beginning and 230.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. 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: 489]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 12, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2090 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2090 mSDsluCounter, 921 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 816 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5010 IncrementalHoareTripleChecker+Invalid, 5826 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 816 mSolverCounterUnsat, 828 mSDtfsCounter, 5010 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 867 GetRequests, 837 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=11, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1310 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 3000 NumberOfCodeBlocks, 3000 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2985 ConstructedInterpolants, 0 QuantifiedInterpolants, 13093 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1536 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 2996/3390 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: 593]: Location Invariant Derived location invariant: (((((((((((a17 <= 0) && (14 <= a8)) && (a16 <= 5)) || (((a7 != 1) && (a17 <= 0)) && (a16 <= 4))) || (((a21 <= 0) && (a17 <= 0)) && (a20 == 1))) || (((a7 != 1) && (a17 <= 0)) && (15 <= a8))) || (((a7 != 1) && (a17 == 1)) && (15 <= a8))) || ((((((a12 == 8) && (a8 == 13)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) || (((a21 <= 0) && (a17 == 1)) && (a16 <= 5))) || (((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1))) || (((a21 <= 0) && (a17 <= 0)) && (a16 <= 5))) RESULT: Ultimate proved your program to be correct! [2025-02-05 10:43:16,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE