./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label39.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/Problem17_label39.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 0d7a1ac2bddd27216563c8e31b878b94b733d43befd074e50a1bdc6b73a7213c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:05:13,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:05:13,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:05:13,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:05:13,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:05:13,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:05:13,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:05:13,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:05:13,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:05:13,307 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:05:13,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:05:13,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:05:13,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:05:13,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:05:13,308 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:05:13,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:05:13,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:05:13,308 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:05:13,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:05:13,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:05:13,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:05:13,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:05:13,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:05:13,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:05:13,309 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:05:13,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:05:13,309 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:05:13,309 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:05:13,309 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:05:13,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:05:13,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:05:13,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:05:13,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:05:13,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:05:13,310 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:05:13,310 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:05:13,310 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:05:13,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:05:13,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:05:13,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:05:13,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:05:13,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:05:13,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:05:13,311 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 -> 0d7a1ac2bddd27216563c8e31b878b94b733d43befd074e50a1bdc6b73a7213c [2025-02-05 12:05:13,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:05:13,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:05:13,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:05:13,625 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:05:13,627 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:05:13,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label39.c [2025-02-05 12:05:15,015 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e514a951/f44a1665d84e4b588f6754a77d77bf78/FLAGab514c468 [2025-02-05 12:05:15,543 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:05:15,544 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label39.c [2025-02-05 12:05:15,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e514a951/f44a1665d84e4b588f6754a77d77bf78/FLAGab514c468 [2025-02-05 12:05:15,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e514a951/f44a1665d84e4b588f6754a77d77bf78 [2025-02-05 12:05:15,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:05:15,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:05:15,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:05:15,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:05:15,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:05:15,620 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:05:15" (1/1) ... [2025-02-05 12:05:15,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@203c7686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:15, skipping insertion in model container [2025-02-05 12:05:15,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:05:15" (1/1) ... [2025-02-05 12:05:15,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:05:15,902 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/Problem17_label39.c[9366,9379] [2025-02-05 12:05:16,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:05:16,343 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:05:16,393 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/Problem17_label39.c[9366,9379] [2025-02-05 12:05:16,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:05:16,625 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:05:16,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:16 WrapperNode [2025-02-05 12:05:16,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:05:16,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:05:16,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:05:16,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:05:16,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:16" (1/1) ... [2025-02-05 12:05:16,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:16" (1/1) ... [2025-02-05 12:05:16,988 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-02-05 12:05:16,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:05:16,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:05:16,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:05:16,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:05:16,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:16" (1/1) ... [2025-02-05 12:05:17,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:16" (1/1) ... [2025-02-05 12:05:17,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:16" (1/1) ... [2025-02-05 12:05:17,309 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 12:05:17,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:16" (1/1) ... [2025-02-05 12:05:17,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:16" (1/1) ... [2025-02-05 12:05:17,461 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:16" (1/1) ... [2025-02-05 12:05:17,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:16" (1/1) ... [2025-02-05 12:05:17,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:16" (1/1) ... [2025-02-05 12:05:17,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:16" (1/1) ... [2025-02-05 12:05:17,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:05:17,593 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:05:17,593 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:05:17,593 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:05:17,594 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:16" (1/1) ... [2025-02-05 12:05:17,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:05:17,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:05:17,632 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 12:05:17,636 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 12:05:17,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:05:17,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:05:17,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:05:17,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:05:17,738 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:05:17,740 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:05:21,738 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-02-05 12:05:21,885 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-02-05 12:05:21,886 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:05:21,929 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:05:21,929 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:05:21,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:05:21 BoogieIcfgContainer [2025-02-05 12:05:21,930 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:05:21,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:05:21,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:05:21,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:05:21,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:05:15" (1/3) ... [2025-02-05 12:05:21,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fa51c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:05:21, skipping insertion in model container [2025-02-05 12:05:21,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:16" (2/3) ... [2025-02-05 12:05:21,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fa51c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:05:21, skipping insertion in model container [2025-02-05 12:05:21,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:05:21" (3/3) ... [2025-02-05 12:05:21,940 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label39.c [2025-02-05 12:05:21,955 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:05:21,957 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label39.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:05:22,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:05:22,064 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;@67f2749, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:05:22,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:05:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 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 12:05:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 12:05:22,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:22,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:05:22,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:22,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:22,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1632605880, now seen corresponding path program 1 times [2025-02-05 12:05:22,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:22,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312472593] [2025-02-05 12:05:22,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:22,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:22,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 12:05:22,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 12:05:22,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:22,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:22,539 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 12:05:22,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:22,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312472593] [2025-02-05 12:05:22,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312472593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:22,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:22,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:05:22,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482060005] [2025-02-05 12:05:22,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:22,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:22,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:22,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:22,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:22,575 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 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 12:05:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:25,072 INFO L93 Difference]: Finished difference Result 1680 states and 3071 transitions. [2025-02-05 12:05:25,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:25,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-02-05 12:05:25,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:25,094 INFO L225 Difference]: With dead ends: 1680 [2025-02-05 12:05:25,094 INFO L226 Difference]: Without dead ends: 1011 [2025-02-05 12:05:25,098 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 12:05:25,100 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 518 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:25,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 220 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 12:05:25,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-02-05 12:05:25,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 996. [2025-02-05 12:05:25,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 995 states have (on average 1.735678391959799) internal successors, (1727), 995 states have internal predecessors, (1727), 0 states have call successors, (0), 0 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 12:05:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1727 transitions. [2025-02-05 12:05:25,187 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1727 transitions. Word has length 63 [2025-02-05 12:05:25,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:25,188 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1727 transitions. [2025-02-05 12:05:25,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 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 12:05:25,188 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1727 transitions. [2025-02-05 12:05:25,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 12:05:25,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:25,191 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, 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] [2025-02-05 12:05:25,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:05:25,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:25,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:25,192 INFO L85 PathProgramCache]: Analyzing trace with hash -729796910, now seen corresponding path program 1 times [2025-02-05 12:05:25,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:25,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175678926] [2025-02-05 12:05:25,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:25,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:25,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 12:05:25,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 12:05:25,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:25,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:05:25,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:25,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175678926] [2025-02-05 12:05:25,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175678926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:25,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:25,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:05:25,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004505484] [2025-02-05 12:05:25,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:25,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:25,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:25,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:25,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:25,587 INFO L87 Difference]: Start difference. First operand 996 states and 1727 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 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 12:05:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:27,659 INFO L93 Difference]: Finished difference Result 2848 states and 4983 transitions. [2025-02-05 12:05:27,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:27,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-02-05 12:05:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:27,668 INFO L225 Difference]: With dead ends: 2848 [2025-02-05 12:05:27,668 INFO L226 Difference]: Without dead ends: 1854 [2025-02-05 12:05:27,671 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 12:05:27,671 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 394 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:27,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:05:27,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2025-02-05 12:05:27,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1854. [2025-02-05 12:05:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1853 states have (on average 1.4020507285483002) internal successors, (2598), 1853 states have internal predecessors, (2598), 0 states have call successors, (0), 0 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 12:05:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2598 transitions. [2025-02-05 12:05:27,726 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2598 transitions. Word has length 128 [2025-02-05 12:05:27,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:27,727 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2598 transitions. [2025-02-05 12:05:27,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 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 12:05:27,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2598 transitions. [2025-02-05 12:05:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 12:05:27,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:27,730 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:05:27,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:05:27,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:27,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:27,735 INFO L85 PathProgramCache]: Analyzing trace with hash 984369743, now seen corresponding path program 1 times [2025-02-05 12:05:27,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:27,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617656771] [2025-02-05 12:05:27,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:27,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:27,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 12:05:27,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 12:05:27,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:27,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:28,002 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:05:28,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:28,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617656771] [2025-02-05 12:05:28,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617656771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:28,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:28,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:28,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301437855] [2025-02-05 12:05:28,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:28,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:28,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:28,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:28,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:28,008 INFO L87 Difference]: Start difference. First operand 1854 states and 2598 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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 12:05:29,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:29,965 INFO L93 Difference]: Finished difference Result 5418 states and 7597 transitions. [2025-02-05 12:05:29,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:29,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-02-05 12:05:29,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:29,977 INFO L225 Difference]: With dead ends: 5418 [2025-02-05 12:05:29,977 INFO L226 Difference]: Without dead ends: 2713 [2025-02-05 12:05:29,981 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 12:05:29,982 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 444 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:29,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 874 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:05:29,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2025-02-05 12:05:30,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2710. [2025-02-05 12:05:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2709 states have (on average 1.2694721299372462) internal successors, (3439), 2709 states have internal predecessors, (3439), 0 states have call successors, (0), 0 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 12:05:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3439 transitions. [2025-02-05 12:05:30,050 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3439 transitions. Word has length 133 [2025-02-05 12:05:30,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:30,050 INFO L471 AbstractCegarLoop]: Abstraction has 2710 states and 3439 transitions. [2025-02-05 12:05:30,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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 12:05:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3439 transitions. [2025-02-05 12:05:30,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 12:05:30,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:30,057 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:05:30,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:05:30,057 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:30,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:30,058 INFO L85 PathProgramCache]: Analyzing trace with hash 56266899, now seen corresponding path program 1 times [2025-02-05 12:05:30,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:30,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865541711] [2025-02-05 12:05:30,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:30,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:30,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 12:05:30,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 12:05:30,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:30,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:05:30,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:30,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865541711] [2025-02-05 12:05:30,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865541711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:30,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:30,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:30,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25572838] [2025-02-05 12:05:30,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:30,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:30,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:30,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:30,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:30,450 INFO L87 Difference]: Start difference. First operand 2710 states and 3439 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:32,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:32,140 INFO L93 Difference]: Finished difference Result 7123 states and 9245 transitions. [2025-02-05 12:05:32,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:32,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2025-02-05 12:05:32,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:32,179 INFO L225 Difference]: With dead ends: 7123 [2025-02-05 12:05:32,179 INFO L226 Difference]: Without dead ends: 4415 [2025-02-05 12:05:32,184 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 12:05:32,186 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:32,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 786 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:05:32,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4415 states. [2025-02-05 12:05:32,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4415 to 4415. [2025-02-05 12:05:32,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4415 states, 4414 states have (on average 1.2417308563661078) internal successors, (5481), 4414 states have internal predecessors, (5481), 0 states have call successors, (0), 0 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 12:05:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4415 states to 4415 states and 5481 transitions. [2025-02-05 12:05:32,285 INFO L78 Accepts]: Start accepts. Automaton has 4415 states and 5481 transitions. Word has length 215 [2025-02-05 12:05:32,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:32,286 INFO L471 AbstractCegarLoop]: Abstraction has 4415 states and 5481 transitions. [2025-02-05 12:05:32,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4415 states and 5481 transitions. [2025-02-05 12:05:32,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-02-05 12:05:32,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:32,295 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:05:32,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:05:32,296 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:32,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:32,297 INFO L85 PathProgramCache]: Analyzing trace with hash 571126849, now seen corresponding path program 1 times [2025-02-05 12:05:32,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:32,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430497021] [2025-02-05 12:05:32,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:32,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:32,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-02-05 12:05:32,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-02-05 12:05:32,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:32,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-02-05 12:05:32,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:32,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430497021] [2025-02-05 12:05:32,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430497021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:32,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:32,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:32,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305571708] [2025-02-05 12:05:32,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:32,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:32,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:32,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:32,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:32,583 INFO L87 Difference]: Start difference. First operand 4415 states and 5481 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 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 12:05:34,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:34,290 INFO L93 Difference]: Finished difference Result 12654 states and 15711 transitions. [2025-02-05 12:05:34,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:34,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 292 [2025-02-05 12:05:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:34,316 INFO L225 Difference]: With dead ends: 12654 [2025-02-05 12:05:34,316 INFO L226 Difference]: Without dead ends: 7391 [2025-02-05 12:05:34,325 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 12:05:34,325 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 385 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:34,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 876 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:05:34,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7391 states. [2025-02-05 12:05:34,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7391 to 7391. [2025-02-05 12:05:34,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7391 states, 7390 states have (on average 1.1667117726657645) internal successors, (8622), 7390 states have internal predecessors, (8622), 0 states have call successors, (0), 0 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 12:05:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7391 states to 7391 states and 8622 transitions. [2025-02-05 12:05:34,472 INFO L78 Accepts]: Start accepts. Automaton has 7391 states and 8622 transitions. Word has length 292 [2025-02-05 12:05:34,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:34,473 INFO L471 AbstractCegarLoop]: Abstraction has 7391 states and 8622 transitions. [2025-02-05 12:05:34,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 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 12:05:34,473 INFO L276 IsEmpty]: Start isEmpty. Operand 7391 states and 8622 transitions. [2025-02-05 12:05:34,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-02-05 12:05:34,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:34,480 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, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:05:34,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:05:34,481 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:34,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:34,482 INFO L85 PathProgramCache]: Analyzing trace with hash -364174421, now seen corresponding path program 1 times [2025-02-05 12:05:34,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:34,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832575303] [2025-02-05 12:05:34,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:34,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:34,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-05 12:05:34,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-05 12:05:34,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:34,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:35,096 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 282 proven. 78 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-05 12:05:35,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:35,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832575303] [2025-02-05 12:05:35,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832575303] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:05:35,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598519243] [2025-02-05 12:05:35,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:35,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:05:35,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:05:35,105 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 12:05:35,106 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 12:05:35,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-05 12:05:35,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-05 12:05:35,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:35,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:35,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:05:35,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:05:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 282 proven. 78 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-05 12:05:35,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:05:36,059 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-05 12:05:36,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598519243] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:05:36,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:05:36,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-02-05 12:05:36,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177947856] [2025-02-05 12:05:36,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:36,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:05:36,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:36,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:05:36,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:05:36,062 INFO L87 Difference]: Start difference. First operand 7391 states and 8622 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 12:05:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:39,306 INFO L93 Difference]: Finished difference Result 21198 states and 24878 transitions. [2025-02-05 12:05:39,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:05:39,307 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 309 [2025-02-05 12:05:39,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:39,355 INFO L225 Difference]: With dead ends: 21198 [2025-02-05 12:05:39,355 INFO L226 Difference]: Without dead ends: 12957 [2025-02-05 12:05:39,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 615 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:05:39,367 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 908 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 2329 mSolverCounterSat, 653 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 2982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 653 IncrementalHoareTripleChecker+Valid, 2329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:39,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 190 Invalid, 2982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [653 Valid, 2329 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 12:05:39,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12957 states. [2025-02-05 12:05:39,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12957 to 11253. [2025-02-05 12:05:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11253 states, 11252 states have (on average 1.1880554568076787) internal successors, (13368), 11252 states have internal predecessors, (13368), 0 states have call successors, (0), 0 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 12:05:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11253 states to 11253 states and 13368 transitions. [2025-02-05 12:05:39,611 INFO L78 Accepts]: Start accepts. Automaton has 11253 states and 13368 transitions. Word has length 309 [2025-02-05 12:05:39,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:39,611 INFO L471 AbstractCegarLoop]: Abstraction has 11253 states and 13368 transitions. [2025-02-05 12:05:39,611 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 12:05:39,612 INFO L276 IsEmpty]: Start isEmpty. Operand 11253 states and 13368 transitions. [2025-02-05 12:05:39,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-02-05 12:05:39,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:39,618 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, 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, 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 12:05:39,628 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 12:05:39,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:05:39,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:39,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:39,819 INFO L85 PathProgramCache]: Analyzing trace with hash -589331567, now seen corresponding path program 1 times [2025-02-05 12:05:39,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:39,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548428460] [2025-02-05 12:05:39,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:39,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:39,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-02-05 12:05:39,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-02-05 12:05:39,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:39,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:05:40,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:40,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548428460] [2025-02-05 12:05:40,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548428460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:40,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:40,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:05:40,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959709855] [2025-02-05 12:05:40,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:40,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:05:40,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:40,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:05:40,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:05:40,706 INFO L87 Difference]: Start difference. First operand 11253 states and 13368 transitions. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 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 12:05:43,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:43,512 INFO L93 Difference]: Finished difference Result 36173 states and 42549 transitions. [2025-02-05 12:05:43,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:05:43,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 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 335 [2025-02-05 12:05:43,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:43,577 INFO L225 Difference]: With dead ends: 36173 [2025-02-05 12:05:43,578 INFO L226 Difference]: Without dead ends: 24922 [2025-02-05 12:05:43,593 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 12:05:43,594 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 844 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:43,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 206 Invalid, 2937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 12:05:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24922 states. [2025-02-05 12:05:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24922 to 22360. [2025-02-05 12:05:43,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22360 states, 22359 states have (on average 1.1739344335614295) internal successors, (26248), 22359 states have internal predecessors, (26248), 0 states have call successors, (0), 0 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 12:05:44,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22360 states to 22360 states and 26248 transitions. [2025-02-05 12:05:44,004 INFO L78 Accepts]: Start accepts. Automaton has 22360 states and 26248 transitions. Word has length 335 [2025-02-05 12:05:44,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:44,005 INFO L471 AbstractCegarLoop]: Abstraction has 22360 states and 26248 transitions. [2025-02-05 12:05:44,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 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 12:05:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 22360 states and 26248 transitions. [2025-02-05 12:05:44,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-02-05 12:05:44,014 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:44,015 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, 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, 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] [2025-02-05 12:05:44,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:05:44,015 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:44,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:44,016 INFO L85 PathProgramCache]: Analyzing trace with hash -81952487, now seen corresponding path program 1 times [2025-02-05 12:05:44,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:44,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993729279] [2025-02-05 12:05:44,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:44,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:44,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-02-05 12:05:44,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-02-05 12:05:44,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:44,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-02-05 12:05:44,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:44,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993729279] [2025-02-05 12:05:44,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993729279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:44,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:44,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:44,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174979153] [2025-02-05 12:05:44,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:44,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:44,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:44,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:44,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:44,637 INFO L87 Difference]: Start difference. First operand 22360 states and 26248 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 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 12:05:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:46,560 INFO L93 Difference]: Finished difference Result 52390 states and 61482 transitions. [2025-02-05 12:05:46,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:46,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 378 [2025-02-05 12:05:46,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:46,617 INFO L225 Difference]: With dead ends: 52390 [2025-02-05 12:05:46,617 INFO L226 Difference]: Without dead ends: 30032 [2025-02-05 12:05:46,645 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 12:05:46,645 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 462 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:46,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 187 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:05:46,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30032 states. [2025-02-05 12:05:47,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30032 to 20190. [2025-02-05 12:05:47,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20190 states, 20189 states have (on average 1.1755906681856456) internal successors, (23734), 20189 states have internal predecessors, (23734), 0 states have call successors, (0), 0 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 12:05:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20190 states to 20190 states and 23734 transitions. [2025-02-05 12:05:47,077 INFO L78 Accepts]: Start accepts. Automaton has 20190 states and 23734 transitions. Word has length 378 [2025-02-05 12:05:47,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:47,077 INFO L471 AbstractCegarLoop]: Abstraction has 20190 states and 23734 transitions. [2025-02-05 12:05:47,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 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 12:05:47,078 INFO L276 IsEmpty]: Start isEmpty. Operand 20190 states and 23734 transitions. [2025-02-05 12:05:47,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-02-05 12:05:47,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:47,087 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:05:47,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:05:47,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:47,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:47,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2044370676, now seen corresponding path program 1 times [2025-02-05 12:05:47,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:47,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788611916] [2025-02-05 12:05:47,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:47,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:47,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-02-05 12:05:47,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-02-05 12:05:47,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:47,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:05:47,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:47,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788611916] [2025-02-05 12:05:47,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788611916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:47,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:47,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:47,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177389536] [2025-02-05 12:05:47,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:47,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:05:47,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:47,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:05:47,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:05:47,707 INFO L87 Difference]: Start difference. First operand 20190 states and 23734 transitions. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 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 12:05:50,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:50,108 INFO L93 Difference]: Finished difference Result 54913 states and 64238 transitions. [2025-02-05 12:05:50,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:05:50,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 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 12:05:50,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:50,179 INFO L225 Difference]: With dead ends: 54913 [2025-02-05 12:05:50,180 INFO L226 Difference]: Without dead ends: 33875 [2025-02-05 12:05:50,204 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 12:05:50,205 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 614 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:50,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 200 Invalid, 2792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 12:05:50,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33875 states. [2025-02-05 12:05:50,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33875 to 31316. [2025-02-05 12:05:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31316 states, 31315 states have (on average 1.1801692479642345) internal successors, (36957), 31315 states have internal predecessors, (36957), 0 states have call successors, (0), 0 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 12:05:50,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31316 states to 31316 states and 36957 transitions. [2025-02-05 12:05:50,803 INFO L78 Accepts]: Start accepts. Automaton has 31316 states and 36957 transitions. Word has length 402 [2025-02-05 12:05:50,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:50,804 INFO L471 AbstractCegarLoop]: Abstraction has 31316 states and 36957 transitions. [2025-02-05 12:05:50,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 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 12:05:50,805 INFO L276 IsEmpty]: Start isEmpty. Operand 31316 states and 36957 transitions. [2025-02-05 12:05:50,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-02-05 12:05:50,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:50,822 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:05:50,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 12:05:50,823 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:50,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:50,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1934154225, now seen corresponding path program 1 times [2025-02-05 12:05:50,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:50,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170999004] [2025-02-05 12:05:50,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:50,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:50,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-05 12:05:50,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-05 12:05:50,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:50,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-05 12:05:51,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:51,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170999004] [2025-02-05 12:05:51,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170999004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:51,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:51,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:05:51,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017406158] [2025-02-05 12:05:51,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:51,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:05:51,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:51,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:05:51,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:05:51,266 INFO L87 Difference]: Start difference. First operand 31316 states and 36957 transitions. Second operand has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 0 states have call successors, (0), 0 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 12:05:54,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:54,193 INFO L93 Difference]: Finished difference Result 82693 states and 97127 transitions. [2025-02-05 12:05:54,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:05:54,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 0 states have call successors, (0), 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 471 [2025-02-05 12:05:54,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:54,274 INFO L225 Difference]: With dead ends: 82693 [2025-02-05 12:05:54,275 INFO L226 Difference]: Without dead ends: 47958 [2025-02-05 12:05:54,289 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 12:05:54,289 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 901 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2366 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 2672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 2366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:54,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 796 Invalid, 2672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 2366 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 12:05:54,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47958 states. [2025-02-05 12:05:54,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47958 to 38096. [2025-02-05 12:05:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38096 states, 38095 states have (on average 1.1556372227326421) internal successors, (44024), 38095 states have internal predecessors, (44024), 0 states have call successors, (0), 0 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 12:05:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38096 states to 38096 states and 44024 transitions. [2025-02-05 12:05:54,819 INFO L78 Accepts]: Start accepts. Automaton has 38096 states and 44024 transitions. Word has length 471 [2025-02-05 12:05:54,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:54,820 INFO L471 AbstractCegarLoop]: Abstraction has 38096 states and 44024 transitions. [2025-02-05 12:05:54,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 0 states have call successors, (0), 0 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 12:05:54,820 INFO L276 IsEmpty]: Start isEmpty. Operand 38096 states and 44024 transitions. [2025-02-05 12:05:54,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-02-05 12:05:54,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:54,833 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:05:54,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 12:05:54,834 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:54,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:54,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1238518207, now seen corresponding path program 1 times [2025-02-05 12:05:54,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:54,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721492781] [2025-02-05 12:05:54,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:54,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:54,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-02-05 12:05:54,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-02-05 12:05:54,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:54,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-05 12:05:55,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:55,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721492781] [2025-02-05 12:05:55,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721492781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:55,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:55,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:55,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681675624] [2025-02-05 12:05:55,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:55,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:55,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:55,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:55,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:55,209 INFO L87 Difference]: Start difference. First operand 38096 states and 44024 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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 12:05:57,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:57,026 INFO L93 Difference]: Finished difference Result 85124 states and 98623 transitions. [2025-02-05 12:05:57,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:57,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 525 [2025-02-05 12:05:57,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:57,198 INFO L225 Difference]: With dead ends: 85124 [2025-02-05 12:05:57,198 INFO L226 Difference]: Without dead ends: 46175 [2025-02-05 12:05:57,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:57,224 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 416 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:57,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 760 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:05:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46175 states. [2025-02-05 12:05:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46175 to 43197. [2025-02-05 12:05:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43197 states, 43196 states have (on average 1.144457820168534) internal successors, (49436), 43196 states have internal predecessors, (49436), 0 states have call successors, (0), 0 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 12:05:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43197 states to 43197 states and 49436 transitions. [2025-02-05 12:05:57,919 INFO L78 Accepts]: Start accepts. Automaton has 43197 states and 49436 transitions. Word has length 525 [2025-02-05 12:05:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:57,920 INFO L471 AbstractCegarLoop]: Abstraction has 43197 states and 49436 transitions. [2025-02-05 12:05:57,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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 12:05:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 43197 states and 49436 transitions. [2025-02-05 12:05:57,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-02-05 12:05:57,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:57,947 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:05:57,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 12:05:57,947 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:57,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:57,948 INFO L85 PathProgramCache]: Analyzing trace with hash -363393822, now seen corresponding path program 1 times [2025-02-05 12:05:57,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:57,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120672450] [2025-02-05 12:05:57,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:57,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:58,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-02-05 12:05:58,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-02-05 12:05:58,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:58,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-02-05 12:05:58,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:58,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120672450] [2025-02-05 12:05:58,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120672450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:58,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:58,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:58,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466476851] [2025-02-05 12:05:58,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:58,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:58,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:58,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:58,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:58,318 INFO L87 Difference]: Start difference. First operand 43197 states and 49436 transitions. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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 12:06:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:00,137 INFO L93 Difference]: Finished difference Result 104662 states and 119490 transitions. [2025-02-05 12:06:00,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:00,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 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 606 [2025-02-05 12:06:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:00,217 INFO L225 Difference]: With dead ends: 104662 [2025-02-05 12:06:00,217 INFO L226 Difference]: Without dead ends: 61466 [2025-02-05 12:06:00,232 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 12:06:00,233 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 380 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:00,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 384 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:06:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61466 states. [2025-02-05 12:06:00,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61466 to 54241. [2025-02-05 12:06:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54241 states, 54240 states have (on average 1.1143989675516224) internal successors, (60445), 54240 states have internal predecessors, (60445), 0 states have call successors, (0), 0 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 12:06:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54241 states to 54241 states and 60445 transitions. [2025-02-05 12:06:01,063 INFO L78 Accepts]: Start accepts. Automaton has 54241 states and 60445 transitions. Word has length 606 [2025-02-05 12:06:01,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:01,064 INFO L471 AbstractCegarLoop]: Abstraction has 54241 states and 60445 transitions. [2025-02-05 12:06:01,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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 12:06:01,064 INFO L276 IsEmpty]: Start isEmpty. Operand 54241 states and 60445 transitions. [2025-02-05 12:06:01,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2025-02-05 12:06:01,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:01,091 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:01,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 12:06:01,091 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:01,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:01,092 INFO L85 PathProgramCache]: Analyzing trace with hash 83767662, now seen corresponding path program 1 times [2025-02-05 12:06:01,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:01,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670299767] [2025-02-05 12:06:01,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:01,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:01,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 653 statements into 1 equivalence classes. [2025-02-05 12:06:01,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 653 of 653 statements. [2025-02-05 12:06:01,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:01,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:06:02,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:02,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670299767] [2025-02-05 12:06:02,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670299767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:02,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:02,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:06:02,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700651168] [2025-02-05 12:06:02,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:02,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:06:02,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:02,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:06:02,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:06:02,276 INFO L87 Difference]: Start difference. First operand 54241 states and 60445 transitions. Second operand has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 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 12:06:04,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:04,844 INFO L93 Difference]: Finished difference Result 122122 states and 136661 transitions. [2025-02-05 12:06:04,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:06:04,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 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 653 [2025-02-05 12:06:04,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:04,941 INFO L225 Difference]: With dead ends: 122122 [2025-02-05 12:06:04,941 INFO L226 Difference]: Without dead ends: 66597 [2025-02-05 12:06:04,984 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 12:06:04,985 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 486 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2839 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 2839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:04,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 762 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 2839 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:06:05,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66597 states. [2025-02-05 12:06:05,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66597 to 64036. [2025-02-05 12:06:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64036 states, 64035 states have (on average 1.1201374248457874) internal successors, (71728), 64035 states have internal predecessors, (71728), 0 states have call successors, (0), 0 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 12:06:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64036 states to 64036 states and 71728 transitions. [2025-02-05 12:06:05,951 INFO L78 Accepts]: Start accepts. Automaton has 64036 states and 71728 transitions. Word has length 653 [2025-02-05 12:06:05,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:05,951 INFO L471 AbstractCegarLoop]: Abstraction has 64036 states and 71728 transitions. [2025-02-05 12:06:05,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 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 12:06:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 64036 states and 71728 transitions. [2025-02-05 12:06:05,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-02-05 12:06:05,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:05,977 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:05,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 12:06:05,977 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:05,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:05,978 INFO L85 PathProgramCache]: Analyzing trace with hash 352925336, now seen corresponding path program 1 times [2025-02-05 12:06:05,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:05,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6952348] [2025-02-05 12:06:05,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:05,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:06,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-02-05 12:06:06,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-02-05 12:06:06,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:06,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:06,676 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-02-05 12:06:06,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:06,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6952348] [2025-02-05 12:06:06,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6952348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:06,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:06,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:06:06,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693991772] [2025-02-05 12:06:06,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:06,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:06,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:06,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:06,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:06,682 INFO L87 Difference]: Start difference. First operand 64036 states and 71728 transitions. Second operand has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:06:08,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:08,381 INFO L93 Difference]: Finished difference Result 133579 states and 149174 transitions. [2025-02-05 12:06:08,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:08,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 728 [2025-02-05 12:06:08,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:08,476 INFO L225 Difference]: With dead ends: 133579 [2025-02-05 12:06:08,476 INFO L226 Difference]: Without dead ends: 67836 [2025-02-05 12:06:08,511 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 12:06:08,511 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 425 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:08,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 599 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 12:06:08,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67836 states. [2025-02-05 12:06:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67836 to 65278. [2025-02-05 12:06:09,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65278 states, 65277 states have (on average 1.1094259846500298) internal successors, (72420), 65277 states have internal predecessors, (72420), 0 states have call successors, (0), 0 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 12:06:09,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65278 states to 65278 states and 72420 transitions. [2025-02-05 12:06:09,460 INFO L78 Accepts]: Start accepts. Automaton has 65278 states and 72420 transitions. Word has length 728 [2025-02-05 12:06:09,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:09,461 INFO L471 AbstractCegarLoop]: Abstraction has 65278 states and 72420 transitions. [2025-02-05 12:06:09,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:06:09,461 INFO L276 IsEmpty]: Start isEmpty. Operand 65278 states and 72420 transitions. [2025-02-05 12:06:09,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2025-02-05 12:06:09,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:09,498 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:09,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 12:06:09,498 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:09,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:09,499 INFO L85 PathProgramCache]: Analyzing trace with hash -22825083, now seen corresponding path program 1 times [2025-02-05 12:06:09,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:09,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168647210] [2025-02-05 12:06:09,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:09,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:09,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 747 statements into 1 equivalence classes. [2025-02-05 12:06:09,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 747 of 747 statements. [2025-02-05 12:06:09,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:09,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-02-05 12:06:10,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:10,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168647210] [2025-02-05 12:06:10,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168647210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:10,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:10,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:06:10,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772360281] [2025-02-05 12:06:10,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:10,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:06:10,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:10,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:06:10,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:06:10,309 INFO L87 Difference]: Start difference. First operand 65278 states and 72420 transitions. Second operand has 4 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 0 states have call successors, (0), 0 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 12:06:12,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:12,928 INFO L93 Difference]: Finished difference Result 151845 states and 168181 transitions. [2025-02-05 12:06:12,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:06:12,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 0 states have call successors, (0), 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 747 [2025-02-05 12:06:12,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:13,042 INFO L225 Difference]: With dead ends: 151845 [2025-02-05 12:06:13,042 INFO L226 Difference]: Without dead ends: 85719 [2025-02-05 12:06:13,092 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 12:06:13,093 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 523 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 2726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:13,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 182 Invalid, 2726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 12:06:13,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85719 states. [2025-02-05 12:06:14,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85719 to 71236. [2025-02-05 12:06:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71236 states, 71235 states have (on average 1.1028005895978101) internal successors, (78558), 71235 states have internal predecessors, (78558), 0 states have call successors, (0), 0 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 12:06:14,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71236 states to 71236 states and 78558 transitions. [2025-02-05 12:06:14,354 INFO L78 Accepts]: Start accepts. Automaton has 71236 states and 78558 transitions. Word has length 747 [2025-02-05 12:06:14,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:14,355 INFO L471 AbstractCegarLoop]: Abstraction has 71236 states and 78558 transitions. [2025-02-05 12:06:14,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 0 states have call successors, (0), 0 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 12:06:14,355 INFO L276 IsEmpty]: Start isEmpty. Operand 71236 states and 78558 transitions. [2025-02-05 12:06:14,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2025-02-05 12:06:14,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:14,402 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:14,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 12:06:14,402 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:14,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:14,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1332565229, now seen corresponding path program 1 times [2025-02-05 12:06:14,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:14,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173824750] [2025-02-05 12:06:14,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:14,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:14,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 751 statements into 1 equivalence classes. [2025-02-05 12:06:14,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 751 of 751 statements. [2025-02-05 12:06:14,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:14,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 647 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-02-05 12:06:15,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:15,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173824750] [2025-02-05 12:06:15,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173824750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:15,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:15,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:06:15,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131751845] [2025-02-05 12:06:15,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:15,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:15,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:15,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:15,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:15,010 INFO L87 Difference]: Start difference. First operand 71236 states and 78558 transitions. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 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 12:06:16,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:16,666 INFO L93 Difference]: Finished difference Result 150563 states and 166289 transitions. [2025-02-05 12:06:16,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:16,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 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 751 [2025-02-05 12:06:16,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:16,769 INFO L225 Difference]: With dead ends: 150563 [2025-02-05 12:06:16,769 INFO L226 Difference]: Without dead ends: 79329 [2025-02-05 12:06:16,816 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 12:06:16,817 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 382 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:16,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 239 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:06:16,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79329 states. [2025-02-05 12:06:17,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79329 to 78898. [2025-02-05 12:06:17,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78898 states, 78897 states have (on average 1.098432133034209) internal successors, (86663), 78897 states have internal predecessors, (86663), 0 states have call successors, (0), 0 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 12:06:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78898 states to 78898 states and 86663 transitions. [2025-02-05 12:06:18,102 INFO L78 Accepts]: Start accepts. Automaton has 78898 states and 86663 transitions. Word has length 751 [2025-02-05 12:06:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:18,102 INFO L471 AbstractCegarLoop]: Abstraction has 78898 states and 86663 transitions. [2025-02-05 12:06:18,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 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 12:06:18,103 INFO L276 IsEmpty]: Start isEmpty. Operand 78898 states and 86663 transitions. [2025-02-05 12:06:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2025-02-05 12:06:18,154 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:18,155 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, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:18,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 12:06:18,155 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:18,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:18,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1812710431, now seen corresponding path program 1 times [2025-02-05 12:06:18,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:18,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279884062] [2025-02-05 12:06:18,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:18,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:18,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 752 statements into 1 equivalence classes. [2025-02-05 12:06:18,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 752 of 752 statements. [2025-02-05 12:06:18,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:18,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-02-05 12:06:19,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:19,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279884062] [2025-02-05 12:06:19,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279884062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:19,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:19,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:06:19,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402615102] [2025-02-05 12:06:19,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:19,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:06:19,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:19,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:06:19,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:06:19,060 INFO L87 Difference]: Start difference. First operand 78898 states and 86663 transitions. Second operand has 4 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 0 states have call successors, (0), 0 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 12:06:21,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:21,555 INFO L93 Difference]: Finished difference Result 173124 states and 189890 transitions. [2025-02-05 12:06:21,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:06:21,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 0 states have call successors, (0), 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 752 [2025-02-05 12:06:21,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:21,685 INFO L225 Difference]: With dead ends: 173124 [2025-02-05 12:06:21,686 INFO L226 Difference]: Without dead ends: 93378 [2025-02-05 12:06:21,730 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 12:06:21,731 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 526 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 2631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:21,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 167 Invalid, 2631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 2217 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:06:21,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93378 states. [2025-02-05 12:06:22,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93378 to 78898. [2025-02-05 12:06:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78898 states, 78897 states have (on average 1.098432133034209) internal successors, (86663), 78897 states have internal predecessors, (86663), 0 states have call successors, (0), 0 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 12:06:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78898 states to 78898 states and 86663 transitions. [2025-02-05 12:06:22,772 INFO L78 Accepts]: Start accepts. Automaton has 78898 states and 86663 transitions. Word has length 752 [2025-02-05 12:06:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:22,772 INFO L471 AbstractCegarLoop]: Abstraction has 78898 states and 86663 transitions. [2025-02-05 12:06:22,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 0 states have call successors, (0), 0 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 12:06:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand 78898 states and 86663 transitions. [2025-02-05 12:06:22,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2025-02-05 12:06:22,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:22,801 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:22,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 12:06:22,801 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:22,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:22,802 INFO L85 PathProgramCache]: Analyzing trace with hash -375268432, now seen corresponding path program 1 times [2025-02-05 12:06:22,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:22,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74596352] [2025-02-05 12:06:22,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:22,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:23,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 817 statements into 1 equivalence classes. [2025-02-05 12:06:23,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 817 of 817 statements. [2025-02-05 12:06:23,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:23,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 536 proven. 82 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-02-05 12:06:23,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:23,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74596352] [2025-02-05 12:06:23,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74596352] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:06:23,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977211830] [2025-02-05 12:06:23,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:23,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:06:23,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:06:23,788 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 12:06:23,789 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 12:06:23,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 817 statements into 1 equivalence classes. [2025-02-05 12:06:24,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 817 of 817 statements. [2025-02-05 12:06:24,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:24,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:24,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:06:24,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:06:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 536 proven. 82 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-02-05 12:06:24,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:06:24,889 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 618 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-02-05 12:06:24,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977211830] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:06:24,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:06:24,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-02-05 12:06:24,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779159012] [2025-02-05 12:06:24,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:24,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:06:24,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:24,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:06:24,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:06:24,894 INFO L87 Difference]: Start difference. First operand 78898 states and 86663 transitions. Second operand has 4 states, 4 states have (on average 173.25) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)