./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label55.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/Problem11_label55.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 3ed93fbea5c4ce7662a30833852408f6a41bed2c847c0002d827dceaca299880 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:34:05,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:34:05,789 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:34:05,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:34:05,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:34:05,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:34:05,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:34:05,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:34:05,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:34:05,821 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:34:05,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:34:05,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:34:05,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:34:05,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:34:05,823 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:34:05,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:34:05,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:34:05,823 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:34:05,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:34:05,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:34:05,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:34:05,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:34:05,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:34:05,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:34:05,824 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:34:05,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:34:05,824 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:34:05,824 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:34:05,824 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:34:05,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:34:05,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:34:05,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:34:05,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:34:05,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:34:05,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:34:05,824 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:34:05,825 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:34:05,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:34:05,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:34:05,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:34:05,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:34:05,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:34:05,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:34:05,826 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 -> 3ed93fbea5c4ce7662a30833852408f6a41bed2c847c0002d827dceaca299880 [2025-02-05 11:34:06,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:34:06,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:34:06,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:34:06,080 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:34:06,080 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:34:06,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label55.c [2025-02-05 11:34:07,261 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0eb079c08/16f310ebd3364d74bb313e78932b2f71/FLAGf20a2639a [2025-02-05 11:34:07,578 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:34:07,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label55.c [2025-02-05 11:34:07,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0eb079c08/16f310ebd3364d74bb313e78932b2f71/FLAGf20a2639a [2025-02-05 11:34:07,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0eb079c08/16f310ebd3364d74bb313e78932b2f71 [2025-02-05 11:34:07,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:34:07,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:34:07,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:34:07,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:34:07,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:34:07,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:34:07" (1/1) ... [2025-02-05 11:34:07,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa8992a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:07, skipping insertion in model container [2025-02-05 11:34:07,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:34:07" (1/1) ... [2025-02-05 11:34:07,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:34:08,000 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/Problem11_label55.c[6546,6559] [2025-02-05 11:34:08,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:34:08,144 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:34:08,161 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/Problem11_label55.c[6546,6559] [2025-02-05 11:34:08,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:34:08,243 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:34:08,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:08 WrapperNode [2025-02-05 11:34:08,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:34:08,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:34:08,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:34:08,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:34:08,251 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:34:08" (1/1) ... [2025-02-05 11:34:08,276 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:34:08" (1/1) ... [2025-02-05 11:34:08,348 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-02-05 11:34:08,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:34:08,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:34:08,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:34:08,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:34:08,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:08" (1/1) ... [2025-02-05 11:34:08,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:08" (1/1) ... [2025-02-05 11:34:08,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:08" (1/1) ... [2025-02-05 11:34:08,418 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:34:08,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:08" (1/1) ... [2025-02-05 11:34:08,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:08" (1/1) ... [2025-02-05 11:34:08,444 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:08" (1/1) ... [2025-02-05 11:34:08,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:08" (1/1) ... [2025-02-05 11:34:08,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:08" (1/1) ... [2025-02-05 11:34:08,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:08" (1/1) ... [2025-02-05 11:34:08,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:34:08,474 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:34:08,474 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:34:08,475 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:34:08,475 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:08" (1/1) ... [2025-02-05 11:34:08,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:34:08,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:08,503 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:34:08,509 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:34:08,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:34:08,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:34:08,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:34:08,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:34:08,606 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:34:08,607 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:34:09,942 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-02-05 11:34:09,943 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:34:09,958 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:34:09,958 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:34:09,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:34:09 BoogieIcfgContainer [2025-02-05 11:34:09,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:34:09,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:34:09,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:34:09,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:34:09,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:34:07" (1/3) ... [2025-02-05 11:34:09,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519e36f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:34:09, skipping insertion in model container [2025-02-05 11:34:09,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:08" (2/3) ... [2025-02-05 11:34:09,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519e36f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:34:09, skipping insertion in model container [2025-02-05 11:34:09,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:34:09" (3/3) ... [2025-02-05 11:34:09,965 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label55.c [2025-02-05 11:34:09,976 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:34:09,978 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label55.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:34:10,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:34:10,036 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;@5b12ca2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:34:10,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:34:10,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 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:34:10,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 11:34:10,044 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:10,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:10,045 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:10,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:10,049 INFO L85 PathProgramCache]: Analyzing trace with hash -862516037, now seen corresponding path program 1 times [2025-02-05 11:34:10,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:10,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504234354] [2025-02-05 11:34:10,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:10,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:10,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 11:34:10,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 11:34:10,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:10,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:10,339 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:34:10,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:10,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504234354] [2025-02-05 11:34:10,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504234354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:10,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:10,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:34:10,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572455906] [2025-02-05 11:34:10,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:10,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:10,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:10,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:10,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:10,363 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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:34:11,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:11,294 INFO L93 Difference]: Finished difference Result 761 states and 1342 transitions. [2025-02-05 11:34:11,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:11,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-02-05 11:34:11,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:11,307 INFO L225 Difference]: With dead ends: 761 [2025-02-05 11:34:11,307 INFO L226 Difference]: Without dead ends: 413 [2025-02-05 11:34:11,311 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:34:11,313 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 183 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:11,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 223 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:34:11,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-02-05 11:34:11,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-02-05 11:34:11,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 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:34:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2025-02-05 11:34:11,364 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 45 [2025-02-05 11:34:11,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:11,365 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2025-02-05 11:34:11,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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:34:11,365 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2025-02-05 11:34:11,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 11:34:11,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:11,369 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:34:11,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:34:11,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:11,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:11,371 INFO L85 PathProgramCache]: Analyzing trace with hash 152497125, now seen corresponding path program 1 times [2025-02-05 11:34:11,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:11,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467823566] [2025-02-05 11:34:11,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:11,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:11,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 11:34:11,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 11:34:11,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:11,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:11,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:11,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467823566] [2025-02-05 11:34:11,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467823566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:11,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:11,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:34:11,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329642023] [2025-02-05 11:34:11,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:11,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:11,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:11,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:11,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:11,624 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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:34:12,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:12,323 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2025-02-05 11:34:12,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:12,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-02-05 11:34:12,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:12,327 INFO L225 Difference]: With dead ends: 1211 [2025-02-05 11:34:12,327 INFO L226 Difference]: Without dead ends: 800 [2025-02-05 11:34:12,328 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:34:12,329 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:12,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 119 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:34:12,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-02-05 11:34:12,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2025-02-05 11:34:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3756345177664975) internal successors, (1084), 788 states have internal predecessors, (1084), 0 states have call successors, (0), 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:34:12,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2025-02-05 11:34:12,373 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 113 [2025-02-05 11:34:12,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:12,373 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2025-02-05 11:34:12,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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:34:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2025-02-05 11:34:12,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 11:34:12,375 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:12,376 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:34:12,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:34:12,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:12,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:12,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1276257423, now seen corresponding path program 1 times [2025-02-05 11:34:12,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:12,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197848113] [2025-02-05 11:34:12,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:12,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:12,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 11:34:12,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 11:34:12,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:12,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:12,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:12,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197848113] [2025-02-05 11:34:12,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197848113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:12,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:12,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:12,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593655648] [2025-02-05 11:34:12,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:12,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:12,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:12,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:12,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:12,851 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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:34:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:13,895 INFO L93 Difference]: Finished difference Result 2505 states and 3428 transitions. [2025-02-05 11:34:13,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:13,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2025-02-05 11:34:13,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:13,902 INFO L225 Difference]: With dead ends: 2505 [2025-02-05 11:34:13,902 INFO L226 Difference]: Without dead ends: 1718 [2025-02-05 11:34:13,905 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:34:13,905 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 486 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:13,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 218 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:34:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2025-02-05 11:34:13,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1714. [2025-02-05 11:34:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1713 states have (on average 1.2265032107413893) internal successors, (2101), 1713 states have internal predecessors, (2101), 0 states have call successors, (0), 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:34:13,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2101 transitions. [2025-02-05 11:34:13,933 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2101 transitions. Word has length 114 [2025-02-05 11:34:13,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:13,933 INFO L471 AbstractCegarLoop]: Abstraction has 1714 states and 2101 transitions. [2025-02-05 11:34:13,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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:34:13,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2101 transitions. [2025-02-05 11:34:13,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-05 11:34:13,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:13,936 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:34:13,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:34:13,936 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:13,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:13,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2093563033, now seen corresponding path program 1 times [2025-02-05 11:34:13,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:13,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332169955] [2025-02-05 11:34:13,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:13,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:13,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 11:34:13,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 11:34:13,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:13,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:14,125 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:14,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:14,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332169955] [2025-02-05 11:34:14,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332169955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:14,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:14,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:14,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041656807] [2025-02-05 11:34:14,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:14,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:14,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:14,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:14,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:14,126 INFO L87 Difference]: Start difference. First operand 1714 states and 2101 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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:34:14,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:14,738 INFO L93 Difference]: Finished difference Result 4005 states and 5048 transitions. [2025-02-05 11:34:14,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:14,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2025-02-05 11:34:14,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:14,745 INFO L225 Difference]: With dead ends: 4005 [2025-02-05 11:34:14,746 INFO L226 Difference]: Without dead ends: 2477 [2025-02-05 11:34:14,748 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:34:14,748 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 190 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:14,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:34:14,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2025-02-05 11:34:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2474. [2025-02-05 11:34:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2474 states, 2473 states have (on average 1.2308936514355033) internal successors, (3044), 2473 states have internal predecessors, (3044), 0 states have call successors, (0), 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:34:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3044 transitions. [2025-02-05 11:34:14,787 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3044 transitions. Word has length 172 [2025-02-05 11:34:14,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:14,788 INFO L471 AbstractCegarLoop]: Abstraction has 2474 states and 3044 transitions. [2025-02-05 11:34:14,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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:34:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3044 transitions. [2025-02-05 11:34:14,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-02-05 11:34:14,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:14,790 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:14,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:34:14,791 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:14,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:14,791 INFO L85 PathProgramCache]: Analyzing trace with hash -76806969, now seen corresponding path program 1 times [2025-02-05 11:34:14,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:14,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668968173] [2025-02-05 11:34:14,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:14,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:14,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-05 11:34:14,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-05 11:34:14,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:14,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:14,995 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:14,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:14,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668968173] [2025-02-05 11:34:14,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668968173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:14,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:14,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:14,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125315346] [2025-02-05 11:34:14,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:14,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:14,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:14,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:14,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:14,999 INFO L87 Difference]: Start difference. First operand 2474 states and 3044 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:15,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:15,627 INFO L93 Difference]: Finished difference Result 5885 states and 7350 transitions. [2025-02-05 11:34:15,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:15,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2025-02-05 11:34:15,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:15,637 INFO L225 Difference]: With dead ends: 5885 [2025-02-05 11:34:15,637 INFO L226 Difference]: Without dead ends: 3597 [2025-02-05 11:34:15,640 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:34:15,641 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:15,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 339 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:34:15,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3597 states. [2025-02-05 11:34:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 3397. [2025-02-05 11:34:15,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3397 states, 3396 states have (on average 1.2105418138987043) internal successors, (4111), 3396 states have internal predecessors, (4111), 0 states have call successors, (0), 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:34:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4111 transitions. [2025-02-05 11:34:15,696 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4111 transitions. Word has length 225 [2025-02-05 11:34:15,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:15,696 INFO L471 AbstractCegarLoop]: Abstraction has 3397 states and 4111 transitions. [2025-02-05 11:34:15,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:15,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4111 transitions. [2025-02-05 11:34:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-02-05 11:34:15,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:15,699 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:15,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:34:15,699 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:15,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:15,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1537202195, now seen corresponding path program 1 times [2025-02-05 11:34:15,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:15,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539873053] [2025-02-05 11:34:15,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:15,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:15,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-05 11:34:15,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-05 11:34:15,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:15,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:15,905 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 11:34:15,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:15,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539873053] [2025-02-05 11:34:15,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539873053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:15,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:15,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:15,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089807835] [2025-02-05 11:34:15,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:15,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:15,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:15,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:15,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:15,908 INFO L87 Difference]: Start difference. First operand 3397 states and 4111 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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:34:16,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:16,479 INFO L93 Difference]: Finished difference Result 7359 states and 8963 transitions. [2025-02-05 11:34:16,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:16,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 226 [2025-02-05 11:34:16,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:16,491 INFO L225 Difference]: With dead ends: 7359 [2025-02-05 11:34:16,491 INFO L226 Difference]: Without dead ends: 3964 [2025-02-05 11:34:16,495 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:34:16,497 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 157 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:16,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 346 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:34:16,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3964 states. [2025-02-05 11:34:16,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3964 to 3949. [2025-02-05 11:34:16,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3949 states, 3948 states have (on average 1.2099797365754812) internal successors, (4777), 3948 states have internal predecessors, (4777), 0 states have call successors, (0), 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:34:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 4777 transitions. [2025-02-05 11:34:16,558 INFO L78 Accepts]: Start accepts. Automaton has 3949 states and 4777 transitions. Word has length 226 [2025-02-05 11:34:16,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:16,559 INFO L471 AbstractCegarLoop]: Abstraction has 3949 states and 4777 transitions. [2025-02-05 11:34:16,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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:34:16,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3949 states and 4777 transitions. [2025-02-05 11:34:16,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-05 11:34:16,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:16,562 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:16,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:34:16,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:16,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:16,563 INFO L85 PathProgramCache]: Analyzing trace with hash 583746988, now seen corresponding path program 1 times [2025-02-05 11:34:16,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:16,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074970784] [2025-02-05 11:34:16,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:16,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:16,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 11:34:16,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 11:34:16,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:16,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-02-05 11:34:16,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:16,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074970784] [2025-02-05 11:34:16,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074970784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:16,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:16,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:16,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640925812] [2025-02-05 11:34:16,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:16,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:16,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:16,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:16,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:16,758 INFO L87 Difference]: Start difference. First operand 3949 states and 4777 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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:34:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:17,423 INFO L93 Difference]: Finished difference Result 8827 states and 10787 transitions. [2025-02-05 11:34:17,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:17,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 227 [2025-02-05 11:34:17,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:17,436 INFO L225 Difference]: With dead ends: 8827 [2025-02-05 11:34:17,436 INFO L226 Difference]: Without dead ends: 4880 [2025-02-05 11:34:17,441 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:34:17,442 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 152 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:17,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 379 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:34:17,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2025-02-05 11:34:17,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 4869. [2025-02-05 11:34:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4868 states have (on average 1.1949465899753493) internal successors, (5817), 4868 states have internal predecessors, (5817), 0 states have call successors, (0), 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:34:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 5817 transitions. [2025-02-05 11:34:17,520 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 5817 transitions. Word has length 227 [2025-02-05 11:34:17,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:17,520 INFO L471 AbstractCegarLoop]: Abstraction has 4869 states and 5817 transitions. [2025-02-05 11:34:17,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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:34:17,521 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 5817 transitions. [2025-02-05 11:34:17,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-02-05 11:34:17,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:17,525 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, 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, 1, 1, 1, 1, 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:34:17,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:34:17,525 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:17,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:17,526 INFO L85 PathProgramCache]: Analyzing trace with hash -812496226, now seen corresponding path program 1 times [2025-02-05 11:34:17,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:17,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968618707] [2025-02-05 11:34:17,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:17,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:17,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-02-05 11:34:17,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-02-05 11:34:17,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:17,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:17,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:17,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968618707] [2025-02-05 11:34:17,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968618707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:17,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:17,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:34:17,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004085831] [2025-02-05 11:34:17,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:17,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:17,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:17,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:17,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:17,863 INFO L87 Difference]: Start difference. First operand 4869 states and 5817 transitions. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 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:34:18,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:18,965 INFO L93 Difference]: Finished difference Result 15487 states and 18736 transitions. [2025-02-05 11:34:18,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:18,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2025-02-05 11:34:18,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:19,001 INFO L225 Difference]: With dead ends: 15487 [2025-02-05 11:34:19,001 INFO L226 Difference]: Without dead ends: 10620 [2025-02-05 11:34:19,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:19,012 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 291 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:19,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 209 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:34:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10620 states. [2025-02-05 11:34:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10620 to 10248. [2025-02-05 11:34:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10248 states, 10247 states have (on average 1.1745876842002538) internal successors, (12036), 10247 states have internal predecessors, (12036), 0 states have call successors, (0), 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:34:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10248 states to 10248 states and 12036 transitions. [2025-02-05 11:34:19,183 INFO L78 Accepts]: Start accepts. Automaton has 10248 states and 12036 transitions. Word has length 247 [2025-02-05 11:34:19,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:19,183 INFO L471 AbstractCegarLoop]: Abstraction has 10248 states and 12036 transitions. [2025-02-05 11:34:19,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 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:34:19,183 INFO L276 IsEmpty]: Start isEmpty. Operand 10248 states and 12036 transitions. [2025-02-05 11:34:19,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-02-05 11:34:19,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:19,187 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:19,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:34:19,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:19,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:19,188 INFO L85 PathProgramCache]: Analyzing trace with hash 752057431, now seen corresponding path program 1 times [2025-02-05 11:34:19,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:19,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047850064] [2025-02-05 11:34:19,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:19,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:19,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-05 11:34:19,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-05 11:34:19,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:19,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:19,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:19,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047850064] [2025-02-05 11:34:19,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047850064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:19,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:19,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:34:19,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679394792] [2025-02-05 11:34:19,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:19,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:19,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:19,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:19,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:19,437 INFO L87 Difference]: Start difference. First operand 10248 states and 12036 transitions. Second operand has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:20,643 INFO L93 Difference]: Finished difference Result 25302 states and 30134 transitions. [2025-02-05 11:34:20,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:20,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 257 [2025-02-05 11:34:20,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:20,675 INFO L225 Difference]: With dead ends: 25302 [2025-02-05 11:34:20,675 INFO L226 Difference]: Without dead ends: 15056 [2025-02-05 11:34:20,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:20,692 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 298 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:20,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 131 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:34:20,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15056 states. [2025-02-05 11:34:20,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15056 to 14673. [2025-02-05 11:34:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14673 states, 14672 states have (on average 1.1806161395856052) internal successors, (17322), 14672 states have internal predecessors, (17322), 0 states have call successors, (0), 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:34:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14673 states to 14673 states and 17322 transitions. [2025-02-05 11:34:20,908 INFO L78 Accepts]: Start accepts. Automaton has 14673 states and 17322 transitions. Word has length 257 [2025-02-05 11:34:20,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:20,908 INFO L471 AbstractCegarLoop]: Abstraction has 14673 states and 17322 transitions. [2025-02-05 11:34:20,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:20,910 INFO L276 IsEmpty]: Start isEmpty. Operand 14673 states and 17322 transitions. [2025-02-05 11:34:20,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-02-05 11:34:20,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:20,914 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:20,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:34:20,914 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:20,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:20,917 INFO L85 PathProgramCache]: Analyzing trace with hash 714009246, now seen corresponding path program 1 times [2025-02-05 11:34:20,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:20,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723027381] [2025-02-05 11:34:20,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:20,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:20,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-05 11:34:20,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-05 11:34:20,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:20,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-02-05 11:34:21,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:21,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723027381] [2025-02-05 11:34:21,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723027381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:21,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:21,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:21,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528607918] [2025-02-05 11:34:21,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:21,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:21,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:21,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:21,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:21,064 INFO L87 Difference]: Start difference. First operand 14673 states and 17322 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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:34:21,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:21,791 INFO L93 Difference]: Finished difference Result 34863 states and 41357 transitions. [2025-02-05 11:34:21,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:21,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 259 [2025-02-05 11:34:21,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:21,823 INFO L225 Difference]: With dead ends: 34863 [2025-02-05 11:34:21,823 INFO L226 Difference]: Without dead ends: 20192 [2025-02-05 11:34:21,837 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:34:21,838 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 155 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:21,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 376 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:34:21,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20192 states. [2025-02-05 11:34:22,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20192 to 19084. [2025-02-05 11:34:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19084 states, 19083 states have (on average 1.1640727348949327) internal successors, (22214), 19083 states have internal predecessors, (22214), 0 states have call successors, (0), 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:34:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19084 states to 19084 states and 22214 transitions. [2025-02-05 11:34:22,163 INFO L78 Accepts]: Start accepts. Automaton has 19084 states and 22214 transitions. Word has length 259 [2025-02-05 11:34:22,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:22,164 INFO L471 AbstractCegarLoop]: Abstraction has 19084 states and 22214 transitions. [2025-02-05 11:34:22,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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:34:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 19084 states and 22214 transitions. [2025-02-05 11:34:22,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-05 11:34:22,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:22,169 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, 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, 1, 1, 1, 1, 1, 1, 1, 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:34:22,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:34:22,170 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:22,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:22,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2132224676, now seen corresponding path program 1 times [2025-02-05 11:34:22,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:22,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178794667] [2025-02-05 11:34:22,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:22,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:22,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-05 11:34:22,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-05 11:34:22,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:22,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-05 11:34:22,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:22,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178794667] [2025-02-05 11:34:22,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178794667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:22,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:22,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:22,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455741689] [2025-02-05 11:34:22,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:22,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:22,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:22,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:22,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:22,363 INFO L87 Difference]: Start difference. First operand 19084 states and 22214 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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:34:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:23,116 INFO L93 Difference]: Finished difference Result 38178 states and 44450 transitions. [2025-02-05 11:34:23,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:23,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 264 [2025-02-05 11:34:23,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:23,145 INFO L225 Difference]: With dead ends: 38178 [2025-02-05 11:34:23,145 INFO L226 Difference]: Without dead ends: 19096 [2025-02-05 11:34:23,161 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:34:23,162 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 155 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:23,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 376 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:34:23,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19096 states. [2025-02-05 11:34:23,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19096 to 18899. [2025-02-05 11:34:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18899 states, 18898 states have (on average 1.137951105937136) internal successors, (21505), 18898 states have internal predecessors, (21505), 0 states have call successors, (0), 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:34:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18899 states to 18899 states and 21505 transitions. [2025-02-05 11:34:23,437 INFO L78 Accepts]: Start accepts. Automaton has 18899 states and 21505 transitions. Word has length 264 [2025-02-05 11:34:23,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:23,437 INFO L471 AbstractCegarLoop]: Abstraction has 18899 states and 21505 transitions. [2025-02-05 11:34:23,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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:34:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 18899 states and 21505 transitions. [2025-02-05 11:34:23,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-02-05 11:34:23,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:23,443 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:23,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:34:23,443 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:23,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:23,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1715316449, now seen corresponding path program 1 times [2025-02-05 11:34:23,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:23,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285744525] [2025-02-05 11:34:23,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:23,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:23,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-05 11:34:23,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-05 11:34:23,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:23,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:23,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:23,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285744525] [2025-02-05 11:34:23,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285744525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:23,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:23,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:23,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643333603] [2025-02-05 11:34:23,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:23,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:23,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:23,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:23,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:23,791 INFO L87 Difference]: Start difference. First operand 18899 states and 21505 transitions. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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:34:24,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:24,580 INFO L93 Difference]: Finished difference Result 34994 states and 39867 transitions. [2025-02-05 11:34:24,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:24,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 278 [2025-02-05 11:34:24,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:24,601 INFO L225 Difference]: With dead ends: 34994 [2025-02-05 11:34:24,602 INFO L226 Difference]: Without dead ends: 15545 [2025-02-05 11:34:24,615 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:34:24,615 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 213 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:24,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 164 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:34:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15545 states. [2025-02-05 11:34:24,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15545 to 12036. [2025-02-05 11:34:24,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12036 states, 12035 states have (on average 1.108350643955131) internal successors, (13339), 12035 states have internal predecessors, (13339), 0 states have call successors, (0), 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:34:24,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12036 states to 12036 states and 13339 transitions. [2025-02-05 11:34:24,730 INFO L78 Accepts]: Start accepts. Automaton has 12036 states and 13339 transitions. Word has length 278 [2025-02-05 11:34:24,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:24,732 INFO L471 AbstractCegarLoop]: Abstraction has 12036 states and 13339 transitions. [2025-02-05 11:34:24,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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:34:24,732 INFO L276 IsEmpty]: Start isEmpty. Operand 12036 states and 13339 transitions. [2025-02-05 11:34:24,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-02-05 11:34:24,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:24,739 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2025-02-05 11:34:24,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:34:24,739 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:24,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:24,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1880174490, now seen corresponding path program 1 times [2025-02-05 11:34:24,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:24,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909801018] [2025-02-05 11:34:24,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:24,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:24,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-05 11:34:24,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-05 11:34:24,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:24,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:24,881 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-02-05 11:34:24,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:24,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909801018] [2025-02-05 11:34:24,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909801018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:24,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:24,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:24,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487728648] [2025-02-05 11:34:24,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:24,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:24,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:24,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:24,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:24,883 INFO L87 Difference]: Start difference. First operand 12036 states and 13339 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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:34:25,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:25,355 INFO L93 Difference]: Finished difference Result 26093 states and 28922 transitions. [2025-02-05 11:34:25,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:25,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 312 [2025-02-05 11:34:25,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:25,371 INFO L225 Difference]: With dead ends: 26093 [2025-02-05 11:34:25,372 INFO L226 Difference]: Without dead ends: 14059 [2025-02-05 11:34:25,380 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:34:25,381 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 176 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:25,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 141 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:34:25,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14059 states. [2025-02-05 11:34:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14059 to 9454. [2025-02-05 11:34:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9454 states, 9453 states have (on average 1.1110758489368455) internal successors, (10503), 9453 states have internal predecessors, (10503), 0 states have call successors, (0), 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:34:25,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9454 states to 9454 states and 10503 transitions. [2025-02-05 11:34:25,490 INFO L78 Accepts]: Start accepts. Automaton has 9454 states and 10503 transitions. Word has length 312 [2025-02-05 11:34:25,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:25,491 INFO L471 AbstractCegarLoop]: Abstraction has 9454 states and 10503 transitions. [2025-02-05 11:34:25,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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:34:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 9454 states and 10503 transitions. [2025-02-05 11:34:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-02-05 11:34:25,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:25,496 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, 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, 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] [2025-02-05 11:34:25,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:34:25,497 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:25,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:25,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1143670294, now seen corresponding path program 1 times [2025-02-05 11:34:25,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:25,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241738009] [2025-02-05 11:34:25,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:25,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:25,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-05 11:34:25,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-05 11:34:25,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:25,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 205 proven. 97 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 11:34:26,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:26,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241738009] [2025-02-05 11:34:26,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241738009] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:34:26,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258118057] [2025-02-05 11:34:26,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:26,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:26,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:26,209 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:34:26,211 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:34:26,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-05 11:34:26,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-05 11:34:26,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:26,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:26,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:34:26,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:34:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 11:34:26,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:34:26,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258118057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:26,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:34:26,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:34:26,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819391636] [2025-02-05 11:34:26,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:26,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:26,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:26,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:26,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:34:26,830 INFO L87 Difference]: Start difference. First operand 9454 states and 10503 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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:34:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:27,553 INFO L93 Difference]: Finished difference Result 21857 states and 24244 transitions. [2025-02-05 11:34:27,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:27,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 332 [2025-02-05 11:34:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:27,567 INFO L225 Difference]: With dead ends: 21857 [2025-02-05 11:34:27,567 INFO L226 Difference]: Without dead ends: 12405 [2025-02-05 11:34:27,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:34:27,575 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 293 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:27,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 148 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:34:27,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12405 states. [2025-02-05 11:34:27,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12405 to 12219. [2025-02-05 11:34:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12219 states, 12218 states have (on average 1.1081191684400065) internal successors, (13539), 12218 states have internal predecessors, (13539), 0 states have call successors, (0), 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:34:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12219 states to 12219 states and 13539 transitions. [2025-02-05 11:34:27,710 INFO L78 Accepts]: Start accepts. Automaton has 12219 states and 13539 transitions. Word has length 332 [2025-02-05 11:34:27,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:27,710 INFO L471 AbstractCegarLoop]: Abstraction has 12219 states and 13539 transitions. [2025-02-05 11:34:27,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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:34:27,710 INFO L276 IsEmpty]: Start isEmpty. Operand 12219 states and 13539 transitions. [2025-02-05 11:34:27,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-02-05 11:34:27,717 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:27,717 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, 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, 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] [2025-02-05 11:34:27,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 11:34:27,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-05 11:34:27,918 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:27,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:27,918 INFO L85 PathProgramCache]: Analyzing trace with hash 696103069, now seen corresponding path program 1 times [2025-02-05 11:34:27,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:27,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254800150] [2025-02-05 11:34:27,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:27,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:27,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-02-05 11:34:27,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-02-05 11:34:27,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:27,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-05 11:34:28,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:28,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254800150] [2025-02-05 11:34:28,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254800150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:28,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:28,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:34:28,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446365643] [2025-02-05 11:34:28,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:28,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:28,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:28,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:28,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:28,246 INFO L87 Difference]: Start difference. First operand 12219 states and 13539 transitions. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 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:34:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:29,290 INFO L93 Difference]: Finished difference Result 28683 states and 31733 transitions. [2025-02-05 11:34:29,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:29,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 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 354 [2025-02-05 11:34:29,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:29,306 INFO L225 Difference]: With dead ends: 28683 [2025-02-05 11:34:29,306 INFO L226 Difference]: Without dead ends: 14988 [2025-02-05 11:34:29,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:29,316 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 292 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:29,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 365 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:34:29,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14988 states. [2025-02-05 11:34:29,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14988 to 10738. [2025-02-05 11:34:29,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10738 states, 10737 states have (on average 1.098444630716215) internal successors, (11794), 10737 states have internal predecessors, (11794), 0 states have call successors, (0), 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:34:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10738 states to 10738 states and 11794 transitions. [2025-02-05 11:34:29,424 INFO L78 Accepts]: Start accepts. Automaton has 10738 states and 11794 transitions. Word has length 354 [2025-02-05 11:34:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:29,425 INFO L471 AbstractCegarLoop]: Abstraction has 10738 states and 11794 transitions. [2025-02-05 11:34:29,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 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:34:29,425 INFO L276 IsEmpty]: Start isEmpty. Operand 10738 states and 11794 transitions. [2025-02-05 11:34:29,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-02-05 11:34:29,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:29,432 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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] [2025-02-05 11:34:29,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:34:29,432 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:29,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:29,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1929628410, now seen corresponding path program 1 times [2025-02-05 11:34:29,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:29,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797503318] [2025-02-05 11:34:29,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:29,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:29,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-02-05 11:34:29,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-02-05 11:34:29,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:29,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 11:34:29,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:29,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797503318] [2025-02-05 11:34:29,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797503318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:29,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:29,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:29,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507279553] [2025-02-05 11:34:29,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:29,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:29,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:29,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:29,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:29,626 INFO L87 Difference]: Start difference. First operand 10738 states and 11794 transitions. Second operand has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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:34:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:30,339 INFO L93 Difference]: Finished difference Result 28669 states and 31444 transitions. [2025-02-05 11:34:30,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:30,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 402 [2025-02-05 11:34:30,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:30,357 INFO L225 Difference]: With dead ends: 28669 [2025-02-05 11:34:30,357 INFO L226 Difference]: Without dead ends: 17749 [2025-02-05 11:34:30,366 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:34:30,367 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 205 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:30,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 77 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:34:30,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17749 states. [2025-02-05 11:34:30,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17749 to 16268. [2025-02-05 11:34:30,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16268 states, 16267 states have (on average 1.0970062088891621) internal successors, (17845), 16267 states have internal predecessors, (17845), 0 states have call successors, (0), 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:34:30,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16268 states to 16268 states and 17845 transitions. [2025-02-05 11:34:30,506 INFO L78 Accepts]: Start accepts. Automaton has 16268 states and 17845 transitions. Word has length 402 [2025-02-05 11:34:30,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:30,506 INFO L471 AbstractCegarLoop]: Abstraction has 16268 states and 17845 transitions. [2025-02-05 11:34:30,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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:34:30,506 INFO L276 IsEmpty]: Start isEmpty. Operand 16268 states and 17845 transitions. [2025-02-05 11:34:30,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-02-05 11:34:30,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:30,516 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, 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, 3, 3, 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] [2025-02-05 11:34:30,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 11:34:30,516 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:30,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:30,517 INFO L85 PathProgramCache]: Analyzing trace with hash 324587502, now seen corresponding path program 1 times [2025-02-05 11:34:30,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:30,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939780719] [2025-02-05 11:34:30,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:30,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:30,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-02-05 11:34:30,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-02-05 11:34:30,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:30,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 555 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-05 11:34:30,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:30,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939780719] [2025-02-05 11:34:30,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939780719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:30,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:30,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:30,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152835429] [2025-02-05 11:34:30,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:30,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:30,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:30,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:30,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:30,694 INFO L87 Difference]: Start difference. First operand 16268 states and 17845 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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:34:31,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:31,149 INFO L93 Difference]: Finished difference Result 34558 states and 37964 transitions. [2025-02-05 11:34:31,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:31,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 449 [2025-02-05 11:34:31,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:31,167 INFO L225 Difference]: With dead ends: 34558 [2025-02-05 11:34:31,167 INFO L226 Difference]: Without dead ends: 18660 [2025-02-05 11:34:31,178 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:34:31,178 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 107 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:31,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 361 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:34:31,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18660 states. [2025-02-05 11:34:31,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18660 to 17372. [2025-02-05 11:34:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17372 states, 17371 states have (on average 1.0932013125323816) internal successors, (18990), 17371 states have internal predecessors, (18990), 0 states have call successors, (0), 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:34:31,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17372 states to 17372 states and 18990 transitions. [2025-02-05 11:34:31,356 INFO L78 Accepts]: Start accepts. Automaton has 17372 states and 18990 transitions. Word has length 449 [2025-02-05 11:34:31,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:31,356 INFO L471 AbstractCegarLoop]: Abstraction has 17372 states and 18990 transitions. [2025-02-05 11:34:31,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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:34:31,356 INFO L276 IsEmpty]: Start isEmpty. Operand 17372 states and 18990 transitions. [2025-02-05 11:34:31,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-05 11:34:31,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:31,366 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:34:31,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:34:31,367 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:31,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2061685435, now seen corresponding path program 1 times [2025-02-05 11:34:31,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:31,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266956534] [2025-02-05 11:34:31,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:31,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:31,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 11:34:31,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 11:34:31,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:31,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:32,141 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 154 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:32,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:32,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266956534] [2025-02-05 11:34:32,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266956534] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:34:32,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428017263] [2025-02-05 11:34:32,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:32,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:32,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:32,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:34:32,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 11:34:32,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 11:34:32,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 11:34:32,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:32,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:32,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 11:34:32,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:34:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 154 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:33,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:34:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 218 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:36,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428017263] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:34:36,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:34:36,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-05 11:34:36,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559556964] [2025-02-05 11:34:36,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:34:36,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 11:34:36,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:36,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 11:34:36,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-02-05 11:34:36,326 INFO L87 Difference]: Start difference. First operand 17372 states and 18990 transitions. Second operand has 13 states, 13 states have (on average 102.0) internal successors, (1326), 12 states have internal predecessors, (1326), 0 states have call successors, (0), 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:34:39,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:39,361 INFO L93 Difference]: Finished difference Result 39719 states and 43469 transitions. [2025-02-05 11:34:39,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 11:34:39,362 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 102.0) internal successors, (1326), 12 states have internal predecessors, (1326), 0 states have call successors, (0), 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 457 [2025-02-05 11:34:39,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:39,385 INFO L225 Difference]: With dead ends: 39719 [2025-02-05 11:34:39,385 INFO L226 Difference]: Without dead ends: 22533 [2025-02-05 11:34:39,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 906 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2025-02-05 11:34:39,397 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 1305 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 5417 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1305 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 5863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 5417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:39,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1305 Valid, 196 Invalid, 5863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 5417 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 11:34:39,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22533 states. [2025-02-05 11:34:39,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22533 to 17188. [2025-02-05 11:34:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17188 states, 17187 states have (on average 1.0883225693838365) internal successors, (18705), 17187 states have internal predecessors, (18705), 0 states have call successors, (0), 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:34:39,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17188 states to 17188 states and 18705 transitions. [2025-02-05 11:34:39,552 INFO L78 Accepts]: Start accepts. Automaton has 17188 states and 18705 transitions. Word has length 457 [2025-02-05 11:34:39,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:39,553 INFO L471 AbstractCegarLoop]: Abstraction has 17188 states and 18705 transitions. [2025-02-05 11:34:39,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 102.0) internal successors, (1326), 12 states have internal predecessors, (1326), 0 states have call successors, (0), 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:34:39,553 INFO L276 IsEmpty]: Start isEmpty. Operand 17188 states and 18705 transitions. [2025-02-05 11:34:39,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2025-02-05 11:34:39,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:39,567 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:34:39,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 11:34:39,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 11:34:39,767 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:39,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:39,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1422034895, now seen corresponding path program 1 times [2025-02-05 11:34:39,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:39,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78511073] [2025-02-05 11:34:39,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:39,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:39,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-02-05 11:34:39,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-02-05 11:34:39,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:39,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:39,989 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 675 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-02-05 11:34:39,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:39,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78511073] [2025-02-05 11:34:39,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78511073] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:39,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:39,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:39,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971182857] [2025-02-05 11:34:39,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:39,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:39,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:39,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:39,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:39,990 INFO L87 Difference]: Start difference. First operand 17188 states and 18705 transitions. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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:34:40,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:40,679 INFO L93 Difference]: Finished difference Result 33091 states and 36016 transitions. [2025-02-05 11:34:40,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:40,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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 547 [2025-02-05 11:34:40,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:40,694 INFO L225 Difference]: With dead ends: 33091 [2025-02-05 11:34:40,694 INFO L226 Difference]: Without dead ends: 18485 [2025-02-05 11:34:40,701 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:34:40,702 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 178 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:40,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 78 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:34:40,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18485 states. [2025-02-05 11:34:40,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18485 to 17004. [2025-02-05 11:34:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17004 states, 17003 states have (on average 1.0878668470269952) internal successors, (18497), 17003 states have internal predecessors, (18497), 0 states have call successors, (0), 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:34:40,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17004 states to 17004 states and 18497 transitions. [2025-02-05 11:34:40,834 INFO L78 Accepts]: Start accepts. Automaton has 17004 states and 18497 transitions. Word has length 547 [2025-02-05 11:34:40,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:40,834 INFO L471 AbstractCegarLoop]: Abstraction has 17004 states and 18497 transitions. [2025-02-05 11:34:40,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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:34:40,834 INFO L276 IsEmpty]: Start isEmpty. Operand 17004 states and 18497 transitions. [2025-02-05 11:34:40,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2025-02-05 11:34:40,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:40,845 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:40,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 11:34:40,846 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:40,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:40,846 INFO L85 PathProgramCache]: Analyzing trace with hash -141967885, now seen corresponding path program 1 times [2025-02-05 11:34:40,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:40,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983677775] [2025-02-05 11:34:40,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:40,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:40,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 561 statements into 1 equivalence classes. [2025-02-05 11:34:40,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 561 of 561 statements. [2025-02-05 11:34:40,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:40,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:41,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2025-02-05 11:34:41,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:41,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983677775] [2025-02-05 11:34:41,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983677775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:41,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:41,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:41,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542309021] [2025-02-05 11:34:41,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:41,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:41,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:41,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:41,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:41,072 INFO L87 Difference]: Start difference. First operand 17004 states and 18497 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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:34:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:41,635 INFO L93 Difference]: Finished difference Result 32183 states and 34995 transitions. [2025-02-05 11:34:41,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:41,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 561 [2025-02-05 11:34:41,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:41,651 INFO L225 Difference]: With dead ends: 32183 [2025-02-05 11:34:41,651 INFO L226 Difference]: Without dead ends: 17576 [2025-02-05 11:34:41,662 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:34:41,662 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 105 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:41,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 160 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:34:41,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17576 states. [2025-02-05 11:34:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17576 to 10921. [2025-02-05 11:34:41,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10921 states, 10920 states have (on average 1.0845238095238094) internal successors, (11843), 10920 states have internal predecessors, (11843), 0 states have call successors, (0), 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:34:41,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10921 states to 10921 states and 11843 transitions. [2025-02-05 11:34:41,774 INFO L78 Accepts]: Start accepts. Automaton has 10921 states and 11843 transitions. Word has length 561 [2025-02-05 11:34:41,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:41,774 INFO L471 AbstractCegarLoop]: Abstraction has 10921 states and 11843 transitions. [2025-02-05 11:34:41,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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:34:41,774 INFO L276 IsEmpty]: Start isEmpty. Operand 10921 states and 11843 transitions. [2025-02-05 11:34:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2025-02-05 11:34:41,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:41,782 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:41,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 11:34:41,782 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:41,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:41,783 INFO L85 PathProgramCache]: Analyzing trace with hash 171970374, now seen corresponding path program 1 times [2025-02-05 11:34:41,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:41,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223143533] [2025-02-05 11:34:41,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:41,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:41,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 562 statements into 1 equivalence classes. [2025-02-05 11:34:41,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-02-05 11:34:41,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:41,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2025-02-05 11:34:41,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:41,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223143533] [2025-02-05 11:34:41,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223143533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:41,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:41,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:41,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387180002] [2025-02-05 11:34:41,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:41,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:41,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:41,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:41,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:41,972 INFO L87 Difference]: Start difference. First operand 10921 states and 11843 transitions. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 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:34:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:42,375 INFO L93 Difference]: Finished difference Result 22939 states and 24810 transitions. [2025-02-05 11:34:42,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:42,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 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 562 [2025-02-05 11:34:42,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:42,377 INFO L225 Difference]: With dead ends: 22939 [2025-02-05 11:34:42,377 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:34:42,384 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:34:42,385 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 101 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:42,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 130 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 11:34:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:34:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:34:42,385 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:34:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:34:42,386 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 562 [2025-02-05 11:34:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:42,386 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:34:42,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 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:34:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:34:42,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:34:42,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:34:42,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 11:34:42,391 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:42,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 11:34:48,154 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 11:34:48,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:34:48 BoogieIcfgContainer [2025-02-05 11:34:48,166 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 11:34:48,167 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 11:34:48,167 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 11:34:48,167 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 11:34:48,167 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:34:09" (3/4) ... [2025-02-05 11:34:48,169 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 11:34:48,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 11:34:48,189 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 11:34:48,190 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 11:34:48,191 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 11:34:48,317 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 11:34:48,317 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 11:34:48,317 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 11:34:48,318 INFO L158 Benchmark]: Toolchain (without parser) took 40491.51ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 120.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 479.0MB. Max. memory is 16.1GB. [2025-02-05 11:34:48,321 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 11:34:48,322 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.04ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 78.5MB in the end (delta: 42.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-05 11:34:48,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.60ms. Allocated memory is still 167.8MB. Free memory was 78.5MB in the beginning and 61.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 11:34:48,322 INFO L158 Benchmark]: Boogie Preprocessor took 123.77ms. Allocated memory is still 167.8MB. Free memory was 61.8MB in the beginning and 38.3MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 11:34:48,322 INFO L158 Benchmark]: IcfgBuilder took 1485.05ms. Allocated memory is still 167.8MB. Free memory was 38.3MB in the beginning and 99.1MB in the end (delta: -60.8MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2025-02-05 11:34:48,322 INFO L158 Benchmark]: TraceAbstraction took 38206.21ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 97.9MB in the beginning and 869.0MB in the end (delta: -771.1MB). Peak memory consumption was 937.8MB. Max. memory is 16.1GB. [2025-02-05 11:34:48,322 INFO L158 Benchmark]: Witness Printer took 150.84ms. Allocated memory is still 1.4GB. Free memory was 869.0MB in the beginning and 1.2GB in the end (delta: -343.1MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2025-02-05 11:34:48,323 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.28ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.04ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 78.5MB in the end (delta: 42.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.60ms. Allocated memory is still 167.8MB. Free memory was 78.5MB in the beginning and 61.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 123.77ms. Allocated memory is still 167.8MB. Free memory was 61.8MB in the beginning and 38.3MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1485.05ms. Allocated memory is still 167.8MB. Free memory was 38.3MB in the beginning and 99.1MB in the end (delta: -60.8MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * TraceAbstraction took 38206.21ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 97.9MB in the beginning and 869.0MB in the end (delta: -771.1MB). Peak memory consumption was 937.8MB. Max. memory is 16.1GB. * Witness Printer took 150.84ms. Allocated memory is still 1.4GB. Free memory was 869.0MB in the beginning and 1.2GB in the end (delta: -343.1MB). Peak memory consumption was 17.6MB. 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: 151]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.4s, OverallIterations: 21, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5322 SdHoareTripleChecker+Valid, 16.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5322 mSDsluCounter, 4858 SdHoareTripleChecker+Invalid, 13.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 764 mSDsCounter, 2383 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20475 IncrementalHoareTripleChecker+Invalid, 22858 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2383 mSolverCounterUnsat, 4094 mSDtfsCounter, 20475 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1319 GetRequests, 1268 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19084occurred in iteration=10, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 31104 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 7192 NumberOfCodeBlocks, 7192 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 7625 ConstructedInterpolants, 0 QuantifiedInterpolants, 31612 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1051 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 24 InterpolantComputations, 20 PerfectInterpolantSequences, 7562/8516 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: 1044]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((long long) a23 + 43) <= 0) && (a25 == 12)) && (a29 <= 220)) || (((((570382 <= a29) && (a25 <= 10)) && (a4 == 1)) && (312 <= a23)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 483831))) || ((((((long long) a29 + 193244) <= 0) && (a25 <= 10)) && (a4 == 1)) && (312 <= a23))) || (((((long long) a23 + 43) <= 0) && (a25 == 11)) && (a29 <= 130))) || (((307 <= a23) && (a4 == 1)) && (a25 == 10))) || (((((long long) a23 + 43) <= 0) && (((long long) a29 + 275824) <= 0)) && (a25 == 9))) || ((((a29 <= 275) && (a25 <= 10)) && (a23 <= 262)) && (a4 == 1))) || ((((a4 == 0) && (a25 <= 10)) && (((long long) a23 + 599772) <= 0)) && (a29 <= 130))) || (((a25 == 13) && (a4 == 0)) && (a23 <= 262))) || ((a25 == 11) && (a4 == 1))) || ((((a29 <= 140) && (a4 == 0)) && (a23 <= 262)) && (a25 == 9))) || (((a4 == 0) && (a25 == 10)) && (a29 <= 130))) || (((a29 <= 275) && (a25 == 12)) && (a4 == 0))) || ((a25 == 9) && (a4 == 1))) || (((a25 == 13) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 138096))) && (a4 == 1))) || (((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 == 11))) || (((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 == 9))) || (((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 == 10))) || (((a25 == 12) && (a23 <= 262)) && (a4 == 1))) || (((a25 == 12) && (a4 == 0)) && (a23 <= 262))) || (((((long long) a23 + 43) <= 0) && (a25 <= 10)) && (a4 == 1))) || (((a29 <= 277) && (a4 == 1)) && (a25 == 10))) || ((((a29 <= 140) && (a4 == 0)) && (a23 <= 262)) && (a25 == 10))) || (((a25 == 12) && (a29 <= 277)) && (a4 == 1))) || ((((a29 <= 275) && (a4 == 0)) && (a25 == 11)) && (a23 <= 262))) RESULT: Ultimate proved your program to be correct! [2025-02-05 11:34:48,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE