./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.sw_loop.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 8bae34b88b69e395b0952f9a7e7405cfa96e2c3307dff9bcbb01737f33e4d41e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:00:35,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:00:35,214 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:00:35,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:00:35,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:00:35,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:00:35,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:00:35,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:00:35,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:00:35,240 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:00:35,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:00:35,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:00:35,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:00:35,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:00:35,242 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:00:35,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:00:35,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:00:35,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:00:35,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:00:35,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:00:35,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:00:35,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:00:35,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:00:35,243 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:00:35,243 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:00:35,243 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:00:35,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:00:35,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:00:35,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:00:35,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:00:35,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:00:35,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:00:35,244 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:00:35,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:00:35,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:00:35,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:00:35,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:00:35,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:00:35,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:00:35,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:00:35,244 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8bae34b88b69e395b0952f9a7e7405cfa96e2c3307dff9bcbb01737f33e4d41e [2025-02-05 20:00:35,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:00:35,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:00:35,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:00:35,519 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:00:35,519 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:00:35,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop.c [2025-02-05 20:00:36,715 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8468bc00/46055e00ac8642249bc1daa657a29fdb/FLAGdc1e353ca [2025-02-05 20:00:37,029 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:00:37,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop.c [2025-02-05 20:00:37,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8468bc00/46055e00ac8642249bc1daa657a29fdb/FLAGdc1e353ca [2025-02-05 20:00:37,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8468bc00/46055e00ac8642249bc1daa657a29fdb [2025-02-05 20:00:37,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:00:37,337 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:00:37,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:00:37,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:00:37,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:00:37,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:00:37" (1/1) ... [2025-02-05 20:00:37,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8b8eea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:37, skipping insertion in model container [2025-02-05 20:00:37,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:00:37" (1/1) ... [2025-02-05 20:00:37,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:00:37,461 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/hardware-verification-bv/btor2c-lazyMod.sw_loop.c[1247,1260] [2025-02-05 20:00:37,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:00:37,599 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:00:37,610 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/hardware-verification-bv/btor2c-lazyMod.sw_loop.c[1247,1260] [2025-02-05 20:00:37,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:00:37,696 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:00:37,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:37 WrapperNode [2025-02-05 20:00:37,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:00:37,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:00:37,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:00:37,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:00:37,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:37" (1/1) ... [2025-02-05 20:00:37,718 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:37" (1/1) ... [2025-02-05 20:00:37,813 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1012 [2025-02-05 20:00:37,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:00:37,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:00:37,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:00:37,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:00:37,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:37" (1/1) ... [2025-02-05 20:00:37,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:37" (1/1) ... [2025-02-05 20:00:37,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:37" (1/1) ... [2025-02-05 20:00:37,901 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 20:00:37,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:37" (1/1) ... [2025-02-05 20:00:37,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:37" (1/1) ... [2025-02-05 20:00:37,946 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:37" (1/1) ... [2025-02-05 20:00:37,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:37" (1/1) ... [2025-02-05 20:00:37,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:37" (1/1) ... [2025-02-05 20:00:37,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:37" (1/1) ... [2025-02-05 20:00:37,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:00:38,000 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:00:38,001 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:00:38,001 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:00:38,002 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:37" (1/1) ... [2025-02-05 20:00:38,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:00:38,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:00:38,035 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 20:00:38,037 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 20:00:38,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:00:38,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:00:38,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:00:38,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:00:38,188 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:00:38,189 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:00:39,211 INFO L? ?]: Removed 647 outVars from TransFormulas that were not future-live. [2025-02-05 20:00:39,211 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:00:39,252 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:00:39,252 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:00:39,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:00:39 BoogieIcfgContainer [2025-02-05 20:00:39,253 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:00:39,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:00:39,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:00:39,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:00:39,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:00:37" (1/3) ... [2025-02-05 20:00:39,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396066d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:00:39, skipping insertion in model container [2025-02-05 20:00:39,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:37" (2/3) ... [2025-02-05 20:00:39,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396066d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:00:39, skipping insertion in model container [2025-02-05 20:00:39,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:00:39" (3/3) ... [2025-02-05 20:00:39,259 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_loop.c [2025-02-05 20:00:39,268 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:00:39,269 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.sw_loop.c that has 1 procedures, 298 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:00:39,304 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:00:39,311 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;@28be07c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:00:39,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:00:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 298 states, 296 states have (on average 1.4966216216216217) internal successors, (443), 297 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:39,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 20:00:39,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:39,317 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] [2025-02-05 20:00:39,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:39,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1458086393, now seen corresponding path program 1 times [2025-02-05 20:00:39,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:39,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972759915] [2025-02-05 20:00:39,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:39,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:39,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 20:00:39,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 20:00:39,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:39,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:39,746 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 20:00:39,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:39,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972759915] [2025-02-05 20:00:39,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972759915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:39,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:39,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:00:39,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987168241] [2025-02-05 20:00:39,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:39,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:00:39,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:39,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:00:39,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:00:39,775 INFO L87 Difference]: Start difference. First operand has 298 states, 296 states have (on average 1.4966216216216217) internal successors, (443), 297 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:40,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:40,030 INFO L93 Difference]: Finished difference Result 557 states and 831 transitions. [2025-02-05 20:00:40,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:00:40,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-02-05 20:00:40,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:40,039 INFO L225 Difference]: With dead ends: 557 [2025-02-05 20:00:40,040 INFO L226 Difference]: Without dead ends: 297 [2025-02-05 20:00:40,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:00:40,049 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 0 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:40,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1090 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:40,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-02-05 20:00:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2025-02-05 20:00:40,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.489864864864865) internal successors, (441), 296 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 441 transitions. [2025-02-05 20:00:40,089 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 441 transitions. Word has length 27 [2025-02-05 20:00:40,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:40,090 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 441 transitions. [2025-02-05 20:00:40,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 441 transitions. [2025-02-05 20:00:40,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 20:00:40,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:40,090 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] [2025-02-05 20:00:40,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:00:40,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:40,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:40,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2048641645, now seen corresponding path program 1 times [2025-02-05 20:00:40,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:40,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62516803] [2025-02-05 20:00:40,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:40,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:40,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 20:00:40,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 20:00:40,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:40,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:40,233 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 20:00:40,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:40,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62516803] [2025-02-05 20:00:40,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62516803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:40,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:40,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:00:40,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102795115] [2025-02-05 20:00:40,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:40,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:00:40,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:40,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:00:40,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:00:40,235 INFO L87 Difference]: Start difference. First operand 297 states and 441 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:40,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:40,367 INFO L93 Difference]: Finished difference Result 558 states and 829 transitions. [2025-02-05 20:00:40,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:00:40,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-02-05 20:00:40,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:40,369 INFO L225 Difference]: With dead ends: 558 [2025-02-05 20:00:40,369 INFO L226 Difference]: Without dead ends: 299 [2025-02-05 20:00:40,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:00:40,370 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 0 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:40,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1087 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:00:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-02-05 20:00:40,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-02-05 20:00:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.4865771812080537) internal successors, (443), 298 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 443 transitions. [2025-02-05 20:00:40,378 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 443 transitions. Word has length 28 [2025-02-05 20:00:40,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:40,379 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 443 transitions. [2025-02-05 20:00:40,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:40,379 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 443 transitions. [2025-02-05 20:00:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 20:00:40,379 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:40,380 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] [2025-02-05 20:00:40,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:00:40,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:40,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:40,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1014891202, now seen corresponding path program 1 times [2025-02-05 20:00:40,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:40,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594710778] [2025-02-05 20:00:40,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:40,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:40,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 20:00:40,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 20:00:40,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:40,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:40,584 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 20:00:40,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:40,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594710778] [2025-02-05 20:00:40,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594710778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:40,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:40,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:40,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803881616] [2025-02-05 20:00:40,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:40,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:40,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:40,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:40,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:40,586 INFO L87 Difference]: Start difference. First operand 299 states and 443 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:40,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:40,850 INFO L93 Difference]: Finished difference Result 795 states and 1180 transitions. [2025-02-05 20:00:40,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:40,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-02-05 20:00:40,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:40,854 INFO L225 Difference]: With dead ends: 795 [2025-02-05 20:00:40,854 INFO L226 Difference]: Without dead ends: 534 [2025-02-05 20:00:40,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:40,855 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 1117 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:40,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 1060 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:40,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-02-05 20:00:40,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 301. [2025-02-05 20:00:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.4833333333333334) internal successors, (445), 300 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 445 transitions. [2025-02-05 20:00:40,883 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 445 transitions. Word has length 29 [2025-02-05 20:00:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:40,883 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 445 transitions. [2025-02-05 20:00:40,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 445 transitions. [2025-02-05 20:00:40,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 20:00:40,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:40,891 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:00:40,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:00:40,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:40,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:40,894 INFO L85 PathProgramCache]: Analyzing trace with hash -162977166, now seen corresponding path program 1 times [2025-02-05 20:00:40,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:40,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093313232] [2025-02-05 20:00:40,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:40,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:40,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 20:00:41,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 20:00:41,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:41,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:41,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:41,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093313232] [2025-02-05 20:00:41,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093313232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:41,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:41,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:00:41,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324793859] [2025-02-05 20:00:41,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:41,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:00:41,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:41,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:00:41,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:00:41,963 INFO L87 Difference]: Start difference. First operand 301 states and 445 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:42,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:42,218 INFO L93 Difference]: Finished difference Result 778 states and 1154 transitions. [2025-02-05 20:00:42,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:00:42,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2025-02-05 20:00:42,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:42,222 INFO L225 Difference]: With dead ends: 778 [2025-02-05 20:00:42,222 INFO L226 Difference]: Without dead ends: 517 [2025-02-05 20:00:42,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:00:42,226 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 1048 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:42,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1312 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:42,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-02-05 20:00:42,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 326. [2025-02-05 20:00:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.4738461538461538) internal successors, (479), 325 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 479 transitions. [2025-02-05 20:00:42,241 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 479 transitions. Word has length 158 [2025-02-05 20:00:42,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:42,242 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 479 transitions. [2025-02-05 20:00:42,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 479 transitions. [2025-02-05 20:00:42,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 20:00:42,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:42,249 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:00:42,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:00:42,249 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:42,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:42,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1757927362, now seen corresponding path program 1 times [2025-02-05 20:00:42,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:42,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926538009] [2025-02-05 20:00:42,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:42,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:42,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 20:00:42,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 20:00:42,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:42,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:42,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:42,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926538009] [2025-02-05 20:00:42,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926538009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:42,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:42,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:42,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901366066] [2025-02-05 20:00:42,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:42,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:42,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:42,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:42,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:42,722 INFO L87 Difference]: Start difference. First operand 326 states and 479 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:42,915 INFO L93 Difference]: Finished difference Result 780 states and 1155 transitions. [2025-02-05 20:00:42,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:42,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2025-02-05 20:00:42,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:42,918 INFO L225 Difference]: With dead ends: 780 [2025-02-05 20:00:42,918 INFO L226 Difference]: Without dead ends: 519 [2025-02-05 20:00:42,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:42,920 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 1053 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:42,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 1063 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:42,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-02-05 20:00:42,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 326. [2025-02-05 20:00:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.4707692307692308) internal successors, (478), 325 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 478 transitions. [2025-02-05 20:00:42,930 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 478 transitions. Word has length 159 [2025-02-05 20:00:42,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:42,930 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 478 transitions. [2025-02-05 20:00:42,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:42,931 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 478 transitions. [2025-02-05 20:00:42,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 20:00:42,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:42,935 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:00:42,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:00:42,935 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:42,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:42,935 INFO L85 PathProgramCache]: Analyzing trace with hash -202272953, now seen corresponding path program 1 times [2025-02-05 20:00:42,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:42,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916194230] [2025-02-05 20:00:42,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:42,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:42,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 20:00:43,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 20:00:43,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:43,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:43,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:43,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916194230] [2025-02-05 20:00:43,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916194230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:43,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:43,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:43,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228319760] [2025-02-05 20:00:43,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:43,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:43,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:43,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:43,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:43,837 INFO L87 Difference]: Start difference. First operand 326 states and 478 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:44,063 INFO L93 Difference]: Finished difference Result 772 states and 1142 transitions. [2025-02-05 20:00:44,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:44,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2025-02-05 20:00:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:44,066 INFO L225 Difference]: With dead ends: 772 [2025-02-05 20:00:44,066 INFO L226 Difference]: Without dead ends: 511 [2025-02-05 20:00:44,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:44,067 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 1012 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:44,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 1049 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:44,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-02-05 20:00:44,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 349. [2025-02-05 20:00:44,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4683908045977012) internal successors, (511), 348 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 511 transitions. [2025-02-05 20:00:44,081 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 511 transitions. Word has length 159 [2025-02-05 20:00:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:44,081 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 511 transitions. [2025-02-05 20:00:44,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:44,082 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 511 transitions. [2025-02-05 20:00:44,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 20:00:44,083 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:44,083 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:00:44,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:00:44,083 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:44,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:44,083 INFO L85 PathProgramCache]: Analyzing trace with hash -51604092, now seen corresponding path program 1 times [2025-02-05 20:00:44,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:44,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998533505] [2025-02-05 20:00:44,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:44,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:44,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 20:00:44,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 20:00:44,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:44,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:44,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:44,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:44,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998533505] [2025-02-05 20:00:44,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998533505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:44,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:44,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:44,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47594519] [2025-02-05 20:00:44,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:44,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:44,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:44,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:44,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:44,958 INFO L87 Difference]: Start difference. First operand 349 states and 511 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:45,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:45,177 INFO L93 Difference]: Finished difference Result 772 states and 1140 transitions. [2025-02-05 20:00:45,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:45,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-02-05 20:00:45,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:45,179 INFO L225 Difference]: With dead ends: 772 [2025-02-05 20:00:45,179 INFO L226 Difference]: Without dead ends: 511 [2025-02-05 20:00:45,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:45,180 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 982 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:45,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 1048 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:45,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-02-05 20:00:45,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 400. [2025-02-05 20:00:45,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.468671679197995) internal successors, (586), 399 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 586 transitions. [2025-02-05 20:00:45,188 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 586 transitions. Word has length 161 [2025-02-05 20:00:45,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:45,188 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 586 transitions. [2025-02-05 20:00:45,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:45,189 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 586 transitions. [2025-02-05 20:00:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 20:00:45,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:45,190 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:00:45,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:00:45,190 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:45,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:45,190 INFO L85 PathProgramCache]: Analyzing trace with hash 914758356, now seen corresponding path program 1 times [2025-02-05 20:00:45,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:45,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833875088] [2025-02-05 20:00:45,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:45,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:45,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:00:45,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:00:45,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:45,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:45,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:45,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833875088] [2025-02-05 20:00:45,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833875088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:45,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:45,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:45,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998246061] [2025-02-05 20:00:45,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:45,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:45,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:45,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:45,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:45,963 INFO L87 Difference]: Start difference. First operand 400 states and 586 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:46,187 INFO L93 Difference]: Finished difference Result 772 states and 1139 transitions. [2025-02-05 20:00:46,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:46,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-02-05 20:00:46,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:46,189 INFO L225 Difference]: With dead ends: 772 [2025-02-05 20:00:46,189 INFO L226 Difference]: Without dead ends: 511 [2025-02-05 20:00:46,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:46,190 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 965 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:46,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1048 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:46,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-02-05 20:00:46,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 428. [2025-02-05 20:00:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 1.468384074941452) internal successors, (627), 427 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:46,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 627 transitions. [2025-02-05 20:00:46,204 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 627 transitions. Word has length 162 [2025-02-05 20:00:46,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:46,204 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 627 transitions. [2025-02-05 20:00:46,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:46,204 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 627 transitions. [2025-02-05 20:00:46,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 20:00:46,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:46,205 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:00:46,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 20:00:46,206 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:46,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:46,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1349351783, now seen corresponding path program 1 times [2025-02-05 20:00:46,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:46,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502718516] [2025-02-05 20:00:46,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:46,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:46,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 20:00:46,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 20:00:46,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:46,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:46,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:46,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502718516] [2025-02-05 20:00:46,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502718516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:46,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:46,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:46,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3890440] [2025-02-05 20:00:46,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:46,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:46,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:46,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:46,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:46,883 INFO L87 Difference]: Start difference. First operand 428 states and 627 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:47,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:47,103 INFO L93 Difference]: Finished difference Result 772 states and 1138 transitions. [2025-02-05 20:00:47,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:47,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-02-05 20:00:47,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:47,106 INFO L225 Difference]: With dead ends: 772 [2025-02-05 20:00:47,106 INFO L226 Difference]: Without dead ends: 511 [2025-02-05 20:00:47,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:47,107 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 948 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:47,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1048 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:47,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-02-05 20:00:47,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 456. [2025-02-05 20:00:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.468131868131868) internal successors, (668), 455 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 668 transitions. [2025-02-05 20:00:47,116 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 668 transitions. Word has length 163 [2025-02-05 20:00:47,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:47,116 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 668 transitions. [2025-02-05 20:00:47,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:47,116 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 668 transitions. [2025-02-05 20:00:47,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 20:00:47,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:47,117 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:00:47,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 20:00:47,117 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:47,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:47,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2052595625, now seen corresponding path program 1 times [2025-02-05 20:00:47,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:47,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37290189] [2025-02-05 20:00:47,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:47,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:47,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 20:00:47,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 20:00:47,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:47,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:47,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:47,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:47,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37290189] [2025-02-05 20:00:47,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37290189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:47,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:47,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:00:47,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953491194] [2025-02-05 20:00:47,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:47,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:00:47,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:47,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:00:47,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:47,752 INFO L87 Difference]: Start difference. First operand 456 states and 668 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:48,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:48,018 INFO L93 Difference]: Finished difference Result 802 states and 1181 transitions. [2025-02-05 20:00:48,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:00:48,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-02-05 20:00:48,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:48,020 INFO L225 Difference]: With dead ends: 802 [2025-02-05 20:00:48,020 INFO L226 Difference]: Without dead ends: 519 [2025-02-05 20:00:48,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:00:48,021 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 983 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:48,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 1551 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:48,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-02-05 20:00:48,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 458. [2025-02-05 20:00:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.4660831509846828) internal successors, (670), 457 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 670 transitions. [2025-02-05 20:00:48,029 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 670 transitions. Word has length 164 [2025-02-05 20:00:48,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:48,029 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 670 transitions. [2025-02-05 20:00:48,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 670 transitions. [2025-02-05 20:00:48,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 20:00:48,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:48,030 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:00:48,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 20:00:48,031 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:48,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:48,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1934421627, now seen corresponding path program 1 times [2025-02-05 20:00:48,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:48,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954955913] [2025-02-05 20:00:48,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:48,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:48,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 20:00:48,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 20:00:48,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:48,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:48,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:48,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954955913] [2025-02-05 20:00:48,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954955913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:48,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:48,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:00:48,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937053293] [2025-02-05 20:00:48,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:48,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:00:48,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:48,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:00:48,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:48,691 INFO L87 Difference]: Start difference. First operand 458 states and 670 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:48,978 INFO L93 Difference]: Finished difference Result 782 states and 1151 transitions. [2025-02-05 20:00:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:00:48,979 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2025-02-05 20:00:48,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:48,981 INFO L225 Difference]: With dead ends: 782 [2025-02-05 20:00:48,981 INFO L226 Difference]: Without dead ends: 521 [2025-02-05 20:00:48,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:00:48,982 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 966 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:48,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 1652 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:48,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-02-05 20:00:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 461. [2025-02-05 20:00:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.4652173913043478) internal successors, (674), 460 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 674 transitions. [2025-02-05 20:00:48,990 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 674 transitions. Word has length 165 [2025-02-05 20:00:48,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:48,990 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 674 transitions. [2025-02-05 20:00:48,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 674 transitions. [2025-02-05 20:00:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 20:00:48,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:48,991 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:00:48,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 20:00:48,991 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:48,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:48,992 INFO L85 PathProgramCache]: Analyzing trace with hash 146747599, now seen corresponding path program 1 times [2025-02-05 20:00:48,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:48,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724039230] [2025-02-05 20:00:48,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:48,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:49,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 20:00:49,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 20:00:49,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:49,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:49,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:49,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724039230] [2025-02-05 20:00:49,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724039230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:49,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:49,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:49,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571637921] [2025-02-05 20:00:49,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:49,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:49,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:49,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:49,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:49,557 INFO L87 Difference]: Start difference. First operand 461 states and 674 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:49,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:49,801 INFO L93 Difference]: Finished difference Result 776 states and 1141 transitions. [2025-02-05 20:00:49,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:49,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2025-02-05 20:00:49,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:49,803 INFO L225 Difference]: With dead ends: 776 [2025-02-05 20:00:49,803 INFO L226 Difference]: Without dead ends: 515 [2025-02-05 20:00:49,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:49,804 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 929 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:49,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 1048 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:49,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-02-05 20:00:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 488. [2025-02-05 20:00:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.4640657084188913) internal successors, (713), 487 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 713 transitions. [2025-02-05 20:00:49,812 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 713 transitions. Word has length 166 [2025-02-05 20:00:49,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:49,813 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 713 transitions. [2025-02-05 20:00:49,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:49,813 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 713 transitions. [2025-02-05 20:00:49,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 20:00:49,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:49,814 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:00:49,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 20:00:49,814 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:49,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:49,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1617300910, now seen corresponding path program 1 times [2025-02-05 20:00:49,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:49,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002709084] [2025-02-05 20:00:49,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:49,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:49,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 20:00:50,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 20:00:50,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:50,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:50,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:50,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002709084] [2025-02-05 20:00:50,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002709084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:50,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:50,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:00:50,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886598736] [2025-02-05 20:00:50,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:50,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:00:50,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:50,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:00:50,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:50,479 INFO L87 Difference]: Start difference. First operand 488 states and 713 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:50,924 INFO L93 Difference]: Finished difference Result 784 states and 1152 transitions. [2025-02-05 20:00:50,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:00:50,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-05 20:00:50,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:50,927 INFO L225 Difference]: With dead ends: 784 [2025-02-05 20:00:50,927 INFO L226 Difference]: Without dead ends: 523 [2025-02-05 20:00:50,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:00:50,928 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 948 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:50,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1753 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:00:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-02-05 20:00:50,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 491. [2025-02-05 20:00:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.463265306122449) internal successors, (717), 490 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:50,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 717 transitions. [2025-02-05 20:00:50,938 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 717 transitions. Word has length 167 [2025-02-05 20:00:50,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:50,938 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 717 transitions. [2025-02-05 20:00:50,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 717 transitions. [2025-02-05 20:00:50,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 20:00:50,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:50,941 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:00:50,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 20:00:50,941 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:50,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:50,941 INFO L85 PathProgramCache]: Analyzing trace with hash 538502325, now seen corresponding path program 1 times [2025-02-05 20:00:50,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:50,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586022150] [2025-02-05 20:00:50,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:50,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:50,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 20:00:51,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 20:00:51,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:51,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:51,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:51,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586022150] [2025-02-05 20:00:51,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586022150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:51,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:51,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:51,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345730779] [2025-02-05 20:00:51,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:51,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:51,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:51,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:51,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:51,626 INFO L87 Difference]: Start difference. First operand 491 states and 717 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:51,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:51,865 INFO L93 Difference]: Finished difference Result 781 states and 1147 transitions. [2025-02-05 20:00:51,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:51,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-02-05 20:00:51,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:51,868 INFO L225 Difference]: With dead ends: 781 [2025-02-05 20:00:51,868 INFO L226 Difference]: Without dead ends: 520 [2025-02-05 20:00:51,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:51,869 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 917 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:51,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 1045 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:51,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-02-05 20:00:51,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 518. [2025-02-05 20:00:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 1.4622823984526112) internal successors, (756), 517 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 756 transitions. [2025-02-05 20:00:51,881 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 756 transitions. Word has length 168 [2025-02-05 20:00:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:51,882 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 756 transitions. [2025-02-05 20:00:51,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 756 transitions. [2025-02-05 20:00:51,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-05 20:00:51,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:51,884 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:00:51,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 20:00:51,884 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:51,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:51,885 INFO L85 PathProgramCache]: Analyzing trace with hash -836783921, now seen corresponding path program 1 times [2025-02-05 20:00:51,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:51,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947201824] [2025-02-05 20:00:51,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:51,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:51,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-05 20:00:52,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-05 20:00:52,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:52,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:52,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:52,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947201824] [2025-02-05 20:00:52,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947201824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:52,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:52,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:00:52,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176707088] [2025-02-05 20:00:52,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:52,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:00:52,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:52,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:00:52,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:52,569 INFO L87 Difference]: Start difference. First operand 518 states and 756 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:52,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:52,857 INFO L93 Difference]: Finished difference Result 786 states and 1153 transitions. [2025-02-05 20:00:52,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:00:52,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2025-02-05 20:00:52,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:52,859 INFO L225 Difference]: With dead ends: 786 [2025-02-05 20:00:52,861 INFO L226 Difference]: Without dead ends: 525 [2025-02-05 20:00:52,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:00:52,863 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 925 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:52,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 1750 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:52,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-02-05 20:00:52,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 521. [2025-02-05 20:00:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 1.4615384615384615) internal successors, (760), 520 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 760 transitions. [2025-02-05 20:00:52,873 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 760 transitions. Word has length 169 [2025-02-05 20:00:52,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:52,873 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 760 transitions. [2025-02-05 20:00:52,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 760 transitions. [2025-02-05 20:00:52,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-05 20:00:52,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:52,875 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:00:52,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 20:00:52,875 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:52,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:52,876 INFO L85 PathProgramCache]: Analyzing trace with hash -240840149, now seen corresponding path program 1 times [2025-02-05 20:00:52,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:52,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742302258] [2025-02-05 20:00:52,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:52,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:52,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-05 20:00:53,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-05 20:00:53,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:53,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:53,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:53,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742302258] [2025-02-05 20:00:53,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742302258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:53,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:53,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:53,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711288677] [2025-02-05 20:00:53,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:53,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:53,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:53,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:53,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:53,412 INFO L87 Difference]: Start difference. First operand 521 states and 760 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:53,633 INFO L93 Difference]: Finished difference Result 901 states and 1318 transitions. [2025-02-05 20:00:53,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:53,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-02-05 20:00:53,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:53,636 INFO L225 Difference]: With dead ends: 901 [2025-02-05 20:00:53,636 INFO L226 Difference]: Without dead ends: 521 [2025-02-05 20:00:53,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:53,636 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 973 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:53,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 1049 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-02-05 20:00:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2025-02-05 20:00:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 1.4596153846153845) internal successors, (759), 520 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 759 transitions. [2025-02-05 20:00:53,644 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 759 transitions. Word has length 170 [2025-02-05 20:00:53,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:53,644 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 759 transitions. [2025-02-05 20:00:53,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:53,644 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 759 transitions. [2025-02-05 20:00:53,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-05 20:00:53,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:53,645 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:00:53,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 20:00:53,646 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:53,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:53,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1606676561, now seen corresponding path program 1 times [2025-02-05 20:00:53,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:53,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711846540] [2025-02-05 20:00:53,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:53,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:53,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 20:00:53,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 20:00:53,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:53,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:54,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:54,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711846540] [2025-02-05 20:00:54,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711846540] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:00:54,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900936988] [2025-02-05 20:00:54,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:54,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:00:54,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:00:54,306 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 20:00:54,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 20:00:54,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 20:00:54,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 20:00:54,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:54,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:54,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-05 20:00:54,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:00:54,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:54,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:00:54,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900936988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:54,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:00:54,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-02-05 20:00:54,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324145207] [2025-02-05 20:00:54,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:54,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:00:54,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:54,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:00:54,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:00:54,997 INFO L87 Difference]: Start difference. First operand 521 states and 759 transitions. Second operand has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:55,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:55,416 INFO L93 Difference]: Finished difference Result 973 states and 1421 transitions. [2025-02-05 20:00:55,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:00:55,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2025-02-05 20:00:55,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:55,419 INFO L225 Difference]: With dead ends: 973 [2025-02-05 20:00:55,419 INFO L226 Difference]: Without dead ends: 520 [2025-02-05 20:00:55,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-02-05 20:00:55,420 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 1005 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:55,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1525 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:00:55,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-02-05 20:00:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2025-02-05 20:00:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 519 states have (on average 1.4566473988439306) internal successors, (756), 519 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 756 transitions. [2025-02-05 20:00:55,429 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 756 transitions. Word has length 171 [2025-02-05 20:00:55,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:55,430 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 756 transitions. [2025-02-05 20:00:55,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 756 transitions. [2025-02-05 20:00:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-05 20:00:55,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:55,431 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:00:55,441 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 20:00:55,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 20:00:55,633 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:55,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:55,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1511480607, now seen corresponding path program 1 times [2025-02-05 20:00:55,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:55,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435221727] [2025-02-05 20:00:55,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:55,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:55,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 20:00:55,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 20:00:55,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:55,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:56,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:56,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435221727] [2025-02-05 20:00:56,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435221727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:56,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:56,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:56,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353157796] [2025-02-05 20:00:56,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:56,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:56,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:56,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:56,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:56,265 INFO L87 Difference]: Start difference. First operand 520 states and 756 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:56,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:56,500 INFO L93 Difference]: Finished difference Result 868 states and 1268 transitions. [2025-02-05 20:00:56,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:56,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2025-02-05 20:00:56,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:56,503 INFO L225 Difference]: With dead ends: 868 [2025-02-05 20:00:56,503 INFO L226 Difference]: Without dead ends: 518 [2025-02-05 20:00:56,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:56,504 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 948 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:56,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1049 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-02-05 20:00:56,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2025-02-05 20:00:56,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 1.4564796905222437) internal successors, (753), 517 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 753 transitions. [2025-02-05 20:00:56,513 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 753 transitions. Word has length 172 [2025-02-05 20:00:56,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:56,513 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 753 transitions. [2025-02-05 20:00:56,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:56,513 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 753 transitions. [2025-02-05 20:00:56,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-05 20:00:56,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:56,515 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:00:56,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 20:00:56,515 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:56,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:56,515 INFO L85 PathProgramCache]: Analyzing trace with hash 86181634, now seen corresponding path program 1 times [2025-02-05 20:00:56,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:56,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001425031] [2025-02-05 20:00:56,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:56,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:56,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 20:00:56,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 20:00:56,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:56,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:57,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:57,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001425031] [2025-02-05 20:00:57,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001425031] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:00:57,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800871048] [2025-02-05 20:00:57,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:57,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:00:57,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:00:57,747 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 20:00:57,751 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 20:00:58,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 20:00:58,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 20:00:58,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:58,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:58,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-02-05 20:00:58,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:00:58,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:58,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:00:59,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:59,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800871048] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:00:59,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:00:59,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 12] total 33 [2025-02-05 20:00:59,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148715929] [2025-02-05 20:00:59,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:00:59,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-05 20:00:59,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:59,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-05 20:00:59,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 20:00:59,840 INFO L87 Difference]: Start difference. First operand 518 states and 753 transitions. Second operand has 33 states, 33 states have (on average 15.212121212121213) internal successors, (502), 33 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:01,744 INFO L93 Difference]: Finished difference Result 1752 states and 2563 transitions. [2025-02-05 20:01:01,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-05 20:01:01,745 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 15.212121212121213) internal successors, (502), 33 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2025-02-05 20:01:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:01,749 INFO L225 Difference]: With dead ends: 1752 [2025-02-05 20:01:01,749 INFO L226 Difference]: Without dead ends: 1293 [2025-02-05 20:01:01,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=568, Invalid=2854, Unknown=0, NotChecked=0, Total=3422 [2025-02-05 20:01:01,751 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 10848 mSDsluCounter, 5721 mSDsCounter, 0 mSdLazyCounter, 2954 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10848 SdHoareTripleChecker+Valid, 6012 SdHoareTripleChecker+Invalid, 2964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:01,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10848 Valid, 6012 Invalid, 2964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2954 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 20:01:01,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2025-02-05 20:01:01,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 964. [2025-02-05 20:01:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 963 states have (on average 1.4548286604361371) internal successors, (1401), 963 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1401 transitions. [2025-02-05 20:01:01,768 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1401 transitions. Word has length 172 [2025-02-05 20:01:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:01,768 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1401 transitions. [2025-02-05 20:01:01,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 15.212121212121213) internal successors, (502), 33 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1401 transitions. [2025-02-05 20:01:01,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 20:01:01,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:01,770 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:01:01,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 20:01:01,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:01,974 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:01,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:01,976 INFO L85 PathProgramCache]: Analyzing trace with hash 795089613, now seen corresponding path program 1 times [2025-02-05 20:01:01,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:01,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389008812] [2025-02-05 20:01:01,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:01,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:02,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 20:01:02,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 20:01:02,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:02,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:02,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:02,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389008812] [2025-02-05 20:01:02,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389008812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:02,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:02,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:01:02,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835863119] [2025-02-05 20:01:02,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:02,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:01:02,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:02,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:01:02,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:01:02,348 INFO L87 Difference]: Start difference. First operand 964 states and 1401 transitions. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:02,559 INFO L93 Difference]: Finished difference Result 1904 states and 2771 transitions. [2025-02-05 20:01:02,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:01:02,560 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2025-02-05 20:01:02,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:02,562 INFO L225 Difference]: With dead ends: 1904 [2025-02-05 20:01:02,562 INFO L226 Difference]: Without dead ends: 991 [2025-02-05 20:01:02,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:01:02,564 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 5 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:02,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2147 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:01:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-02-05 20:01:02,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2025-02-05 20:01:02,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.4505050505050505) internal successors, (1436), 990 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1436 transitions. [2025-02-05 20:01:02,577 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1436 transitions. Word has length 173 [2025-02-05 20:01:02,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:02,577 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1436 transitions. [2025-02-05 20:01:02,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1436 transitions. [2025-02-05 20:01:02,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 20:01:02,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:02,579 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:01:02,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 20:01:02,579 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:02,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:02,580 INFO L85 PathProgramCache]: Analyzing trace with hash 387275400, now seen corresponding path program 1 times [2025-02-05 20:01:02,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:02,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482108712] [2025-02-05 20:01:02,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:02,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:02,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 20:01:02,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 20:01:02,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:02,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:02,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:02,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482108712] [2025-02-05 20:01:02,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482108712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:02,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:02,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:01:02,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666049251] [2025-02-05 20:01:02,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:02,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:01:02,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:02,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:01:02,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:01:02,844 INFO L87 Difference]: Start difference. First operand 991 states and 1436 transitions. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:03,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:03,021 INFO L93 Difference]: Finished difference Result 1478 states and 2143 transitions. [2025-02-05 20:01:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:01:03,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2025-02-05 20:01:03,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:03,024 INFO L225 Difference]: With dead ends: 1478 [2025-02-05 20:01:03,025 INFO L226 Difference]: Without dead ends: 1001 [2025-02-05 20:01:03,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:01:03,026 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 1033 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:03,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 1060 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:01:03,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2025-02-05 20:01:03,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 981. [2025-02-05 20:01:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 1.4489795918367347) internal successors, (1420), 980 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1420 transitions. [2025-02-05 20:01:03,039 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1420 transitions. Word has length 173 [2025-02-05 20:01:03,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:03,039 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1420 transitions. [2025-02-05 20:01:03,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1420 transitions. [2025-02-05 20:01:03,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 20:01:03,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:03,041 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:01:03,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 20:01:03,041 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:03,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:03,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1486644628, now seen corresponding path program 1 times [2025-02-05 20:01:03,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:03,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068534672] [2025-02-05 20:01:03,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:03,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:03,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 20:01:03,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 20:01:03,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:03,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:03,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:03,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068534672] [2025-02-05 20:01:03,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068534672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:03,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:03,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:01:03,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524252532] [2025-02-05 20:01:03,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:03,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:01:03,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:03,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:01:03,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:01:03,285 INFO L87 Difference]: Start difference. First operand 981 states and 1420 transitions. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:03,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:03,481 INFO L93 Difference]: Finished difference Result 1939 states and 2810 transitions. [2025-02-05 20:01:03,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:01:03,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2025-02-05 20:01:03,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:03,484 INFO L225 Difference]: With dead ends: 1939 [2025-02-05 20:01:03,484 INFO L226 Difference]: Without dead ends: 1014 [2025-02-05 20:01:03,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:01:03,486 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 1051 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:03,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 1061 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:01:03,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2025-02-05 20:01:03,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 978. [2025-02-05 20:01:03,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 1.4472876151484135) internal successors, (1414), 977 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1414 transitions. [2025-02-05 20:01:03,500 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1414 transitions. Word has length 174 [2025-02-05 20:01:03,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:03,500 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1414 transitions. [2025-02-05 20:01:03,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:03,500 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1414 transitions. [2025-02-05 20:01:03,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 20:01:03,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:03,502 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 20:01:03,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 20:01:03,502 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:03,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:03,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1497630831, now seen corresponding path program 1 times [2025-02-05 20:01:03,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:03,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845104201] [2025-02-05 20:01:03,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:03,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:03,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 20:01:03,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 20:01:03,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:03,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:03,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:03,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845104201] [2025-02-05 20:01:03,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845104201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:03,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:03,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:01:03,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835017435] [2025-02-05 20:01:03,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:03,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:01:03,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:03,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:01:03,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:01:03,766 INFO L87 Difference]: Start difference. First operand 978 states and 1414 transitions. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:03,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:03,944 INFO L93 Difference]: Finished difference Result 1728 states and 2510 transitions. [2025-02-05 20:01:03,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:01:03,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2025-02-05 20:01:03,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:03,947 INFO L225 Difference]: With dead ends: 1728 [2025-02-05 20:01:03,947 INFO L226 Difference]: Without dead ends: 802 [2025-02-05 20:01:03,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:01:03,948 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 1069 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:03,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1054 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:01:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-02-05 20:01:03,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 772. [2025-02-05 20:01:03,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 771 states have (on average 1.4552529182879377) internal successors, (1122), 771 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1122 transitions. [2025-02-05 20:01:03,957 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1122 transitions. Word has length 174 [2025-02-05 20:01:03,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:03,957 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1122 transitions. [2025-02-05 20:01:03,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:03,958 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1122 transitions. [2025-02-05 20:01:03,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-05 20:01:03,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:03,959 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:03,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 20:01:03,960 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:03,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:03,960 INFO L85 PathProgramCache]: Analyzing trace with hash -128551752, now seen corresponding path program 1 times [2025-02-05 20:01:03,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:03,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484191343] [2025-02-05 20:01:03,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:03,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:04,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-05 20:01:05,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-05 20:01:05,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:05,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:06,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:06,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484191343] [2025-02-05 20:01:06,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484191343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:06,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:06,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:01:06,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557293077] [2025-02-05 20:01:06,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:06,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:01:06,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:06,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:01:06,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:01:06,422 INFO L87 Difference]: Start difference. First operand 772 states and 1122 transitions. Second operand has 9 states, 9 states have (on average 33.55555555555556) internal successors, (302), 9 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:06,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:06,969 INFO L93 Difference]: Finished difference Result 2686 states and 3966 transitions. [2025-02-05 20:01:06,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 20:01:06,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.55555555555556) internal successors, (302), 9 states have internal predecessors, (302), 0 states have call successors, (0), 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 302 [2025-02-05 20:01:06,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:06,975 INFO L225 Difference]: With dead ends: 2686 [2025-02-05 20:01:06,975 INFO L226 Difference]: Without dead ends: 2161 [2025-02-05 20:01:06,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:01:06,976 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 1520 mSDsluCounter, 3181 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 3773 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:06,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 3773 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:01:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2025-02-05 20:01:06,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 1287. [2025-02-05 20:01:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1286 states have (on average 1.464230171073095) internal successors, (1883), 1286 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:06,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1883 transitions. [2025-02-05 20:01:06,992 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1883 transitions. Word has length 302 [2025-02-05 20:01:06,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:06,992 INFO L471 AbstractCegarLoop]: Abstraction has 1287 states and 1883 transitions. [2025-02-05 20:01:06,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.55555555555556) internal successors, (302), 9 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:06,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1883 transitions. [2025-02-05 20:01:06,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-05 20:01:06,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:06,995 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:06,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 20:01:06,995 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:06,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:06,995 INFO L85 PathProgramCache]: Analyzing trace with hash -525312005, now seen corresponding path program 1 times [2025-02-05 20:01:06,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:06,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782357335] [2025-02-05 20:01:06,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:06,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:07,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-05 20:01:07,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-05 20:01:07,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:07,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:08,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:08,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782357335] [2025-02-05 20:01:08,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782357335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:08,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:08,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:01:08,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91323980] [2025-02-05 20:01:08,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:08,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:01:08,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:08,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:01:08,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:01:08,339 INFO L87 Difference]: Start difference. First operand 1287 states and 1883 transitions. Second operand has 7 states, 7 states have (on average 43.285714285714285) internal successors, (303), 7 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:08,960 INFO L93 Difference]: Finished difference Result 3254 states and 4802 transitions. [2025-02-05 20:01:08,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:01:08,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.285714285714285) internal successors, (303), 7 states have internal predecessors, (303), 0 states have call successors, (0), 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 303 [2025-02-05 20:01:08,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:08,966 INFO L225 Difference]: With dead ends: 3254 [2025-02-05 20:01:08,966 INFO L226 Difference]: Without dead ends: 2214 [2025-02-05 20:01:08,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:01:08,968 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 1557 mSDsluCounter, 2310 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 3143 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:08,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 3143 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:01:08,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2025-02-05 20:01:08,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 1309. [2025-02-05 20:01:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1309 states, 1308 states have (on average 1.459480122324159) internal successors, (1909), 1308 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1909 transitions. [2025-02-05 20:01:09,000 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1909 transitions. Word has length 303 [2025-02-05 20:01:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:09,001 INFO L471 AbstractCegarLoop]: Abstraction has 1309 states and 1909 transitions. [2025-02-05 20:01:09,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.285714285714285) internal successors, (303), 7 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1909 transitions. [2025-02-05 20:01:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-02-05 20:01:09,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:09,005 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:09,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 20:01:09,006 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:09,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:09,006 INFO L85 PathProgramCache]: Analyzing trace with hash -756366818, now seen corresponding path program 1 times [2025-02-05 20:01:09,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:09,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418691818] [2025-02-05 20:01:09,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:09,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:09,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-02-05 20:01:10,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-02-05 20:01:10,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:10,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 20:01:10,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:10,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418691818] [2025-02-05 20:01:10,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418691818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:10,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:10,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:01:10,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531944888] [2025-02-05 20:01:10,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:10,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:01:10,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:10,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:01:10,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:01:10,527 INFO L87 Difference]: Start difference. First operand 1309 states and 1909 transitions. Second operand has 7 states, 7 states have (on average 42.57142857142857) internal successors, (298), 7 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:10,798 INFO L93 Difference]: Finished difference Result 2391 states and 3504 transitions. [2025-02-05 20:01:10,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:01:10,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 42.57142857142857) internal successors, (298), 7 states have internal predecessors, (298), 0 states have call successors, (0), 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 304 [2025-02-05 20:01:10,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:10,801 INFO L225 Difference]: With dead ends: 2391 [2025-02-05 20:01:10,802 INFO L226 Difference]: Without dead ends: 1329 [2025-02-05 20:01:10,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:01:10,803 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 287 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:10,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1579 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:01:10,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2025-02-05 20:01:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1329. [2025-02-05 20:01:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1328 states have (on average 1.4555722891566265) internal successors, (1933), 1328 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1933 transitions. [2025-02-05 20:01:10,815 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1933 transitions. Word has length 304 [2025-02-05 20:01:10,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:10,815 INFO L471 AbstractCegarLoop]: Abstraction has 1329 states and 1933 transitions. [2025-02-05 20:01:10,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 42.57142857142857) internal successors, (298), 7 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1933 transitions. [2025-02-05 20:01:10,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-02-05 20:01:10,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:10,818 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:10,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 20:01:10,818 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:10,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:10,818 INFO L85 PathProgramCache]: Analyzing trace with hash -2134729891, now seen corresponding path program 1 times [2025-02-05 20:01:10,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:10,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390400090] [2025-02-05 20:01:10,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:10,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:10,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-02-05 20:01:11,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-02-05 20:01:11,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:11,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 140 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:12,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:12,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390400090] [2025-02-05 20:01:12,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390400090] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:12,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359739371] [2025-02-05 20:01:12,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:12,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:12,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:12,664 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:01:12,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 20:01:13,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-02-05 20:01:13,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-02-05 20:01:13,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:13,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:13,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 2008 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-05 20:01:13,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 134 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:14,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:01:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 134 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:15,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359739371] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:01:15,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:01:15,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 29 [2025-02-05 20:01:15,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104691230] [2025-02-05 20:01:15,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:01:15,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 20:01:15,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:15,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 20:01:15,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2025-02-05 20:01:15,387 INFO L87 Difference]: Start difference. First operand 1329 states and 1933 transitions. Second operand has 29 states, 29 states have (on average 22.82758620689655) internal successors, (662), 29 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:20,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:20,668 INFO L93 Difference]: Finished difference Result 11962 states and 17634 transitions. [2025-02-05 20:01:20,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-02-05 20:01:20,669 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 22.82758620689655) internal successors, (662), 29 states have internal predecessors, (662), 0 states have call successors, (0), 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 304 [2025-02-05 20:01:20,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:20,698 INFO L225 Difference]: With dead ends: 11962 [2025-02-05 20:01:20,700 INFO L226 Difference]: Without dead ends: 10733 [2025-02-05 20:01:20,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 590 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5292 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2663, Invalid=14107, Unknown=0, NotChecked=0, Total=16770 [2025-02-05 20:01:20,707 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 16198 mSDsluCounter, 7969 mSDsCounter, 0 mSdLazyCounter, 3601 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16198 SdHoareTripleChecker+Valid, 8543 SdHoareTripleChecker+Invalid, 3609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:20,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16198 Valid, 8543 Invalid, 3609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 3601 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 20:01:20,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10733 states. [2025-02-05 20:01:20,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10733 to 2335. [2025-02-05 20:01:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2334 states have (on average 1.443873179091688) internal successors, (3370), 2334 states have internal predecessors, (3370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:20,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3370 transitions. [2025-02-05 20:01:20,821 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3370 transitions. Word has length 304 [2025-02-05 20:01:20,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:20,821 INFO L471 AbstractCegarLoop]: Abstraction has 2335 states and 3370 transitions. [2025-02-05 20:01:20,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 22.82758620689655) internal successors, (662), 29 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3370 transitions. [2025-02-05 20:01:20,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-02-05 20:01:20,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:20,825 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:20,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 20:01:21,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:21,029 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:21,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:21,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1115168898, now seen corresponding path program 1 times [2025-02-05 20:01:21,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:21,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562327608] [2025-02-05 20:01:21,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:21,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:21,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-05 20:01:22,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-05 20:01:22,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:22,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 120 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:23,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:23,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562327608] [2025-02-05 20:01:23,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562327608] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:23,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12280014] [2025-02-05 20:01:23,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:23,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:23,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:23,673 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:01:23,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 20:01:24,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-05 20:01:24,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-05 20:01:24,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:24,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:24,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 2012 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-05 20:01:24,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:24,821 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 120 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:24,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:01:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 20:01:25,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12280014] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:25,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:01:25,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 25 [2025-02-05 20:01:25,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28694512] [2025-02-05 20:01:25,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:25,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:01:25,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:25,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:01:25,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-02-05 20:01:25,048 INFO L87 Difference]: Start difference. First operand 2335 states and 3370 transitions. Second operand has 8 states, 8 states have (on average 36.625) internal successors, (293), 8 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:25,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:25,488 INFO L93 Difference]: Finished difference Result 6453 states and 9426 transitions. [2025-02-05 20:01:25,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:01:25,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 36.625) internal successors, (293), 8 states have internal predecessors, (293), 0 states have call successors, (0), 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 306 [2025-02-05 20:01:25,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:25,496 INFO L225 Difference]: With dead ends: 6453 [2025-02-05 20:01:25,496 INFO L226 Difference]: Without dead ends: 4363 [2025-02-05 20:01:25,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2025-02-05 20:01:25,499 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 1436 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 2685 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:25,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 2685 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:01:25,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4363 states. [2025-02-05 20:01:25,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4363 to 2551. [2025-02-05 20:01:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 2550 states have (on average 1.443921568627451) internal successors, (3682), 2550 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:25,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 3682 transitions. [2025-02-05 20:01:25,529 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 3682 transitions. Word has length 306 [2025-02-05 20:01:25,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:25,529 INFO L471 AbstractCegarLoop]: Abstraction has 2551 states and 3682 transitions. [2025-02-05 20:01:25,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 36.625) internal successors, (293), 8 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:25,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 3682 transitions. [2025-02-05 20:01:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-02-05 20:01:25,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:25,538 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:25,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 20:01:25,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-05 20:01:25,742 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:25,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:25,743 INFO L85 PathProgramCache]: Analyzing trace with hash -452892007, now seen corresponding path program 1 times [2025-02-05 20:01:25,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:25,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353612287] [2025-02-05 20:01:25,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:25,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:25,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-05 20:01:26,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-05 20:01:26,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:26,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 13 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:27,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:27,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353612287] [2025-02-05 20:01:27,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353612287] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:27,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164396578] [2025-02-05 20:01:27,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:27,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:27,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:27,632 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:01:27,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 20:01:28,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-05 20:01:28,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-05 20:01:28,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:28,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:28,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 2012 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-05 20:01:28,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 99 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:29,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:01:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 20:01:29,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164396578] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:29,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:01:29,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 15] total 27 [2025-02-05 20:01:29,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588520271] [2025-02-05 20:01:29,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:29,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:01:29,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:29,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:01:29,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2025-02-05 20:01:29,638 INFO L87 Difference]: Start difference. First operand 2551 states and 3682 transitions. Second operand has 8 states, 8 states have (on average 37.5) internal successors, (300), 8 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:30,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:30,201 INFO L93 Difference]: Finished difference Result 7204 states and 10525 transitions. [2025-02-05 20:01:30,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:01:30,201 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 37.5) internal successors, (300), 8 states have internal predecessors, (300), 0 states have call successors, (0), 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 306 [2025-02-05 20:01:30,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:30,207 INFO L225 Difference]: With dead ends: 7204 [2025-02-05 20:01:30,207 INFO L226 Difference]: Without dead ends: 4898 [2025-02-05 20:01:30,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 596 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2025-02-05 20:01:30,209 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 1456 mSDsluCounter, 2303 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 3080 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:30,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1456 Valid, 3080 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:01:30,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4898 states. [2025-02-05 20:01:30,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4898 to 2588. [2025-02-05 20:01:30,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2588 states, 2587 states have (on average 1.4445303440278314) internal successors, (3737), 2587 states have internal predecessors, (3737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:30,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2588 states and 3737 transitions. [2025-02-05 20:01:30,230 INFO L78 Accepts]: Start accepts. Automaton has 2588 states and 3737 transitions. Word has length 306 [2025-02-05 20:01:30,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:30,230 INFO L471 AbstractCegarLoop]: Abstraction has 2588 states and 3737 transitions. [2025-02-05 20:01:30,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 37.5) internal successors, (300), 8 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:30,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 3737 transitions. [2025-02-05 20:01:30,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-05 20:01:30,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:30,233 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:30,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 20:01:30,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-05 20:01:30,434 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:30,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:30,434 INFO L85 PathProgramCache]: Analyzing trace with hash -724971108, now seen corresponding path program 1 times [2025-02-05 20:01:30,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:30,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964362476] [2025-02-05 20:01:30,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:30,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:30,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 20:01:31,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 20:01:31,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:31,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:32,366 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 20:01:32,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:32,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964362476] [2025-02-05 20:01:32,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964362476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:32,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:32,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:01:32,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137884739] [2025-02-05 20:01:32,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:32,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:01:32,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:32,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:01:32,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:01:32,367 INFO L87 Difference]: Start difference. First operand 2588 states and 3737 transitions. Second operand has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:32,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:32,759 INFO L93 Difference]: Finished difference Result 6331 states and 9220 transitions. [2025-02-05 20:01:32,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:01:32,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 307 [2025-02-05 20:01:32,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:32,764 INFO L225 Difference]: With dead ends: 6331 [2025-02-05 20:01:32,765 INFO L226 Difference]: Without dead ends: 3988 [2025-02-05 20:01:32,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:01:32,767 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 290 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:32,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 2708 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:01:32,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3988 states. [2025-02-05 20:01:32,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3988 to 2676. [2025-02-05 20:01:32,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2676 states, 2675 states have (on average 1.4418691588785046) internal successors, (3857), 2675 states have internal predecessors, (3857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:32,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 3857 transitions. [2025-02-05 20:01:32,788 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 3857 transitions. Word has length 307 [2025-02-05 20:01:32,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:32,788 INFO L471 AbstractCegarLoop]: Abstraction has 2676 states and 3857 transitions. [2025-02-05 20:01:32,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:32,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 3857 transitions. [2025-02-05 20:01:32,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-05 20:01:32,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:32,791 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:32,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 20:01:32,792 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:32,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:32,792 INFO L85 PathProgramCache]: Analyzing trace with hash -974897421, now seen corresponding path program 1 times [2025-02-05 20:01:32,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:32,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702319918] [2025-02-05 20:01:32,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:32,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:32,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 20:01:33,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 20:01:33,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:33,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 120 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:34,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:34,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702319918] [2025-02-05 20:01:34,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702319918] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:34,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062529298] [2025-02-05 20:01:34,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:34,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:34,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:34,643 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:01:34,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 20:01:35,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 20:01:35,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 20:01:35,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:35,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:35,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 2015 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-02-05 20:01:35,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:36,210 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 29 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:36,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:01:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 20:01:36,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062529298] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:36,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:01:36,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 17] total 32 [2025-02-05 20:01:36,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757017200] [2025-02-05 20:01:36,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:36,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:01:36,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:36,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:01:36,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2025-02-05 20:01:36,825 INFO L87 Difference]: Start difference. First operand 2676 states and 3857 transitions. Second operand has 9 states, 9 states have (on average 32.111111111111114) internal successors, (289), 9 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:37,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:37,413 INFO L93 Difference]: Finished difference Result 7398 states and 10775 transitions. [2025-02-05 20:01:37,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:01:37,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 32.111111111111114) internal successors, (289), 9 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 307 [2025-02-05 20:01:37,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:37,420 INFO L225 Difference]: With dead ends: 7398 [2025-02-05 20:01:37,420 INFO L226 Difference]: Without dead ends: 4967 [2025-02-05 20:01:37,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=992, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 20:01:37,423 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 1153 mSDsluCounter, 2242 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 2994 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:37,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 2994 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:01:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4967 states. [2025-02-05 20:01:37,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4967 to 3544. [2025-02-05 20:01:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3544 states, 3543 states have (on average 1.4532881738639571) internal successors, (5149), 3543 states have internal predecessors, (5149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:37,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3544 states to 3544 states and 5149 transitions. [2025-02-05 20:01:37,454 INFO L78 Accepts]: Start accepts. Automaton has 3544 states and 5149 transitions. Word has length 307 [2025-02-05 20:01:37,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:37,454 INFO L471 AbstractCegarLoop]: Abstraction has 3544 states and 5149 transitions. [2025-02-05 20:01:37,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 32.111111111111114) internal successors, (289), 9 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:37,454 INFO L276 IsEmpty]: Start isEmpty. Operand 3544 states and 5149 transitions. [2025-02-05 20:01:37,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-05 20:01:37,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:37,458 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:37,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 20:01:37,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-02-05 20:01:37,662 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:37,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:37,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1013169121, now seen corresponding path program 1 times [2025-02-05 20:01:37,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:37,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198832377] [2025-02-05 20:01:37,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:37,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:37,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 20:01:38,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 20:01:38,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:38,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 125 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:39,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:39,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198832377] [2025-02-05 20:01:39,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198832377] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:39,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79287518] [2025-02-05 20:01:39,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:39,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:39,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:39,311 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:01:39,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 20:01:39,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 20:01:40,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 20:01:40,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:40,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:40,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 2015 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-02-05 20:01:40,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 111 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:40,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:01:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 20:01:41,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79287518] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:41,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:01:41,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7, 17] total 27 [2025-02-05 20:01:41,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404093728] [2025-02-05 20:01:41,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:41,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:01:41,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:41,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:01:41,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2025-02-05 20:01:41,143 INFO L87 Difference]: Start difference. First operand 3544 states and 5149 transitions. Second operand has 8 states, 8 states have (on average 36.625) internal successors, (293), 8 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:41,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:41,635 INFO L93 Difference]: Finished difference Result 10192 states and 14933 transitions. [2025-02-05 20:01:41,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:01:41,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 36.625) internal successors, (293), 8 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 307 [2025-02-05 20:01:41,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:41,641 INFO L225 Difference]: With dead ends: 10192 [2025-02-05 20:01:41,641 INFO L226 Difference]: Without dead ends: 6893 [2025-02-05 20:01:41,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 596 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2025-02-05 20:01:41,645 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 540 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:41,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 2405 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:01:41,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6893 states. [2025-02-05 20:01:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6893 to 3696. [2025-02-05 20:01:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 3695 states have (on average 1.4497970230040595) internal successors, (5357), 3695 states have internal predecessors, (5357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 5357 transitions. [2025-02-05 20:01:41,679 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 5357 transitions. Word has length 307 [2025-02-05 20:01:41,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:41,679 INFO L471 AbstractCegarLoop]: Abstraction has 3696 states and 5357 transitions. [2025-02-05 20:01:41,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 36.625) internal successors, (293), 8 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:41,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 5357 transitions. [2025-02-05 20:01:41,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-05 20:01:41,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:41,683 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:41,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 20:01:41,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:41,884 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:41,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:41,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1954822076, now seen corresponding path program 1 times [2025-02-05 20:01:41,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:41,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121219184] [2025-02-05 20:01:41,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:41,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:41,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 20:01:43,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 20:01:43,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:43,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 13 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:43,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:43,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121219184] [2025-02-05 20:01:43,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121219184] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:43,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11134070] [2025-02-05 20:01:43,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:43,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:43,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:43,658 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:01:43,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 20:01:44,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 20:01:44,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 20:01:44,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:44,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:44,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 2015 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-02-05 20:01:44,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 71 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:46,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:01:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 65 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:48,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11134070] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:01:48,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:01:48,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 18] total 37 [2025-02-05 20:01:48,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51409460] [2025-02-05 20:01:48,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:01:48,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-05 20:01:48,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:48,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-05 20:01:48,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1161, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 20:01:48,085 INFO L87 Difference]: Start difference. First operand 3696 states and 5357 transitions. Second operand has 37 states, 37 states have (on average 24.486486486486488) internal successors, (906), 37 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:55,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:55,390 INFO L93 Difference]: Finished difference Result 25984 states and 38107 transitions. [2025-02-05 20:01:55,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2025-02-05 20:01:55,391 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 24.486486486486488) internal successors, (906), 37 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 307 [2025-02-05 20:01:55,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:55,408 INFO L225 Difference]: With dead ends: 25984 [2025-02-05 20:01:55,408 INFO L226 Difference]: Without dead ends: 22533 [2025-02-05 20:01:55,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 740 GetRequests, 587 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8110 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2690, Invalid=21180, Unknown=0, NotChecked=0, Total=23870 [2025-02-05 20:01:55,417 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 11667 mSDsluCounter, 18182 mSDsCounter, 0 mSdLazyCounter, 7784 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11667 SdHoareTripleChecker+Valid, 19165 SdHoareTripleChecker+Invalid, 7842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 7784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:55,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11667 Valid, 19165 Invalid, 7842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 7784 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-02-05 20:01:55,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22533 states. [2025-02-05 20:01:55,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22533 to 11340. [2025-02-05 20:01:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11340 states, 11339 states have (on average 1.4562130699356204) internal successors, (16512), 11339 states have internal predecessors, (16512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11340 states to 11340 states and 16512 transitions. [2025-02-05 20:01:55,541 INFO L78 Accepts]: Start accepts. Automaton has 11340 states and 16512 transitions. Word has length 307 [2025-02-05 20:01:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:55,541 INFO L471 AbstractCegarLoop]: Abstraction has 11340 states and 16512 transitions. [2025-02-05 20:01:55,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 24.486486486486488) internal successors, (906), 37 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:55,542 INFO L276 IsEmpty]: Start isEmpty. Operand 11340 states and 16512 transitions. [2025-02-05 20:01:55,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-02-05 20:01:55,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:55,548 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:55,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 20:01:55,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:55,753 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:55,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:55,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1660355731, now seen corresponding path program 1 times [2025-02-05 20:01:55,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:55,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699083887] [2025-02-05 20:01:55,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:55,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:55,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-05 20:01:56,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-05 20:01:56,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:56,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:57,565 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 126 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:57,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:57,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699083887] [2025-02-05 20:01:57,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699083887] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:57,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522052482] [2025-02-05 20:01:57,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:57,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:57,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:57,590 INFO L229 MonitoredProcess]: Starting monitored process 10 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 20:01:57,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 20:01:58,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes.