./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label19.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/Problem16_label19.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 9b09a0fefbe5958e3921329b980c8e1375b708e4803fba0d8e1dfc742c64b031 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:57:38,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:57:38,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:57:38,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:57:38,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:57:38,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:57:38,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:57:38,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:57:38,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:57:38,683 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:57:38,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:57:38,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:57:38,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:57:38,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:57:38,684 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:57:38,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:57:38,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:57:38,684 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:57:38,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:57:38,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:57:38,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:57:38,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:57:38,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:57:38,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:57:38,685 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:57:38,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:57:38,685 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:57:38,685 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:57:38,685 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:57:38,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:57:38,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:57:38,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:57:38,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:57:38,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:57:38,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:57:38,686 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:57:38,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:57:38,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:57:38,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:57:38,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:57:38,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:57:38,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:57:38,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:57:38,687 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 -> 9b09a0fefbe5958e3921329b980c8e1375b708e4803fba0d8e1dfc742c64b031 [2025-02-05 11:57:38,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:57:38,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:57:38,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:57:38,914 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:57:38,914 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:57:38,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label19.c [2025-02-05 11:57:40,103 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4fb36ab4/a29a13d5ad8840e5982a90ac132fc25a/FLAGa128ad177 [2025-02-05 11:57:40,488 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:57:40,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label19.c [2025-02-05 11:57:40,502 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4fb36ab4/a29a13d5ad8840e5982a90ac132fc25a/FLAGa128ad177 [2025-02-05 11:57:40,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4fb36ab4/a29a13d5ad8840e5982a90ac132fc25a [2025-02-05 11:57:40,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:57:40,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:57:40,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:57:40,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:57:40,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:57:40,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:57:40" (1/1) ... [2025-02-05 11:57:40,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b6634c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:40, skipping insertion in model container [2025-02-05 11:57:40,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:57:40" (1/1) ... [2025-02-05 11:57:40,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:57:40,748 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/Problem16_label19.c[4623,4636] [2025-02-05 11:57:40,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:57:40,951 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:57:40,963 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/Problem16_label19.c[4623,4636] [2025-02-05 11:57:41,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:57:41,075 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:57:41,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:41 WrapperNode [2025-02-05 11:57:41,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:57:41,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:57:41,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:57:41,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:57:41,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:41" (1/1) ... [2025-02-05 11:57:41,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:41" (1/1) ... [2025-02-05 11:57:41,224 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-02-05 11:57:41,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:57:41,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:57:41,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:57:41,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:57:41,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:41" (1/1) ... [2025-02-05 11:57:41,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:41" (1/1) ... [2025-02-05 11:57:41,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:41" (1/1) ... [2025-02-05 11:57:41,299 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 11:57:41,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:41" (1/1) ... [2025-02-05 11:57:41,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:41" (1/1) ... [2025-02-05 11:57:41,346 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:41" (1/1) ... [2025-02-05 11:57:41,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:41" (1/1) ... [2025-02-05 11:57:41,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:41" (1/1) ... [2025-02-05 11:57:41,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:41" (1/1) ... [2025-02-05 11:57:41,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:57:41,390 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:57:41,390 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:57:41,390 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:57:41,391 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:41" (1/1) ... [2025-02-05 11:57:41,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:57:41,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:57:41,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:57:41,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:57:41,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:57:41,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:57:41,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:57:41,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:57:41,489 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:57:41,491 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:57:43,106 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-02-05 11:57:43,168 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-02-05 11:57:43,168 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:57:43,179 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:57:43,180 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:57:43,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:57:43 BoogieIcfgContainer [2025-02-05 11:57:43,180 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:57:43,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:57:43,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:57:43,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:57:43,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:57:40" (1/3) ... [2025-02-05 11:57:43,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183119cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:57:43, skipping insertion in model container [2025-02-05 11:57:43,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:41" (2/3) ... [2025-02-05 11:57:43,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183119cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:57:43, skipping insertion in model container [2025-02-05 11:57:43,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:57:43" (3/3) ... [2025-02-05 11:57:43,187 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label19.c [2025-02-05 11:57:43,197 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:57:43,198 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label19.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:57:43,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:57:43,255 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;@7d99618b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:57:43,255 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:57:43,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 11:57:43,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:43,267 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] [2025-02-05 11:57:43,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:43,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:43,272 INFO L85 PathProgramCache]: Analyzing trace with hash 466114627, now seen corresponding path program 1 times [2025-02-05 11:57:43,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:43,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261419791] [2025-02-05 11:57:43,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:43,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:43,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 11:57:43,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 11:57:43,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:43,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:57:43,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:43,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261419791] [2025-02-05 11:57:43,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261419791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:43,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:43,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:43,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715650957] [2025-02-05 11:57:43,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:43,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:57:43,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:43,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:57:43,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:57:43,678 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 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 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:45,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:45,860 INFO L93 Difference]: Finished difference Result 1456 states and 2760 transitions. [2025-02-05 11:57:45,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:57:45,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-02-05 11:57:45,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:45,871 INFO L225 Difference]: With dead ends: 1456 [2025-02-05 11:57:45,871 INFO L226 Difference]: Without dead ends: 991 [2025-02-05 11:57:45,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:57:45,875 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 1069 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:45,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 96 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 11:57:45,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-02-05 11:57:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2025-02-05 11:57:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.497979797979798) internal successors, (1483), 990 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1483 transitions. [2025-02-05 11:57:45,933 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1483 transitions. Word has length 43 [2025-02-05 11:57:45,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:45,937 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1483 transitions. [2025-02-05 11:57:45,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:45,937 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1483 transitions. [2025-02-05 11:57:45,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-05 11:57:45,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:45,944 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:57:45,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:57:45,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:45,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:45,944 INFO L85 PathProgramCache]: Analyzing trace with hash -294660149, now seen corresponding path program 1 times [2025-02-05 11:57:45,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:45,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461476605] [2025-02-05 11:57:45,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:45,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:45,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-05 11:57:46,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-05 11:57:46,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:46,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-02-05 11:57:46,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:46,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461476605] [2025-02-05 11:57:46,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461476605] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:46,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:46,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:57:46,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738987674] [2025-02-05 11:57:46,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:46,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:46,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:46,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:46,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:46,270 INFO L87 Difference]: Start difference. First operand 991 states and 1483 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:47,362 INFO L93 Difference]: Finished difference Result 2309 states and 3762 transitions. [2025-02-05 11:57:47,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:47,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 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 233 [2025-02-05 11:57:47,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:47,369 INFO L225 Difference]: With dead ends: 2309 [2025-02-05 11:57:47,369 INFO L226 Difference]: Without dead ends: 1649 [2025-02-05 11:57:47,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:47,371 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 343 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:47,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 155 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:57:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-02-05 11:57:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2025-02-05 11:57:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1648 states have (on average 1.4453883495145632) internal successors, (2382), 1648 states have internal predecessors, (2382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2382 transitions. [2025-02-05 11:57:47,410 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2382 transitions. Word has length 233 [2025-02-05 11:57:47,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:47,410 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2382 transitions. [2025-02-05 11:57:47,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:47,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2382 transitions. [2025-02-05 11:57:47,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-02-05 11:57:47,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:47,417 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:57:47,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:57:47,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:47,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1323157396, now seen corresponding path program 1 times [2025-02-05 11:57:47,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:47,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029953371] [2025-02-05 11:57:47,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:47,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:47,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-02-05 11:57:47,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-02-05 11:57:47,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:47,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 11:57:47,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:47,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029953371] [2025-02-05 11:57:47,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029953371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:47,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:47,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:47,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064428320] [2025-02-05 11:57:47,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:47,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:47,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:47,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:47,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:47,663 INFO L87 Difference]: Start difference. First operand 1649 states and 2382 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:48,686 INFO L93 Difference]: Finished difference Result 3625 states and 5415 transitions. [2025-02-05 11:57:48,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:48,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 344 [2025-02-05 11:57:48,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:48,693 INFO L225 Difference]: With dead ends: 3625 [2025-02-05 11:57:48,693 INFO L226 Difference]: Without dead ends: 1978 [2025-02-05 11:57:48,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:48,695 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 271 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:48,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 539 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:57:48,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2025-02-05 11:57:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2025-02-05 11:57:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1978 states, 1977 states have (on average 1.1335356600910471) internal successors, (2241), 1977 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2241 transitions. [2025-02-05 11:57:48,740 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2241 transitions. Word has length 344 [2025-02-05 11:57:48,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:48,740 INFO L471 AbstractCegarLoop]: Abstraction has 1978 states and 2241 transitions. [2025-02-05 11:57:48,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:48,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2241 transitions. [2025-02-05 11:57:48,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-02-05 11:57:48,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:48,747 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:57:48,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:57:48,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:48,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:48,748 INFO L85 PathProgramCache]: Analyzing trace with hash -819425650, now seen corresponding path program 1 times [2025-02-05 11:57:48,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:48,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037721235] [2025-02-05 11:57:48,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:48,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:48,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-02-05 11:57:48,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-02-05 11:57:48,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:48,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:48,952 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-02-05 11:57:48,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:48,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037721235] [2025-02-05 11:57:48,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037721235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:48,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:48,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:57:48,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097519933] [2025-02-05 11:57:48,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:48,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:48,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:48,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:48,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:48,954 INFO L87 Difference]: Start difference. First operand 1978 states and 2241 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:49,623 INFO L93 Difference]: Finished difference Result 3954 states and 4508 transitions. [2025-02-05 11:57:49,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:49,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 362 [2025-02-05 11:57:49,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:49,629 INFO L225 Difference]: With dead ends: 3954 [2025-02-05 11:57:49,630 INFO L226 Difference]: Without dead ends: 2307 [2025-02-05 11:57:49,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:49,632 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 262 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:49,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 31 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:57:49,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-02-05 11:57:49,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-02-05 11:57:49,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.092801387684302) internal successors, (2520), 2306 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 2520 transitions. [2025-02-05 11:57:49,684 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 2520 transitions. Word has length 362 [2025-02-05 11:57:49,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:49,685 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 2520 transitions. [2025-02-05 11:57:49,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:49,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 2520 transitions. [2025-02-05 11:57:49,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2025-02-05 11:57:49,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:49,694 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:57:49,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:57:49,694 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:49,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:49,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1321980855, now seen corresponding path program 1 times [2025-02-05 11:57:49,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:49,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608561792] [2025-02-05 11:57:49,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:49,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:49,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 620 statements into 1 equivalence classes. [2025-02-05 11:57:49,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 620 of 620 statements. [2025-02-05 11:57:49,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:49,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-02-05 11:57:50,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:50,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608561792] [2025-02-05 11:57:50,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608561792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:50,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:50,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:50,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430409581] [2025-02-05 11:57:50,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:50,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:57:50,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:50,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:57:50,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:57:50,489 INFO L87 Difference]: Start difference. First operand 2307 states and 2520 transitions. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:51,164 INFO L93 Difference]: Finished difference Result 4612 states and 5050 transitions. [2025-02-05 11:57:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:51,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 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 620 [2025-02-05 11:57:51,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:51,174 INFO L225 Difference]: With dead ends: 4612 [2025-02-05 11:57:51,174 INFO L226 Difference]: Without dead ends: 2636 [2025-02-05 11:57:51,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:57:51,178 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 301 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:51,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 105 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:57:51,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-02-05 11:57:51,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2025-02-05 11:57:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.0827324478178368) internal successors, (2853), 2635 states have internal predecessors, (2853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 2853 transitions. [2025-02-05 11:57:51,212 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 2853 transitions. Word has length 620 [2025-02-05 11:57:51,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:51,212 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 2853 transitions. [2025-02-05 11:57:51,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 2853 transitions. [2025-02-05 11:57:51,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2025-02-05 11:57:51,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:51,221 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:57:51,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:57:51,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:51,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:51,222 INFO L85 PathProgramCache]: Analyzing trace with hash 716665565, now seen corresponding path program 1 times [2025-02-05 11:57:51,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:51,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212006686] [2025-02-05 11:57:51,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:51,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:51,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 628 statements into 1 equivalence classes. [2025-02-05 11:57:51,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 628 of 628 statements. [2025-02-05 11:57:51,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:51,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-02-05 11:57:51,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:51,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212006686] [2025-02-05 11:57:51,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212006686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:51,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:51,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:51,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940297978] [2025-02-05 11:57:51,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:51,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:51,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:51,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:51,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:51,531 INFO L87 Difference]: Start difference. First operand 2636 states and 2853 transitions. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:52,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:52,242 INFO L93 Difference]: Finished difference Result 6257 states and 6842 transitions. [2025-02-05 11:57:52,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:52,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 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 628 [2025-02-05 11:57:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:52,255 INFO L225 Difference]: With dead ends: 6257 [2025-02-05 11:57:52,256 INFO L226 Difference]: Without dead ends: 4281 [2025-02-05 11:57:52,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:52,258 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 237 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:52,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 36 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:57:52,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2025-02-05 11:57:52,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4281. [2025-02-05 11:57:52,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.077570093457944) internal successors, (4612), 4280 states have internal predecessors, (4612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:52,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 4612 transitions. [2025-02-05 11:57:52,307 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 4612 transitions. Word has length 628 [2025-02-05 11:57:52,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:52,307 INFO L471 AbstractCegarLoop]: Abstraction has 4281 states and 4612 transitions. [2025-02-05 11:57:52,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 4612 transitions. [2025-02-05 11:57:52,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 922 [2025-02-05 11:57:52,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:52,318 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:57:52,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:57:52,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:52,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:52,319 INFO L85 PathProgramCache]: Analyzing trace with hash 338996644, now seen corresponding path program 1 times [2025-02-05 11:57:52,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:52,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146699924] [2025-02-05 11:57:52,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:52,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:52,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 921 statements into 1 equivalence classes. [2025-02-05 11:57:52,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 921 of 921 statements. [2025-02-05 11:57:52,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:52,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:53,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1813 backedges. 917 proven. 214 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2025-02-05 11:57:53,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:53,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146699924] [2025-02-05 11:57:53,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146699924] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:57:53,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081712212] [2025-02-05 11:57:53,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:53,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:57:53,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:57:53,305 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:57:53,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:57:53,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 921 statements into 1 equivalence classes. [2025-02-05 11:57:53,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 921 of 921 statements. [2025-02-05 11:57:53,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:53,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:53,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:57:53,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:57:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1813 backedges. 917 proven. 0 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2025-02-05 11:57:54,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:57:54,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081712212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:54,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:57:54,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-05 11:57:54,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945530347] [2025-02-05 11:57:54,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:54,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:54,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:54,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:54,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:57:54,098 INFO L87 Difference]: Start difference. First operand 4281 states and 4612 transitions. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 2 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:54,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:54,757 INFO L93 Difference]: Finished difference Result 9876 states and 10701 transitions. [2025-02-05 11:57:54,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:54,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 2 states have internal predecessors, (389), 0 states have call successors, (0), 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 921 [2025-02-05 11:57:54,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:54,769 INFO L225 Difference]: With dead ends: 9876 [2025-02-05 11:57:54,769 INFO L226 Difference]: Without dead ends: 6255 [2025-02-05 11:57:54,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 920 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:57:54,773 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 93 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:54,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 86 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:57:54,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6255 states. [2025-02-05 11:57:54,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 6255. [2025-02-05 11:57:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6255 states, 6254 states have (on average 1.066677326511033) internal successors, (6671), 6254 states have internal predecessors, (6671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:54,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 6671 transitions. [2025-02-05 11:57:54,835 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 6671 transitions. Word has length 921 [2025-02-05 11:57:54,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:54,836 INFO L471 AbstractCegarLoop]: Abstraction has 6255 states and 6671 transitions. [2025-02-05 11:57:54,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 2 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:54,836 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 6671 transitions. [2025-02-05 11:57:54,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 952 [2025-02-05 11:57:54,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:54,843 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:57:54,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 11:57:55,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:57:55,045 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:55,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:55,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1256513969, now seen corresponding path program 1 times [2025-02-05 11:57:55,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:55,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670104498] [2025-02-05 11:57:55,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:55,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:55,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 951 statements into 1 equivalence classes. [2025-02-05 11:57:55,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 951 of 951 statements. [2025-02-05 11:57:55,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:55,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1841 backedges. 1282 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-02-05 11:57:55,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:55,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670104498] [2025-02-05 11:57:55,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670104498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:55,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:55,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:55,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989078485] [2025-02-05 11:57:55,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:55,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:55,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:55,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:55,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:55,911 INFO L87 Difference]: Start difference. First operand 6255 states and 6671 transitions. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:56,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:56,793 INFO L93 Difference]: Finished difference Result 13495 states and 14478 transitions. [2025-02-05 11:57:56,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:56,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 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 951 [2025-02-05 11:57:56,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:56,812 INFO L225 Difference]: With dead ends: 13495 [2025-02-05 11:57:56,812 INFO L226 Difference]: Without dead ends: 7900 [2025-02-05 11:57:56,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:56,820 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:56,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 428 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:57:56,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2025-02-05 11:57:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7571. [2025-02-05 11:57:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7571 states, 7570 states have (on average 1.0585204755614266) internal successors, (8013), 7570 states have internal predecessors, (8013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 8013 transitions. [2025-02-05 11:57:56,927 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 8013 transitions. Word has length 951 [2025-02-05 11:57:56,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:56,929 INFO L471 AbstractCegarLoop]: Abstraction has 7571 states and 8013 transitions. [2025-02-05 11:57:56,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:56,929 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 8013 transitions. [2025-02-05 11:57:56,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 953 [2025-02-05 11:57:56,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:56,944 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:57:56,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:57:56,944 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:56,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:56,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2137537179, now seen corresponding path program 1 times [2025-02-05 11:57:56,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:56,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100781736] [2025-02-05 11:57:56,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:56,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:57,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 952 statements into 1 equivalence classes. [2025-02-05 11:57:57,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 952 of 952 statements. [2025-02-05 11:57:57,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:57,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 1145 proven. 0 refuted. 0 times theorem prover too weak. 701 trivial. 0 not checked. [2025-02-05 11:57:57,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:57,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100781736] [2025-02-05 11:57:57,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100781736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:57,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:57,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:57,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183661053] [2025-02-05 11:57:57,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:57,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:57,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:57,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:57,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:57,661 INFO L87 Difference]: Start difference. First operand 7571 states and 8013 transitions. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:58,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:58,379 INFO L93 Difference]: Finished difference Result 15798 states and 16784 transitions. [2025-02-05 11:57:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:58,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 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 952 [2025-02-05 11:57:58,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:58,395 INFO L225 Difference]: With dead ends: 15798 [2025-02-05 11:57:58,395 INFO L226 Difference]: Without dead ends: 8887 [2025-02-05 11:57:58,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:58,400 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 205 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:58,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 52 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:57:58,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2025-02-05 11:57:58,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8887. [2025-02-05 11:57:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.0552554580238578) internal successors, (9377), 8886 states have internal predecessors, (9377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:58,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9377 transitions. [2025-02-05 11:57:58,463 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9377 transitions. Word has length 952 [2025-02-05 11:57:58,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:58,464 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 9377 transitions. [2025-02-05 11:57:58,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:58,465 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9377 transitions. [2025-02-05 11:57:58,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 978 [2025-02-05 11:57:58,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:58,474 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:57:58,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:57:58,475 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:58,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:58,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2083580159, now seen corresponding path program 1 times [2025-02-05 11:57:58,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:58,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018433365] [2025-02-05 11:57:58,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:58,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:58,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 977 statements into 1 equivalence classes. [2025-02-05 11:57:58,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 977 of 977 statements. [2025-02-05 11:57:58,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:58,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 827 proven. 0 refuted. 0 times theorem prover too weak. 701 trivial. 0 not checked. [2025-02-05 11:57:58,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:58,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018433365] [2025-02-05 11:57:58,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018433365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:58,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:58,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:58,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182643797] [2025-02-05 11:57:58,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:58,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:58,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:58,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:58,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:58,899 INFO L87 Difference]: Start difference. First operand 8887 states and 9377 transitions. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:59,557 INFO L93 Difference]: Finished difference Result 17114 states and 18088 transitions. [2025-02-05 11:57:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:59,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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 977 [2025-02-05 11:57:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:59,568 INFO L225 Difference]: With dead ends: 17114 [2025-02-05 11:57:59,568 INFO L226 Difference]: Without dead ends: 8887 [2025-02-05 11:57:59,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:59,573 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 95 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:59,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 377 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:57:59,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2025-02-05 11:57:59,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8887. [2025-02-05 11:57:59,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.0485032635606573) internal successors, (9317), 8886 states have internal predecessors, (9317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:59,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9317 transitions. [2025-02-05 11:57:59,628 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9317 transitions. Word has length 977 [2025-02-05 11:57:59,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:59,629 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 9317 transitions. [2025-02-05 11:57:59,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:57:59,629 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9317 transitions. [2025-02-05 11:57:59,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1081 [2025-02-05 11:57:59,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:59,639 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:57:59,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:57:59,640 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:59,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:59,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1037457230, now seen corresponding path program 1 times [2025-02-05 11:57:59,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:59,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762885758] [2025-02-05 11:57:59,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:59,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:59,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1080 statements into 1 equivalence classes. [2025-02-05 11:57:59,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1080 of 1080 statements. [2025-02-05 11:57:59,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:59,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2046 backedges. 1345 proven. 0 refuted. 0 times theorem prover too weak. 701 trivial. 0 not checked. [2025-02-05 11:58:00,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:00,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762885758] [2025-02-05 11:58:00,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762885758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:00,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:00,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 11:58:00,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127720854] [2025-02-05 11:58:00,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:00,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 11:58:00,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:00,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 11:58:00,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:58:00,580 INFO L87 Difference]: Start difference. First operand 8887 states and 9317 transitions. Second operand has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:01,463 INFO L93 Difference]: Finished difference Result 17115 states and 17969 transitions. [2025-02-05 11:58:01,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 11:58:01,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 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 1080 [2025-02-05 11:58:01,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:01,485 INFO L225 Difference]: With dead ends: 17115 [2025-02-05 11:58:01,485 INFO L226 Difference]: Without dead ends: 8888 [2025-02-05 11:58:01,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:58:01,497 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 505 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:01,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 562 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:58:01,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8888 states. [2025-02-05 11:58:01,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8888 to 8887. [2025-02-05 11:58:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.0477155075399505) internal successors, (9310), 8886 states have internal predecessors, (9310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9310 transitions. [2025-02-05 11:58:01,562 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9310 transitions. Word has length 1080 [2025-02-05 11:58:01,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:01,563 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 9310 transitions. [2025-02-05 11:58:01,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:01,563 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9310 transitions. [2025-02-05 11:58:01,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1084 [2025-02-05 11:58:01,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:01,574 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:01,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:58:01,575 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:01,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:01,575 INFO L85 PathProgramCache]: Analyzing trace with hash 132951756, now seen corresponding path program 1 times [2025-02-05 11:58:01,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:01,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876533988] [2025-02-05 11:58:01,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:01,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:01,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1083 statements into 1 equivalence classes. [2025-02-05 11:58:01,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1083 of 1083 statements. [2025-02-05 11:58:01,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:01,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2546 backedges. 1312 proven. 0 refuted. 0 times theorem prover too weak. 1234 trivial. 0 not checked. [2025-02-05 11:58:02,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:02,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876533988] [2025-02-05 11:58:02,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876533988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:02,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:02,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:58:02,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460544490] [2025-02-05 11:58:02,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:02,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:02,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:02,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:02,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:02,198 INFO L87 Difference]: Start difference. First operand 8887 states and 9310 transitions. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:02,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:02,787 INFO L93 Difference]: Finished difference Result 18101 states and 18956 transitions. [2025-02-05 11:58:02,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:58:02,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 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 1083 [2025-02-05 11:58:02,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:02,811 INFO L225 Difference]: With dead ends: 18101 [2025-02-05 11:58:02,811 INFO L226 Difference]: Without dead ends: 9874 [2025-02-05 11:58:02,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:02,819 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:02,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 438 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:58:02,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9874 states. [2025-02-05 11:58:02,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9874 to 9874. [2025-02-05 11:58:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9874 states, 9873 states have (on average 1.0436544110199535) internal successors, (10304), 9873 states have internal predecessors, (10304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 10304 transitions. [2025-02-05 11:58:02,891 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 10304 transitions. Word has length 1083 [2025-02-05 11:58:02,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:02,892 INFO L471 AbstractCegarLoop]: Abstraction has 9874 states and 10304 transitions. [2025-02-05 11:58:02,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 10304 transitions. [2025-02-05 11:58:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1095 [2025-02-05 11:58:02,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:02,935 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:58:02,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:58:02,935 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:02,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:02,936 INFO L85 PathProgramCache]: Analyzing trace with hash 630811752, now seen corresponding path program 1 times [2025-02-05 11:58:02,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:02,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366973460] [2025-02-05 11:58:02,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:02,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:02,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1094 statements into 1 equivalence classes. [2025-02-05 11:58:03,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1094 of 1094 statements. [2025-02-05 11:58:03,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:03,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1916 backedges. 1252 proven. 0 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2025-02-05 11:58:03,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:03,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366973460] [2025-02-05 11:58:03,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366973460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:03,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:03,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:58:03,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477699523] [2025-02-05 11:58:03,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:03,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:58:03,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:03,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:58:03,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:58:03,877 INFO L87 Difference]: Start difference. First operand 9874 states and 10304 transitions. Second operand has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:04,622 INFO L93 Difference]: Finished difference Result 19095 states and 19949 transitions. [2025-02-05 11:58:04,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 11:58:04,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 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 1094 [2025-02-05 11:58:04,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:04,641 INFO L225 Difference]: With dead ends: 19095 [2025-02-05 11:58:04,645 INFO L226 Difference]: Without dead ends: 9881 [2025-02-05 11:58:04,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:58:04,652 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:04,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 444 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:58:04,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9881 states. [2025-02-05 11:58:04,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9881 to 9874. [2025-02-05 11:58:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9874 states, 9873 states have (on average 1.043451838347007) internal successors, (10302), 9873 states have internal predecessors, (10302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:04,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 10302 transitions. [2025-02-05 11:58:04,718 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 10302 transitions. Word has length 1094 [2025-02-05 11:58:04,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:04,718 INFO L471 AbstractCegarLoop]: Abstraction has 9874 states and 10302 transitions. [2025-02-05 11:58:04,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:04,719 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 10302 transitions. [2025-02-05 11:58:04,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1102 [2025-02-05 11:58:04,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:04,729 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:04,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:58:04,729 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:04,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:04,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1761742907, now seen corresponding path program 1 times [2025-02-05 11:58:04,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:04,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129681572] [2025-02-05 11:58:04,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:04,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:04,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1101 statements into 1 equivalence classes. [2025-02-05 11:58:04,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1101 of 1101 statements. [2025-02-05 11:58:04,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:04,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2559 backedges. 866 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2025-02-05 11:58:05,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:05,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129681572] [2025-02-05 11:58:05,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129681572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:05,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:05,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:58:05,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901953117] [2025-02-05 11:58:05,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:05,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:05,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:05,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:05,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:05,132 INFO L87 Difference]: Start difference. First operand 9874 states and 10302 transitions. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:05,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:05,770 INFO L93 Difference]: Finished difference Result 19746 states and 20600 transitions. [2025-02-05 11:58:05,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:58:05,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 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 1101 [2025-02-05 11:58:05,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:05,779 INFO L225 Difference]: With dead ends: 19746 [2025-02-05 11:58:05,780 INFO L226 Difference]: Without dead ends: 9874 [2025-02-05 11:58:05,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:05,787 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 240 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:05,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 410 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:58:05,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9874 states. [2025-02-05 11:58:05,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9874 to 9216. [2025-02-05 11:58:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9216 states, 9215 states have (on average 1.0341833966359197) internal successors, (9530), 9215 states have internal predecessors, (9530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9530 transitions. [2025-02-05 11:58:05,847 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 9530 transitions. Word has length 1101 [2025-02-05 11:58:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:05,848 INFO L471 AbstractCegarLoop]: Abstraction has 9216 states and 9530 transitions. [2025-02-05 11:58:05,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:05,848 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 9530 transitions. [2025-02-05 11:58:05,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2025-02-05 11:58:05,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:05,860 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:05,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:58:05,860 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:05,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:05,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1103913912, now seen corresponding path program 1 times [2025-02-05 11:58:05,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:05,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025788911] [2025-02-05 11:58:05,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:05,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:05,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1212 statements into 1 equivalence classes. [2025-02-05 11:58:05,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1212 of 1212 statements. [2025-02-05 11:58:05,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:05,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 2587 trivial. 0 not checked. [2025-02-05 11:58:06,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:06,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025788911] [2025-02-05 11:58:06,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025788911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:06,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:06,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:58:06,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151716344] [2025-02-05 11:58:06,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:06,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:58:06,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:06,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:58:06,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:58:06,410 INFO L87 Difference]: Start difference. First operand 9216 states and 9530 transitions. Second operand has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:07,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:07,580 INFO L93 Difference]: Finished difference Result 22386 states and 23210 transitions. [2025-02-05 11:58:07,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 11:58:07,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 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 1212 [2025-02-05 11:58:07,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:07,581 INFO L225 Difference]: With dead ends: 22386 [2025-02-05 11:58:07,581 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:58:07,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:58:07,590 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 624 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:07,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 41 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:58:07,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:58:07,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:58:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:07,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:58:07,591 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1212 [2025-02-05 11:58:07,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:07,591 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:58:07,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:58:07,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:58:07,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:58:07,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:58:07,596 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:07,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 11:58:07,900 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 11:58:07,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:58:07 BoogieIcfgContainer [2025-02-05 11:58:07,909 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 11:58:07,910 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 11:58:07,910 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 11:58:07,910 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 11:58:07,910 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:57:43" (3/4) ... [2025-02-05 11:58:07,911 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 11:58:07,927 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-05 11:58:07,928 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 11:58:07,931 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 11:58:07,932 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 11:58:08,048 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 11:58:08,048 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 11:58:08,048 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 11:58:08,049 INFO L158 Benchmark]: Toolchain (without parser) took 27518.72ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 102.6MB in the beginning and 640.6MB in the end (delta: -538.0MB). Peak memory consumption was 571.5MB. Max. memory is 16.1GB. [2025-02-05 11:58:08,049 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 226.5MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 11:58:08,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.23ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 43.2MB in the end (delta: 59.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-05 11:58:08,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 146.69ms. Allocated memory is still 142.6MB. Free memory was 43.2MB in the beginning and 84.7MB in the end (delta: -41.5MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2025-02-05 11:58:08,050 INFO L158 Benchmark]: Boogie Preprocessor took 163.76ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 52.4MB in the end (delta: 32.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 11:58:08,050 INFO L158 Benchmark]: IcfgBuilder took 1790.44ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 52.4MB in the beginning and 130.2MB in the end (delta: -77.8MB). Peak memory consumption was 98.3MB. Max. memory is 16.1GB. [2025-02-05 11:58:08,050 INFO L158 Benchmark]: TraceAbstraction took 24727.37ms. Allocated memory was 302.0MB in the beginning and 1.2GB in the end (delta: 947.9MB). Free memory was 129.2MB in the beginning and 661.6MB in the end (delta: -532.3MB). Peak memory consumption was 412.2MB. Max. memory is 16.1GB. [2025-02-05 11:58:08,050 INFO L158 Benchmark]: Witness Printer took 138.85ms. Allocated memory is still 1.2GB. Free memory was 661.6MB in the beginning and 640.6MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 11:58:08,051 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.24ms. Allocated memory is still 226.5MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.23ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 43.2MB in the end (delta: 59.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 146.69ms. Allocated memory is still 142.6MB. Free memory was 43.2MB in the beginning and 84.7MB in the end (delta: -41.5MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 163.76ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 52.4MB in the end (delta: 32.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1790.44ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 52.4MB in the beginning and 130.2MB in the end (delta: -77.8MB). Peak memory consumption was 98.3MB. Max. memory is 16.1GB. * TraceAbstraction took 24727.37ms. Allocated memory was 302.0MB in the beginning and 1.2GB in the end (delta: 947.9MB). Free memory was 129.2MB in the beginning and 661.6MB in the end (delta: -532.3MB). Peak memory consumption was 412.2MB. Max. memory is 16.1GB. * Witness Printer took 138.85ms. Allocated memory is still 1.2GB. Free memory was 661.6MB in the beginning and 640.6MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. 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: 146]: 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, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.4s, OverallIterations: 15, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4906 SdHoareTripleChecker+Valid, 12.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4906 mSDsluCounter, 3800 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 228 mSDsCounter, 2204 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14234 IncrementalHoareTripleChecker+Invalid, 16438 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2204 mSolverCounterUnsat, 3572 mSDtfsCounter, 14234 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 978 GetRequests, 949 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9874occurred in iteration=12, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 995 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 12522 NumberOfCodeBlocks, 12522 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 12506 ConstructedInterpolants, 0 QuantifiedInterpolants, 27383 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1106 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 23211/23425 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: 1783]: Location Invariant Derived location invariant: (((((((((((a12 <= 7) && (a16 != 9)) && (a16 <= 11)) || ((a16 <= 8) && (a12 == 8))) || ((a15 == 3) && (7 == a12))) || (((a12 != 6) && (a15 <= 3)) && (0 <= ((long long) a18 + 155)))) || (((a12 != 6) && (a15 <= 3)) && (a16 != 9))) || ((a16 <= 8) && (0 <= ((long long) a18 + 155)))) || ((a15 <= 3) && (a12 == 8))) || ((a16 == 9) && (4 <= a15))) || (((a15 <= 3) && (0 <= ((long long) a18 + 155))) && (a16 != 9))) RESULT: Ultimate proved your program to be correct! [2025-02-05 11:58:08,064 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