./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label06.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 635a20a5fbe25b0b925b40af9246e2b23986521025b17b70ac19e8d17c6a453c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:51:30,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:51:30,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:51:30,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:51:30,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:51:30,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:51:30,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:51:30,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:51:30,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:51:30,210 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:51:30,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:51:30,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:51:30,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:51:30,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:51:30,211 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:51:30,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:51:30,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:51:30,211 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:51:30,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:51:30,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:51:30,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:51:30,211 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:51:30,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:51:30,212 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:51:30,212 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:51:30,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:51:30,212 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:51:30,212 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:51:30,212 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:51:30,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:51:30,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:51:30,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:51:30,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:51:30,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:51:30,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:51:30,213 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:51:30,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:51:30,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:51:30,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:51:30,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:51:30,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:51:30,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:51:30,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:51:30,214 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 635a20a5fbe25b0b925b40af9246e2b23986521025b17b70ac19e8d17c6a453c [2025-02-05 11:51:30,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:51:30,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:51:30,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:51:30,523 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:51:30,523 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:51:30,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label06.c [2025-02-05 11:51:31,811 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2cf3993d/f20d4754fef34311b3dfb4c1988a0c30/FLAG89a560838 [2025-02-05 11:51:32,330 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:51:32,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label06.c [2025-02-05 11:51:32,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2cf3993d/f20d4754fef34311b3dfb4c1988a0c30/FLAG89a560838 [2025-02-05 11:51:32,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2cf3993d/f20d4754fef34311b3dfb4c1988a0c30 [2025-02-05 11:51:32,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:51:32,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:51:32,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:51:32,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:51:32,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:51:32,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:51:32" (1/1) ... [2025-02-05 11:51:32,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38ac104a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:51:32, skipping insertion in model container [2025-02-05 11:51:32,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:51:32" (1/1) ... [2025-02-05 11:51:32,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:51:32,650 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label06.c[6824,6837] [2025-02-05 11:51:32,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:51:32,951 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:51:32,975 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label06.c[6824,6837] [2025-02-05 11:51:33,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:51:33,126 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:51:33,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:51:33 WrapperNode [2025-02-05 11:51:33,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:51:33,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:51:33,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:51:33,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:51:33,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:51:33" (1/1) ... [2025-02-05 11:51:33,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:51:33" (1/1) ... [2025-02-05 11:51:33,278 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-02-05 11:51:33,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:51:33,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:51:33,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:51:33,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:51:33,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:51:33" (1/1) ... [2025-02-05 11:51:33,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:51:33" (1/1) ... [2025-02-05 11:51:33,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:51:33" (1/1) ... [2025-02-05 11:51:33,406 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 11:51:33,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:51:33" (1/1) ... [2025-02-05 11:51:33,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:51:33" (1/1) ... [2025-02-05 11:51:33,462 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:51:33" (1/1) ... [2025-02-05 11:51:33,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:51:33" (1/1) ... [2025-02-05 11:51:33,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:51:33" (1/1) ... [2025-02-05 11:51:33,496 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:51:33" (1/1) ... [2025-02-05 11:51:33,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:51:33,522 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:51:33,522 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:51:33,522 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:51:33,523 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:51:33" (1/1) ... [2025-02-05 11:51:33,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:51:33,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:51:33,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:51:33,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:51:33,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:51:33,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:51:33,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:51:33,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:51:33,643 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:51:33,645 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:51:35,650 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-02-05 11:51:35,752 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-02-05 11:51:35,752 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:51:35,772 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:51:35,773 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:51:35,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:51:35 BoogieIcfgContainer [2025-02-05 11:51:35,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:51:35,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:51:35,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:51:35,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:51:35,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:51:32" (1/3) ... [2025-02-05 11:51:35,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5708d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:51:35, skipping insertion in model container [2025-02-05 11:51:35,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:51:33" (2/3) ... [2025-02-05 11:51:35,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5708d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:51:35, skipping insertion in model container [2025-02-05 11:51:35,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:51:35" (3/3) ... [2025-02-05 11:51:35,781 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label06.c [2025-02-05 11:51:35,793 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:51:35,794 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label06.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:51:35,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:51:35,862 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;@373f6d12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:51:35,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:51:35,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 11:51:35,874 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:51:35,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:51:35,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:51:35,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:51:35,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1642177357, now seen corresponding path program 1 times [2025-02-05 11:51:35,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:51:35,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68073377] [2025-02-05 11:51:35,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:51:35,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:51:35,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 11:51:35,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 11:51:36,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:51:36,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:51:36,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:51:36,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:51:36,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68073377] [2025-02-05 11:51:36,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68073377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:51:36,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:51:36,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:51:36,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613235604] [2025-02-05 11:51:36,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:51:36,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:51:36,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:51:36,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:51:36,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:36,290 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:51:37,901 INFO L93 Difference]: Finished difference Result 1155 states and 2103 transitions. [2025-02-05 11:51:37,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:51:37,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-02-05 11:51:37,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:51:37,921 INFO L225 Difference]: With dead ends: 1155 [2025-02-05 11:51:37,921 INFO L226 Difference]: Without dead ends: 667 [2025-02-05 11:51:37,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:37,936 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 288 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:51:37,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 370 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 11:51:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-02-05 11:51:38,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2025-02-05 11:51:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.4789156626506024) internal successors, (982), 664 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions. [2025-02-05 11:51:38,039 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 56 [2025-02-05 11:51:38,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:51:38,040 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 982 transitions. [2025-02-05 11:51:38,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:38,040 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions. [2025-02-05 11:51:38,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 11:51:38,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:51:38,047 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:51:38,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:51:38,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:51:38,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:51:38,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1816387483, now seen corresponding path program 1 times [2025-02-05 11:51:38,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:51:38,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071599377] [2025-02-05 11:51:38,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:51:38,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:51:38,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 11:51:38,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 11:51:38,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:51:38,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:51:38,408 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:51:38,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:51:38,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071599377] [2025-02-05 11:51:38,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071599377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:51:38,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:51:38,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:51:38,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187050830] [2025-02-05 11:51:38,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:51:38,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:51:38,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:51:38,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:51:38,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:38,410 INFO L87 Difference]: Start difference. First operand 665 states and 982 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:39,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:51:39,838 INFO L93 Difference]: Finished difference Result 1953 states and 2893 transitions. [2025-02-05 11:51:39,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:51:39,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-02-05 11:51:39,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:51:39,845 INFO L225 Difference]: With dead ends: 1953 [2025-02-05 11:51:39,847 INFO L226 Difference]: Without dead ends: 1290 [2025-02-05 11:51:39,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:39,854 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 256 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:51:39,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 324 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 11:51:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-02-05 11:51:39,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1282. [2025-02-05 11:51:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 1.3981264637002342) internal successors, (1791), 1281 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1791 transitions. [2025-02-05 11:51:39,913 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1791 transitions. Word has length 131 [2025-02-05 11:51:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:51:39,917 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1791 transitions. [2025-02-05 11:51:39,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1791 transitions. [2025-02-05 11:51:39,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 11:51:39,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:51:39,921 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:51:39,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:51:39,925 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:51:39,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:51:39,925 INFO L85 PathProgramCache]: Analyzing trace with hash -624660079, now seen corresponding path program 1 times [2025-02-05 11:51:39,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:51:39,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937670861] [2025-02-05 11:51:39,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:51:39,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:51:39,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 11:51:39,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 11:51:39,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:51:39,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:51:40,164 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:51:40,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:51:40,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937670861] [2025-02-05 11:51:40,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937670861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:51:40,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:51:40,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:51:40,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203200060] [2025-02-05 11:51:40,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:51:40,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:51:40,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:51:40,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:51:40,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:40,170 INFO L87 Difference]: Start difference. First operand 1282 states and 1791 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:42,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:51:42,044 INFO L93 Difference]: Finished difference Result 3766 states and 5261 transitions. [2025-02-05 11:51:42,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:51:42,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2025-02-05 11:51:42,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:51:42,062 INFO L225 Difference]: With dead ends: 3766 [2025-02-05 11:51:42,063 INFO L226 Difference]: Without dead ends: 2486 [2025-02-05 11:51:42,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:42,069 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 271 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:51:42,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 338 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 11:51:42,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2025-02-05 11:51:42,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2182. [2025-02-05 11:51:42,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2181 states have (on average 1.2815222375057314) internal successors, (2795), 2181 states have internal predecessors, (2795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2795 transitions. [2025-02-05 11:51:42,140 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2795 transitions. Word has length 135 [2025-02-05 11:51:42,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:51:42,140 INFO L471 AbstractCegarLoop]: Abstraction has 2182 states and 2795 transitions. [2025-02-05 11:51:42,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:42,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2795 transitions. [2025-02-05 11:51:42,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-05 11:51:42,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:51:42,146 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:51:42,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:51:42,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:51:42,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:51:42,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1231631224, now seen corresponding path program 1 times [2025-02-05 11:51:42,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:51:42,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773495430] [2025-02-05 11:51:42,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:51:42,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:51:42,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 11:51:42,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 11:51:42,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:51:42,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:51:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:51:42,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:51:42,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773495430] [2025-02-05 11:51:42,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773495430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:51:42,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:51:42,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:51:42,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16794655] [2025-02-05 11:51:42,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:51:42,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:51:42,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:51:42,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:51:42,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:42,449 INFO L87 Difference]: Start difference. First operand 2182 states and 2795 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:44,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:51:44,048 INFO L93 Difference]: Finished difference Result 5567 states and 7266 transitions. [2025-02-05 11:51:44,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:51:44,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2025-02-05 11:51:44,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:51:44,070 INFO L225 Difference]: With dead ends: 5567 [2025-02-05 11:51:44,070 INFO L226 Difference]: Without dead ends: 3387 [2025-02-05 11:51:44,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:44,077 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 272 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:51:44,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 614 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 11:51:44,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states. [2025-02-05 11:51:44,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 3385. [2025-02-05 11:51:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 3384 states have (on average 1.216016548463357) internal successors, (4115), 3384 states have internal predecessors, (4115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:44,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4115 transitions. [2025-02-05 11:51:44,217 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4115 transitions. Word has length 252 [2025-02-05 11:51:44,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:51:44,222 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 4115 transitions. [2025-02-05 11:51:44,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4115 transitions. [2025-02-05 11:51:44,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-02-05 11:51:44,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:51:44,226 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:51:44,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:51:44,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:51:44,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:51:44,227 INFO L85 PathProgramCache]: Analyzing trace with hash 7749722, now seen corresponding path program 1 times [2025-02-05 11:51:44,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:51:44,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238641654] [2025-02-05 11:51:44,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:51:44,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:51:44,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-02-05 11:51:44,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-02-05 11:51:44,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:51:44,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:51:44,545 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-05 11:51:44,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:51:44,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238641654] [2025-02-05 11:51:44,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238641654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:51:44,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:51:44,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:51:44,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851971549] [2025-02-05 11:51:44,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:51:44,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:51:44,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:51:44,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:51:44,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:44,547 INFO L87 Difference]: Start difference. First operand 3385 states and 4115 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:45,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:51:45,772 INFO L93 Difference]: Finished difference Result 8870 states and 10887 transitions. [2025-02-05 11:51:45,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:51:45,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 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 338 [2025-02-05 11:51:45,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:51:45,785 INFO L225 Difference]: With dead ends: 8870 [2025-02-05 11:51:45,785 INFO L226 Difference]: Without dead ends: 5487 [2025-02-05 11:51:45,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:45,789 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 31 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:51:45,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 316 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 11:51:45,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5487 states. [2025-02-05 11:51:45,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5487 to 5484. [2025-02-05 11:51:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5484 states, 5483 states have (on average 1.1752690133138792) internal successors, (6444), 5483 states have internal predecessors, (6444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5484 states to 5484 states and 6444 transitions. [2025-02-05 11:51:45,850 INFO L78 Accepts]: Start accepts. Automaton has 5484 states and 6444 transitions. Word has length 338 [2025-02-05 11:51:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:51:45,850 INFO L471 AbstractCegarLoop]: Abstraction has 5484 states and 6444 transitions. [2025-02-05 11:51:45,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:45,851 INFO L276 IsEmpty]: Start isEmpty. Operand 5484 states and 6444 transitions. [2025-02-05 11:51:45,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-02-05 11:51:45,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:51:45,857 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:51:45,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:51:45,857 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:51:45,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:51:45,858 INFO L85 PathProgramCache]: Analyzing trace with hash -67806650, now seen corresponding path program 1 times [2025-02-05 11:51:45,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:51:45,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585793188] [2025-02-05 11:51:45,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:51:45,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:51:45,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-02-05 11:51:45,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-02-05 11:51:45,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:51:45,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:51:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-02-05 11:51:46,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:51:46,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585793188] [2025-02-05 11:51:46,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585793188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:51:46,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:51:46,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:51:46,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244475382] [2025-02-05 11:51:46,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:51:46,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:51:46,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:51:46,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:51:46,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:46,210 INFO L87 Difference]: Start difference. First operand 5484 states and 6444 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:47,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:51:47,378 INFO L93 Difference]: Finished difference Result 13065 states and 15599 transitions. [2025-02-05 11:51:47,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:51:47,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 402 [2025-02-05 11:51:47,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:51:47,395 INFO L225 Difference]: With dead ends: 13065 [2025-02-05 11:51:47,395 INFO L226 Difference]: Without dead ends: 7583 [2025-02-05 11:51:47,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:47,401 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 271 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:51:47,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 641 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:51:47,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7583 states. [2025-02-05 11:51:47,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7583 to 6985. [2025-02-05 11:51:47,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6985 states, 6984 states have (on average 1.1539232531500572) internal successors, (8059), 6984 states have internal predecessors, (8059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6985 states to 6985 states and 8059 transitions. [2025-02-05 11:51:47,482 INFO L78 Accepts]: Start accepts. Automaton has 6985 states and 8059 transitions. Word has length 402 [2025-02-05 11:51:47,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:51:47,483 INFO L471 AbstractCegarLoop]: Abstraction has 6985 states and 8059 transitions. [2025-02-05 11:51:47,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 6985 states and 8059 transitions. [2025-02-05 11:51:47,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2025-02-05 11:51:47,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:51:47,489 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:51:47,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:51:47,489 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:51:47,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:51:47,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1711071619, now seen corresponding path program 1 times [2025-02-05 11:51:47,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:51:47,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045724893] [2025-02-05 11:51:47,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:51:47,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:51:47,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-02-05 11:51:47,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-02-05 11:51:47,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:51:47,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:51:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:51:47,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:51:47,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045724893] [2025-02-05 11:51:47,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045724893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:51:47,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:51:47,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:51:47,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115000435] [2025-02-05 11:51:47,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:51:47,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:51:47,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:51:47,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:51:47,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:47,802 INFO L87 Difference]: Start difference. First operand 6985 states and 8059 transitions. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:49,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:51:49,585 INFO L93 Difference]: Finished difference Result 15770 states and 18503 transitions. [2025-02-05 11:51:49,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:51:49,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 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 419 [2025-02-05 11:51:49,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:51:49,610 INFO L225 Difference]: With dead ends: 15770 [2025-02-05 11:51:49,612 INFO L226 Difference]: Without dead ends: 8787 [2025-02-05 11:51:49,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:49,620 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 248 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:51:49,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 629 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 11:51:49,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8787 states. [2025-02-05 11:51:49,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8787 to 8481. [2025-02-05 11:51:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8481 states, 8480 states have (on average 1.1386792452830188) internal successors, (9656), 8480 states have internal predecessors, (9656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:49,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8481 states to 8481 states and 9656 transitions. [2025-02-05 11:51:49,750 INFO L78 Accepts]: Start accepts. Automaton has 8481 states and 9656 transitions. Word has length 419 [2025-02-05 11:51:49,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:51:49,751 INFO L471 AbstractCegarLoop]: Abstraction has 8481 states and 9656 transitions. [2025-02-05 11:51:49,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:49,751 INFO L276 IsEmpty]: Start isEmpty. Operand 8481 states and 9656 transitions. [2025-02-05 11:51:49,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-02-05 11:51:49,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:51:49,756 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:51:49,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:51:49,757 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:51:49,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:51:49,758 INFO L85 PathProgramCache]: Analyzing trace with hash -38387339, now seen corresponding path program 1 times [2025-02-05 11:51:49,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:51:49,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781895088] [2025-02-05 11:51:49,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:51:49,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:51:49,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-02-05 11:51:49,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-02-05 11:51:49,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:51:49,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:51:49,962 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-02-05 11:51:49,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:51:49,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781895088] [2025-02-05 11:51:49,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781895088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:51:49,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:51:49,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:51:49,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879836054] [2025-02-05 11:51:49,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:51:49,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:51:49,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:51:49,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:51:49,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:49,963 INFO L87 Difference]: Start difference. First operand 8481 states and 9656 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:51:51,364 INFO L93 Difference]: Finished difference Result 20249 states and 23173 transitions. [2025-02-05 11:51:51,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:51:51,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 429 [2025-02-05 11:51:51,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:51:51,382 INFO L225 Difference]: With dead ends: 20249 [2025-02-05 11:51:51,382 INFO L226 Difference]: Without dead ends: 11770 [2025-02-05 11:51:51,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:51,390 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 260 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:51:51,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 310 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 11:51:51,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11770 states. [2025-02-05 11:51:51,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11770 to 7578. [2025-02-05 11:51:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7578 states, 7577 states have (on average 1.1493994984822489) internal successors, (8709), 7577 states have internal predecessors, (8709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 8709 transitions. [2025-02-05 11:51:51,471 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 8709 transitions. Word has length 429 [2025-02-05 11:51:51,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:51:51,472 INFO L471 AbstractCegarLoop]: Abstraction has 7578 states and 8709 transitions. [2025-02-05 11:51:51,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:51,472 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 8709 transitions. [2025-02-05 11:51:51,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-02-05 11:51:51,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:51:51,475 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:51:51,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:51:51,475 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:51:51,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:51:51,476 INFO L85 PathProgramCache]: Analyzing trace with hash 606422278, now seen corresponding path program 1 times [2025-02-05 11:51:51,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:51:51,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193769319] [2025-02-05 11:51:51,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:51:51,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:51:51,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-02-05 11:51:51,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-02-05 11:51:51,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:51:51,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:51:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2025-02-05 11:51:51,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:51:51,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193769319] [2025-02-05 11:51:51,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193769319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:51:51,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:51:51,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:51:51,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987934706] [2025-02-05 11:51:51,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:51:51,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:51:51,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:51:51,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:51:51,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:51,977 INFO L87 Difference]: Start difference. First operand 7578 states and 8709 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:51:52,962 INFO L93 Difference]: Finished difference Result 15453 states and 17727 transitions. [2025-02-05 11:51:52,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:51:52,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 446 [2025-02-05 11:51:52,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:51:52,983 INFO L225 Difference]: With dead ends: 15453 [2025-02-05 11:51:52,985 INFO L226 Difference]: Without dead ends: 7877 [2025-02-05 11:51:52,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:52,993 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:51:52,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 354 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:51:53,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7877 states. [2025-02-05 11:51:53,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7877 to 7877. [2025-02-05 11:51:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7877 states, 7876 states have (on average 1.1444895886236668) internal successors, (9014), 7876 states have internal predecessors, (9014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7877 states to 7877 states and 9014 transitions. [2025-02-05 11:51:53,092 INFO L78 Accepts]: Start accepts. Automaton has 7877 states and 9014 transitions. Word has length 446 [2025-02-05 11:51:53,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:51:53,092 INFO L471 AbstractCegarLoop]: Abstraction has 7877 states and 9014 transitions. [2025-02-05 11:51:53,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:53,092 INFO L276 IsEmpty]: Start isEmpty. Operand 7877 states and 9014 transitions. [2025-02-05 11:51:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-02-05 11:51:53,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:51:53,115 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:51:53,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:51:53,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:51:53,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:51:53,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2014139942, now seen corresponding path program 1 times [2025-02-05 11:51:53,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:51:53,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751873782] [2025-02-05 11:51:53,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:51:53,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:51:53,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-02-05 11:51:53,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-02-05 11:51:53,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:51:53,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:51:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2025-02-05 11:51:53,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:51:53,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751873782] [2025-02-05 11:51:53,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751873782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:51:53,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:51:53,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:51:53,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906523321] [2025-02-05 11:51:53,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:51:53,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:51:53,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:51:53,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:51:53,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:53,302 INFO L87 Difference]: Start difference. First operand 7877 states and 9014 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:54,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:51:54,541 INFO L93 Difference]: Finished difference Result 17844 states and 20678 transitions. [2025-02-05 11:51:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:51:54,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 520 [2025-02-05 11:51:54,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:51:54,553 INFO L225 Difference]: With dead ends: 17844 [2025-02-05 11:51:54,554 INFO L226 Difference]: Without dead ends: 10268 [2025-02-05 11:51:54,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:54,560 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 359 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:51:54,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 446 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 11:51:54,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10268 states. [2025-02-05 11:51:54,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10268 to 10268. [2025-02-05 11:51:54,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10268 states, 10267 states have (on average 1.146878348105581) internal successors, (11775), 10267 states have internal predecessors, (11775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10268 states to 10268 states and 11775 transitions. [2025-02-05 11:51:54,640 INFO L78 Accepts]: Start accepts. Automaton has 10268 states and 11775 transitions. Word has length 520 [2025-02-05 11:51:54,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:51:54,641 INFO L471 AbstractCegarLoop]: Abstraction has 10268 states and 11775 transitions. [2025-02-05 11:51:54,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:54,641 INFO L276 IsEmpty]: Start isEmpty. Operand 10268 states and 11775 transitions. [2025-02-05 11:51:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2025-02-05 11:51:54,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:51:54,644 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:51:54,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:51:54,645 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:51:54,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:51:54,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1206771577, now seen corresponding path program 1 times [2025-02-05 11:51:54,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:51:54,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673056594] [2025-02-05 11:51:54,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:51:54,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:51:54,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes. [2025-02-05 11:51:54,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements. [2025-02-05 11:51:54,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:51:54,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:51:54,957 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-02-05 11:51:54,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:51:54,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673056594] [2025-02-05 11:51:54,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673056594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:51:54,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:51:54,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:51:54,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366612636] [2025-02-05 11:51:54,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:51:54,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:51:54,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:51:54,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:51:54,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:54,959 INFO L87 Difference]: Start difference. First operand 10268 states and 11775 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:56,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:51:56,214 INFO L93 Difference]: Finished difference Result 25033 states and 28938 transitions. [2025-02-05 11:51:56,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:51:56,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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 544 [2025-02-05 11:51:56,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:51:56,246 INFO L225 Difference]: With dead ends: 25033 [2025-02-05 11:51:56,246 INFO L226 Difference]: Without dead ends: 15066 [2025-02-05 11:51:56,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:51:56,266 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 248 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:51:56,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 621 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 11:51:56,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15066 states. [2025-02-05 11:51:56,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15066 to 15055. [2025-02-05 11:51:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15055 states, 15054 states have (on average 1.1306629467251228) internal successors, (17021), 15054 states have internal predecessors, (17021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15055 states to 15055 states and 17021 transitions. [2025-02-05 11:51:56,388 INFO L78 Accepts]: Start accepts. Automaton has 15055 states and 17021 transitions. Word has length 544 [2025-02-05 11:51:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:51:56,389 INFO L471 AbstractCegarLoop]: Abstraction has 15055 states and 17021 transitions. [2025-02-05 11:51:56,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 15055 states and 17021 transitions. [2025-02-05 11:51:56,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-02-05 11:51:56,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:51:56,394 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:51:56,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:51:56,395 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:51:56,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:51:56,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1635949791, now seen corresponding path program 1 times [2025-02-05 11:51:56,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:51:56,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539643071] [2025-02-05 11:51:56,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:51:56,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:51:56,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-02-05 11:51:56,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-02-05 11:51:56,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:51:56,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:51:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 162 proven. 320 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-02-05 11:51:57,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:51:57,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539643071] [2025-02-05 11:51:57,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539643071] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:51:57,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69639673] [2025-02-05 11:51:57,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:51:57,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:51:57,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:51:57,204 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:51:57,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:51:57,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-02-05 11:51:57,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-02-05 11:51:57,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:51:57,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:51:57,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:51:57,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:51:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-02-05 11:51:57,456 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:51:57,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69639673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:51:57,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:51:57,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 11:51:57,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468889453] [2025-02-05 11:51:57,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:51:57,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:51:57,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:51:57,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:51:57,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:51:57,458 INFO L87 Difference]: Start difference. First operand 15055 states and 17021 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:58,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:51:58,949 INFO L93 Difference]: Finished difference Result 29506 states and 33400 transitions. [2025-02-05 11:51:58,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:51:58,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 598 [2025-02-05 11:51:58,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:51:58,969 INFO L225 Difference]: With dead ends: 29506 [2025-02-05 11:51:58,969 INFO L226 Difference]: Without dead ends: 14752 [2025-02-05 11:51:58,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:51:58,981 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 275 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:51:58,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 606 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 11:51:58,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14752 states. [2025-02-05 11:51:59,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14752 to 13854. [2025-02-05 11:51:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13854 states, 13853 states have (on average 1.081642965422652) internal successors, (14984), 13853 states have internal predecessors, (14984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13854 states to 13854 states and 14984 transitions. [2025-02-05 11:51:59,099 INFO L78 Accepts]: Start accepts. Automaton has 13854 states and 14984 transitions. Word has length 598 [2025-02-05 11:51:59,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:51:59,099 INFO L471 AbstractCegarLoop]: Abstraction has 13854 states and 14984 transitions. [2025-02-05 11:51:59,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:51:59,100 INFO L276 IsEmpty]: Start isEmpty. Operand 13854 states and 14984 transitions. [2025-02-05 11:51:59,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2025-02-05 11:51:59,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:51:59,106 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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 11:51:59,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 11:51:59,309 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,SelfDestructingSolverStorable11 [2025-02-05 11:51:59,310 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:51:59,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:51:59,311 INFO L85 PathProgramCache]: Analyzing trace with hash 360370569, now seen corresponding path program 1 times [2025-02-05 11:51:59,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:51:59,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320055403] [2025-02-05 11:51:59,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:51:59,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:51:59,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes. [2025-02-05 11:51:59,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements. [2025-02-05 11:51:59,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:51:59,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:51:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 604 proven. 39 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-02-05 11:51:59,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:51:59,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320055403] [2025-02-05 11:51:59,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320055403] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:51:59,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450771668] [2025-02-05 11:51:59,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:51:59,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:51:59,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:51:59,704 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:51:59,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 11:51:59,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes. [2025-02-05 11:51:59,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements. [2025-02-05 11:51:59,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:51:59,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:51:59,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 11:51:59,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:52:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 604 proven. 39 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-02-05 11:52:00,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:52:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 604 proven. 39 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-02-05 11:52:01,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450771668] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:52:01,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:52:01,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-05 11:52:01,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74851327] [2025-02-05 11:52:01,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:52:01,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 11:52:01,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:52:01,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 11:52:01,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:52:01,493 INFO L87 Difference]: Start difference. First operand 13854 states and 14984 transitions. Second operand has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:52:06,412 INFO L93 Difference]: Finished difference Result 36040 states and 38971 transitions. [2025-02-05 11:52:06,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 11:52:06,412 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 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 611 [2025-02-05 11:52:06,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:52:06,428 INFO L225 Difference]: With dead ends: 36040 [2025-02-05 11:52:06,428 INFO L226 Difference]: Without dead ends: 16546 [2025-02-05 11:52:06,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1231 GetRequests, 1217 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-02-05 11:52:06,439 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 2891 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 6430 mSolverCounterSat, 610 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2891 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 7040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 610 IncrementalHoareTripleChecker+Valid, 6430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:52:06,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2891 Valid, 271 Invalid, 7040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [610 Valid, 6430 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-02-05 11:52:06,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16546 states. [2025-02-05 11:52:06,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16546 to 12656. [2025-02-05 11:52:06,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12656 states, 12655 states have (on average 1.0378506519162387) internal successors, (13134), 12655 states have internal predecessors, (13134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12656 states to 12656 states and 13134 transitions. [2025-02-05 11:52:06,543 INFO L78 Accepts]: Start accepts. Automaton has 12656 states and 13134 transitions. Word has length 611 [2025-02-05 11:52:06,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:52:06,543 INFO L471 AbstractCegarLoop]: Abstraction has 12656 states and 13134 transitions. [2025-02-05 11:52:06,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 12656 states and 13134 transitions. [2025-02-05 11:52:06,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2025-02-05 11:52:06,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:52:06,549 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:52:06,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 11:52:06,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:52:06,751 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:52:06,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:52:06,751 INFO L85 PathProgramCache]: Analyzing trace with hash -244469250, now seen corresponding path program 1 times [2025-02-05 11:52:06,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:52:06,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389862287] [2025-02-05 11:52:06,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:52:06,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:52:06,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 681 statements into 1 equivalence classes. [2025-02-05 11:52:06,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 681 of 681 statements. [2025-02-05 11:52:06,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:52:06,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:52:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2025-02-05 11:52:07,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:52:07,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389862287] [2025-02-05 11:52:07,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389862287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:52:07,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:52:07,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:52:07,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269596241] [2025-02-05 11:52:07,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:52:07,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:52:07,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:52:07,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:52:07,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:52:07,113 INFO L87 Difference]: Start difference. First operand 12656 states and 13134 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:08,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:52:08,016 INFO L93 Difference]: Finished difference Result 27997 states and 29099 transitions. [2025-02-05 11:52:08,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:52:08,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 681 [2025-02-05 11:52:08,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:52:08,032 INFO L225 Difference]: With dead ends: 27997 [2025-02-05 11:52:08,032 INFO L226 Difference]: Without dead ends: 15343 [2025-02-05 11:52:08,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:52:08,040 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 274 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:52:08,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 192 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:52:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15343 states. [2025-02-05 11:52:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15343 to 14744. [2025-02-05 11:52:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14744 states, 14743 states have (on average 1.033643084853829) internal successors, (15239), 14743 states have internal predecessors, (15239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14744 states to 14744 states and 15239 transitions. [2025-02-05 11:52:08,150 INFO L78 Accepts]: Start accepts. Automaton has 14744 states and 15239 transitions. Word has length 681 [2025-02-05 11:52:08,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:52:08,150 INFO L471 AbstractCegarLoop]: Abstraction has 14744 states and 15239 transitions. [2025-02-05 11:52:08,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:08,150 INFO L276 IsEmpty]: Start isEmpty. Operand 14744 states and 15239 transitions. [2025-02-05 11:52:08,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-02-05 11:52:08,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:52:08,156 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:52:08,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:52:08,156 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:52:08,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:52:08,157 INFO L85 PathProgramCache]: Analyzing trace with hash 291949274, now seen corresponding path program 1 times [2025-02-05 11:52:08,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:52:08,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870901818] [2025-02-05 11:52:08,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:52:08,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:52:08,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-02-05 11:52:08,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-02-05 11:52:08,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:52:08,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:52:08,683 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 605 proven. 190 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 11:52:08,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:52:08,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870901818] [2025-02-05 11:52:08,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870901818] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:52:08,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200751195] [2025-02-05 11:52:08,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:52:08,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:52:08,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:52:08,685 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 11:52:08,688 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 11:52:08,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-02-05 11:52:08,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-02-05 11:52:08,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:52:08,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:52:08,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:52:08,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:52:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2025-02-05 11:52:09,163 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:52:09,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200751195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:52:09,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:52:09,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:52:09,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159911670] [2025-02-05 11:52:09,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:52:09,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:52:09,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:52:09,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:52:09,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:52:09,164 INFO L87 Difference]: Start difference. First operand 14744 states and 15239 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:10,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:52:10,148 INFO L93 Difference]: Finished difference Result 31296 states and 32405 transitions. [2025-02-05 11:52:10,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:52:10,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 688 [2025-02-05 11:52:10,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:52:10,166 INFO L225 Difference]: With dead ends: 31296 [2025-02-05 11:52:10,166 INFO L226 Difference]: Without dead ends: 16554 [2025-02-05 11:52:10,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 687 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:52:10,176 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 295 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:52:10,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 126 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:52:10,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16554 states. [2025-02-05 11:52:10,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16554 to 14444. [2025-02-05 11:52:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14444 states, 14443 states have (on average 1.0335802811050336) internal successors, (14928), 14443 states have internal predecessors, (14928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14444 states to 14444 states and 14928 transitions. [2025-02-05 11:52:10,303 INFO L78 Accepts]: Start accepts. Automaton has 14444 states and 14928 transitions. Word has length 688 [2025-02-05 11:52:10,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:52:10,304 INFO L471 AbstractCegarLoop]: Abstraction has 14444 states and 14928 transitions. [2025-02-05 11:52:10,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 14444 states and 14928 transitions. [2025-02-05 11:52:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2025-02-05 11:52:10,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:52:10,310 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:52:10,317 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 11:52:10,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:52:10,511 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:52:10,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:52:10,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1971209273, now seen corresponding path program 1 times [2025-02-05 11:52:10,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:52:10,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571852988] [2025-02-05 11:52:10,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:52:10,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:52:10,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 714 statements into 1 equivalence classes. [2025-02-05 11:52:10,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 714 of 714 statements. [2025-02-05 11:52:10,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:52:10,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:52:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 268 proven. 375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:52:11,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:52:11,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571852988] [2025-02-05 11:52:11,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571852988] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:52:11,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450621378] [2025-02-05 11:52:11,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:52:11,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:52:11,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:52:11,464 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 11:52:11,465 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 11:52:11,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 714 statements into 1 equivalence classes. [2025-02-05 11:52:11,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 714 of 714 statements. [2025-02-05 11:52:11,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:52:11,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:52:11,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 11:52:11,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:52:13,529 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 536 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:52:13,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:52:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 536 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:52:15,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450621378] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:52:15,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:52:15,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-02-05 11:52:15,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368457732] [2025-02-05 11:52:15,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:52:15,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 11:52:15,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:52:15,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 11:52:15,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-05 11:52:15,060 INFO L87 Difference]: Start difference. First operand 14444 states and 14928 transitions. Second operand has 10 states, 10 states have (on average 139.6) internal successors, (1396), 10 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:19,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:52:19,529 INFO L93 Difference]: Finished difference Result 35575 states and 36801 transitions. [2025-02-05 11:52:19,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-05 11:52:19,530 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 139.6) internal successors, (1396), 10 states have internal predecessors, (1396), 0 states have call successors, (0), 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 714 [2025-02-05 11:52:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:52:19,547 INFO L225 Difference]: With dead ends: 35575 [2025-02-05 11:52:19,547 INFO L226 Difference]: Without dead ends: 21432 [2025-02-05 11:52:19,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1461 GetRequests, 1434 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2025-02-05 11:52:19,557 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 4061 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 6198 mSolverCounterSat, 800 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4061 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 6998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 800 IncrementalHoareTripleChecker+Valid, 6198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:52:19,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4061 Valid, 271 Invalid, 6998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [800 Valid, 6198 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-05 11:52:19,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21432 states. [2025-02-05 11:52:19,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21432 to 15341. [2025-02-05 11:52:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15341 states, 15340 states have (on average 1.0309647979139505) internal successors, (15815), 15340 states have internal predecessors, (15815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15341 states to 15341 states and 15815 transitions. [2025-02-05 11:52:19,718 INFO L78 Accepts]: Start accepts. Automaton has 15341 states and 15815 transitions. Word has length 714 [2025-02-05 11:52:19,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:52:19,718 INFO L471 AbstractCegarLoop]: Abstraction has 15341 states and 15815 transitions. [2025-02-05 11:52:19,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 139.6) internal successors, (1396), 10 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 15341 states and 15815 transitions. [2025-02-05 11:52:19,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2025-02-05 11:52:19,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:52:19,727 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:52:19,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 11:52:19,932 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,SelfDestructingSolverStorable15 [2025-02-05 11:52:19,932 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:52:19,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:52:19,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2045140238, now seen corresponding path program 1 times [2025-02-05 11:52:19,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:52:19,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233839623] [2025-02-05 11:52:19,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:52:19,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:52:19,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 810 statements into 1 equivalence classes. [2025-02-05 11:52:20,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 810 of 810 statements. [2025-02-05 11:52:20,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:52:20,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:52:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 684 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2025-02-05 11:52:20,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:52:20,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233839623] [2025-02-05 11:52:20,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233839623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:52:20,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:52:20,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:52:20,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876894869] [2025-02-05 11:52:20,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:52:20,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:52:20,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:52:20,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:52:20,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:52:20,670 INFO L87 Difference]: Start difference. First operand 15341 states and 15815 transitions. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:21,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:52:21,490 INFO L93 Difference]: Finished difference Result 33964 states and 35079 transitions. [2025-02-05 11:52:21,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:52:21,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 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 810 [2025-02-05 11:52:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:52:21,510 INFO L225 Difference]: With dead ends: 33964 [2025-02-05 11:52:21,510 INFO L226 Difference]: Without dead ends: 18924 [2025-02-05 11:52:21,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:52:21,521 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 35 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:52:21,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 521 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:52:21,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18924 states. [2025-02-05 11:52:21,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18924 to 17130. [2025-02-05 11:52:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17130 states, 17129 states have (on average 1.0263296164399556) internal successors, (17580), 17129 states have internal predecessors, (17580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17130 states to 17130 states and 17580 transitions. [2025-02-05 11:52:21,734 INFO L78 Accepts]: Start accepts. Automaton has 17130 states and 17580 transitions. Word has length 810 [2025-02-05 11:52:21,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:52:21,734 INFO L471 AbstractCegarLoop]: Abstraction has 17130 states and 17580 transitions. [2025-02-05 11:52:21,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 17130 states and 17580 transitions. [2025-02-05 11:52:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 812 [2025-02-05 11:52:21,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:52:21,744 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:52:21,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:52:21,744 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:52:21,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:52:21,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1310925914, now seen corresponding path program 1 times [2025-02-05 11:52:21,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:52:21,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364762014] [2025-02-05 11:52:21,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:52:21,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:52:21,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 811 statements into 1 equivalence classes. [2025-02-05 11:52:21,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 811 of 811 statements. [2025-02-05 11:52:21,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:52:21,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:52:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 631 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-02-05 11:52:22,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:52:22,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364762014] [2025-02-05 11:52:22,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364762014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:52:22,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:52:22,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:52:22,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377267846] [2025-02-05 11:52:22,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:52:22,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:52:22,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:52:22,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:52:22,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:52:22,161 INFO L87 Difference]: Start difference. First operand 17130 states and 17580 transitions. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:52:22,827 INFO L93 Difference]: Finished difference Result 33957 states and 34855 transitions. [2025-02-05 11:52:22,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:52:22,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 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 811 [2025-02-05 11:52:22,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:52:22,844 INFO L225 Difference]: With dead ends: 33957 [2025-02-05 11:52:22,844 INFO L226 Difference]: Without dead ends: 17128 [2025-02-05 11:52:22,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:52:22,850 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 434 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:52:22,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 66 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:52:22,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17128 states. [2025-02-05 11:52:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17128 to 17128. [2025-02-05 11:52:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17128 states, 17127 states have (on average 1.0262159163893267) internal successors, (17576), 17127 states have internal predecessors, (17576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:22,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17128 states to 17128 states and 17576 transitions. [2025-02-05 11:52:22,976 INFO L78 Accepts]: Start accepts. Automaton has 17128 states and 17576 transitions. Word has length 811 [2025-02-05 11:52:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:52:22,980 INFO L471 AbstractCegarLoop]: Abstraction has 17128 states and 17576 transitions. [2025-02-05 11:52:22,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 17128 states and 17576 transitions. [2025-02-05 11:52:22,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 951 [2025-02-05 11:52:22,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:52:22,998 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:52:22,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 11:52:22,998 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:52:23,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:52:23,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1346889509, now seen corresponding path program 1 times [2025-02-05 11:52:23,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:52:23,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452916110] [2025-02-05 11:52:23,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:52:23,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:52:23,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 950 statements into 1 equivalence classes. [2025-02-05 11:52:23,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 950 of 950 statements. [2025-02-05 11:52:23,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:52:23,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:52:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 751 proven. 0 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2025-02-05 11:52:23,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:52:23,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452916110] [2025-02-05 11:52:23,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452916110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:52:23,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:52:23,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:52:23,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300261003] [2025-02-05 11:52:23,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:52:23,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:52:23,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:52:23,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:52:23,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:52:23,464 INFO L87 Difference]: Start difference. First operand 17128 states and 17576 transitions. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:52:24,148 INFO L93 Difference]: Finished difference Result 27329 states and 28047 transitions. [2025-02-05 11:52:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:52:24,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 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 950 [2025-02-05 11:52:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:52:24,158 INFO L225 Difference]: With dead ends: 27329 [2025-02-05 11:52:24,159 INFO L226 Difference]: Without dead ends: 10502 [2025-02-05 11:52:24,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:52:24,168 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 190 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:52:24,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 359 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:52:24,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10502 states. [2025-02-05 11:52:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10502 to 9904. [2025-02-05 11:52:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9904 states, 9903 states have (on average 1.0197919822276078) internal successors, (10099), 9903 states have internal predecessors, (10099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9904 states to 9904 states and 10099 transitions. [2025-02-05 11:52:24,264 INFO L78 Accepts]: Start accepts. Automaton has 9904 states and 10099 transitions. Word has length 950 [2025-02-05 11:52:24,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:52:24,264 INFO L471 AbstractCegarLoop]: Abstraction has 9904 states and 10099 transitions. [2025-02-05 11:52:24,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 9904 states and 10099 transitions. [2025-02-05 11:52:24,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2025-02-05 11:52:24,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:52:24,294 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:52:24,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 11:52:24,294 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:52:24,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:52:24,295 INFO L85 PathProgramCache]: Analyzing trace with hash -522318953, now seen corresponding path program 1 times [2025-02-05 11:52:24,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:52:24,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043173252] [2025-02-05 11:52:24,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:52:24,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:52:24,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 961 statements into 1 equivalence classes. [2025-02-05 11:52:24,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 961 of 961 statements. [2025-02-05 11:52:24,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:52:24,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:52:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 889 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2025-02-05 11:52:24,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:52:24,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043173252] [2025-02-05 11:52:24,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043173252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:52:24,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:52:24,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:52:24,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024498060] [2025-02-05 11:52:24,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:52:24,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:52:24,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:52:24,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:52:24,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:52:24,763 INFO L87 Difference]: Start difference. First operand 9904 states and 10099 transitions. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 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 11:52:25,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:52:25,418 INFO L93 Difference]: Finished difference Result 22501 states and 22965 transitions. [2025-02-05 11:52:25,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:52:25,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 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) Word has length 961 [2025-02-05 11:52:25,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:52:25,430 INFO L225 Difference]: With dead ends: 22501 [2025-02-05 11:52:25,430 INFO L226 Difference]: Without dead ends: 12898 [2025-02-05 11:52:25,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:52:25,436 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 86 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:52:25,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 80 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:52:25,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12898 states. [2025-02-05 11:52:25,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12898 to 11999. [2025-02-05 11:52:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11999 states, 11998 states have (on average 1.0180863477246207) internal successors, (12215), 11998 states have internal predecessors, (12215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:25,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11999 states to 11999 states and 12215 transitions. [2025-02-05 11:52:25,528 INFO L78 Accepts]: Start accepts. Automaton has 11999 states and 12215 transitions. Word has length 961 [2025-02-05 11:52:25,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:52:25,528 INFO L471 AbstractCegarLoop]: Abstraction has 11999 states and 12215 transitions. [2025-02-05 11:52:25,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 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 11:52:25,529 INFO L276 IsEmpty]: Start isEmpty. Operand 11999 states and 12215 transitions. [2025-02-05 11:52:25,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1093 [2025-02-05 11:52:25,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:52:25,538 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:52:25,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 11:52:25,539 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:52:25,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:52:25,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1500788445, now seen corresponding path program 1 times [2025-02-05 11:52:25,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:52:25,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130020900] [2025-02-05 11:52:25,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:52:25,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:52:25,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1092 statements into 1 equivalence classes. [2025-02-05 11:52:25,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1092 of 1092 statements. [2025-02-05 11:52:25,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:52:25,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:52:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 1287 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2025-02-05 11:52:26,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:52:26,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130020900] [2025-02-05 11:52:26,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130020900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:52:26,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:52:26,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:52:26,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680650973] [2025-02-05 11:52:26,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:52:26,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:52:26,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:52:26,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:52:26,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:52:26,465 INFO L87 Difference]: Start difference. First operand 11999 states and 12215 transitions. Second operand has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:52:27,584 INFO L93 Difference]: Finished difference Result 18298 states and 18601 transitions. [2025-02-05 11:52:27,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:52:27,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 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 1092 [2025-02-05 11:52:27,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:52:27,603 INFO L225 Difference]: With dead ends: 18298 [2025-02-05 11:52:27,603 INFO L226 Difference]: Without dead ends: 18296 [2025-02-05 11:52:27,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:52:27,609 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 362 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:52:27,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 87 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:52:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18296 states. [2025-02-05 11:52:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18296 to 12601. [2025-02-05 11:52:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12601 states, 12600 states have (on average 1.017936507936508) internal successors, (12826), 12600 states have internal predecessors, (12826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:27,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12601 states to 12601 states and 12826 transitions. [2025-02-05 11:52:27,779 INFO L78 Accepts]: Start accepts. Automaton has 12601 states and 12826 transitions. Word has length 1092 [2025-02-05 11:52:27,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:52:27,779 INFO L471 AbstractCegarLoop]: Abstraction has 12601 states and 12826 transitions. [2025-02-05 11:52:27,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:27,780 INFO L276 IsEmpty]: Start isEmpty. Operand 12601 states and 12826 transitions. [2025-02-05 11:52:27,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1189 [2025-02-05 11:52:27,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:52:27,802 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:52:27,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 11:52:27,802 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:52:27,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:52:27,803 INFO L85 PathProgramCache]: Analyzing trace with hash -991016022, now seen corresponding path program 1 times [2025-02-05 11:52:27,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:52:27,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089355892] [2025-02-05 11:52:27,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:52:27,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:52:27,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1188 statements into 1 equivalence classes. [2025-02-05 11:52:27,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1188 of 1188 statements. [2025-02-05 11:52:27,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:52:27,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:52:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2236 backedges. 269 proven. 1108 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2025-02-05 11:52:28,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:52:28,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089355892] [2025-02-05 11:52:28,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089355892] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:52:28,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415038621] [2025-02-05 11:52:28,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:52:28,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:52:28,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:52:28,725 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 11:52:28,726 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 11:52:28,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1188 statements into 1 equivalence classes. [2025-02-05 11:52:29,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1188 of 1188 statements. [2025-02-05 11:52:29,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:52:29,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:52:29,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 1345 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:52:29,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:52:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2236 backedges. 1451 proven. 0 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2025-02-05 11:52:29,221 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:52:29,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415038621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:52:29,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:52:29,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:52:29,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223517460] [2025-02-05 11:52:29,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:52:29,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:52:29,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:52:29,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:52:29,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:52:29,223 INFO L87 Difference]: Start difference. First operand 12601 states and 12826 transitions. Second operand has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:52:29,905 INFO L93 Difference]: Finished difference Result 26694 states and 27145 transitions. [2025-02-05 11:52:29,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:52:29,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 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 1188 [2025-02-05 11:52:29,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:52:29,923 INFO L225 Difference]: With dead ends: 26694 [2025-02-05 11:52:29,924 INFO L226 Difference]: Without dead ends: 14394 [2025-02-05 11:52:29,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1191 GetRequests, 1187 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:52:29,935 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 198 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:52:29,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 351 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:52:29,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14394 states. [2025-02-05 11:52:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14394 to 11996. [2025-02-05 11:52:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11996 states, 11995 states have (on average 1.0156731971654855) internal successors, (12183), 11995 states have internal predecessors, (12183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:30,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11996 states to 11996 states and 12183 transitions. [2025-02-05 11:52:30,036 INFO L78 Accepts]: Start accepts. Automaton has 11996 states and 12183 transitions. Word has length 1188 [2025-02-05 11:52:30,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:52:30,036 INFO L471 AbstractCegarLoop]: Abstraction has 11996 states and 12183 transitions. [2025-02-05 11:52:30,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 11996 states and 12183 transitions. [2025-02-05 11:52:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1190 [2025-02-05 11:52:30,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:52:30,048 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:52:30,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 11:52:30,252 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,SelfDestructingSolverStorable21 [2025-02-05 11:52:30,252 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:52:30,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:52:30,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1572373552, now seen corresponding path program 1 times [2025-02-05 11:52:30,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:52:30,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725917841] [2025-02-05 11:52:30,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:52:30,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:52:30,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1189 statements into 1 equivalence classes. [2025-02-05 11:52:30,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1189 of 1189 statements. [2025-02-05 11:52:30,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:52:30,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:52:30,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2090 backedges. 1021 proven. 0 refuted. 0 times theorem prover too weak. 1069 trivial. 0 not checked. [2025-02-05 11:52:30,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:52:30,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725917841] [2025-02-05 11:52:30,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725917841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:52:30,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:52:30,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:52:30,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747127379] [2025-02-05 11:52:30,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:52:30,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:52:30,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:52:30,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:52:30,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:52:30,700 INFO L87 Difference]: Start difference. First operand 11996 states and 12183 transitions. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:52:31,321 INFO L93 Difference]: Finished difference Result 23690 states and 24062 transitions. [2025-02-05 11:52:31,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:52:31,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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 1189 [2025-02-05 11:52:31,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:52:31,333 INFO L225 Difference]: With dead ends: 23690 [2025-02-05 11:52:31,333 INFO L226 Difference]: Without dead ends: 11995 [2025-02-05 11:52:31,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:52:31,341 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 308 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:52:31,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 400 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:52:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11995 states. [2025-02-05 11:52:31,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11995 to 10799. [2025-02-05 11:52:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10799 states, 10798 states have (on average 1.0146323393220966) internal successors, (10956), 10798 states have internal predecessors, (10956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10799 states to 10799 states and 10956 transitions. [2025-02-05 11:52:31,425 INFO L78 Accepts]: Start accepts. Automaton has 10799 states and 10956 transitions. Word has length 1189 [2025-02-05 11:52:31,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:52:31,426 INFO L471 AbstractCegarLoop]: Abstraction has 10799 states and 10956 transitions. [2025-02-05 11:52:31,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:31,426 INFO L276 IsEmpty]: Start isEmpty. Operand 10799 states and 10956 transitions. [2025-02-05 11:52:31,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1217 [2025-02-05 11:52:31,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:52:31,438 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:52:31,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 11:52:31,438 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:52:31,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:52:31,438 INFO L85 PathProgramCache]: Analyzing trace with hash 2125932377, now seen corresponding path program 1 times [2025-02-05 11:52:31,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:52:31,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458838347] [2025-02-05 11:52:31,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:52:31,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:52:31,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1216 statements into 1 equivalence classes. [2025-02-05 11:52:31,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1216 of 1216 statements. [2025-02-05 11:52:31,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:52:31,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:52:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2348 backedges. 1150 proven. 0 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2025-02-05 11:52:32,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:52:32,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458838347] [2025-02-05 11:52:32,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458838347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:52:32,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:52:32,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 11:52:32,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480458141] [2025-02-05 11:52:32,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:52:32,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 11:52:32,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:52:32,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 11:52:32,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:52:32,528 INFO L87 Difference]: Start difference. First operand 10799 states and 10956 transitions. Second operand has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:33,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:52:33,854 INFO L93 Difference]: Finished difference Result 22193 states and 22515 transitions. [2025-02-05 11:52:33,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 11:52:33,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 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 1216 [2025-02-05 11:52:33,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:52:33,856 INFO L225 Difference]: With dead ends: 22193 [2025-02-05 11:52:33,856 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:52:33,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:52:33,863 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 428 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2119 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 2134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:52:33,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 521 Invalid, 2134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2119 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 11:52:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:52:33,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:52:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:52:33,867 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1216 [2025-02-05 11:52:33,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:52:33,867 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:52:33,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:52:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:52:33,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:52:33,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:52:33,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 11:52:33,875 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:52:33,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 11:52:36,837 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 11:52:36,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:52:36 BoogieIcfgContainer [2025-02-05 11:52:36,866 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 11:52:36,867 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 11:52:36,867 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 11:52:36,867 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 11:52:36,870 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:51:35" (3/4) ... [2025-02-05 11:52:36,871 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 11:52:36,897 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-05 11:52:36,899 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 11:52:36,900 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 11:52:36,901 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 11:52:37,025 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 11:52:37,026 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 11:52:37,026 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 11:52:37,026 INFO L158 Benchmark]: Toolchain (without parser) took 64591.50ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 104.8MB in the beginning and 644.6MB in the end (delta: -539.8MB). Peak memory consumption was 929.5MB. Max. memory is 16.1GB. [2025-02-05 11:52:37,026 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 11:52:37,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 690.81ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 94.0MB in the end (delta: 10.7MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2025-02-05 11:52:37,027 INFO L158 Benchmark]: Boogie Procedure Inliner took 150.41ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 57.0MB in the end (delta: 37.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 11:52:37,027 INFO L158 Benchmark]: Boogie Preprocessor took 241.71ms. Allocated memory is still 142.6MB. Free memory was 57.0MB in the beginning and 52.0MB in the end (delta: 5.0MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2025-02-05 11:52:37,027 INFO L158 Benchmark]: IcfgBuilder took 2251.56ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 52.0MB in the beginning and 232.3MB in the end (delta: -180.3MB). Peak memory consumption was 143.7MB. Max. memory is 16.1GB. [2025-02-05 11:52:37,027 INFO L158 Benchmark]: TraceAbstraction took 61090.96ms. Allocated memory was 302.0MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 232.3MB in the beginning and 665.5MB in the end (delta: -433.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-02-05 11:52:37,027 INFO L158 Benchmark]: Witness Printer took 159.11ms. Allocated memory is still 1.6GB. Free memory was 665.5MB in the beginning and 644.6MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 11:52:37,028 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 690.81ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 94.0MB in the end (delta: 10.7MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 150.41ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 57.0MB in the end (delta: 37.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 241.71ms. Allocated memory is still 142.6MB. Free memory was 57.0MB in the beginning and 52.0MB in the end (delta: 5.0MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * IcfgBuilder took 2251.56ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 52.0MB in the beginning and 232.3MB in the end (delta: -180.3MB). Peak memory consumption was 143.7MB. Max. memory is 16.1GB. * TraceAbstraction took 61090.96ms. Allocated memory was 302.0MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 232.3MB in the beginning and 665.5MB in the end (delta: -433.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 159.11ms. Allocated memory is still 1.6GB. Free memory was 665.5MB in the beginning and 644.6MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 185]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.0s, OverallIterations: 24, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 35.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12446 SdHoareTripleChecker+Valid, 32.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12446 mSDsluCounter, 8814 SdHoareTripleChecker+Invalid, 27.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1183 mSDsCounter, 4596 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32947 IncrementalHoareTripleChecker+Invalid, 37543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4596 mSolverCounterUnsat, 7631 mSDtfsCounter, 32947 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5234 GetRequests, 5157 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17130occurred in iteration=17, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 31594 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 18980 NumberOfCodeBlocks, 18980 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 20274 ConstructedInterpolants, 0 QuantifiedInterpolants, 68785 SizeOfPredicates, 11 NumberOfNonLiveVariables, 4488 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 31 InterpolantComputations, 22 PerfectInterpolantSequences, 24288/26612 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((((((((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (3 == a2)) || (((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1)) && (a29 <= 42))) || ((((0 <= ((long long) 97 + a0)) && (2 == a2)) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0))) || (((((long long) 89 + a4) <= 0) && (a29 <= 42)) && (a2 == 4))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a0 + 61) <= 0))) || ((((0 <= ((long long) a29 + 15)) && (((long long) 89 + a4) <= 0)) && (a29 <= 42)) && (5 <= a2))) || (((((long long) 89 + a4) <= 0) && (5 <= a2)) && (((long long) a0 + 61) <= 0))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (a2 == 4))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a29 + 127) == 0))) || ((((0 <= ((long long) a0 + 459337)) && (((long long) 42 + a4) <= 0)) && (((long long) a0 + 147) <= 0)) && (a2 == 1))) || ((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) || ((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (a2 == 1)) && (0 <= ((long long) a0 + 145)))) || ((((0 <= ((long long) a29 + 15)) && (((long long) 89 + a4) <= 0)) && (a29 <= 42)) && (3 == a2))) || (((((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (((long long) 98 + a0) <= 0)) && (a29 <= 42)) && (0 <= ((long long) a0 + 145)))) || (((44 <= a29) && (((long long) 89 + a4) <= 0)) && (3 == a2))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (a29 <= 42))) || (((((((a2 == 1) && (((long long) a0 + 61) <= 0)) || ((0 <= ((long long) a4 + 85)) && (a2 == 1))) && (0 <= ((long long) 97 + a0))) && (((long long) 42 + a4) <= 0)) && (a29 <= 42)) && (0 <= ((long long) a29 + 192415)))) || (((((long long) 98 + a0) <= 0) && (0 <= ((long long) a0 + 145))) && (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (5 <= a2)) && (((long long) a29 + 127) <= 0)) || ((((((long long) 42 + a4) <= 0) && (a29 <= 42)) && (5 <= a2)) && (0 <= ((long long) a29 + 192415)))))) || ((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (a2 == 1))) || (((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (5 <= a2)) && (0 <= ((long long) a0 + 145)))) || ((((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) a0 + 145)))) || ((((((0 <= ((long long) a0 + 459337)) && (((long long) 42 + a4) <= 0)) && (((long long) a0 + 147) <= 0)) && (a29 <= 42)) && (5 <= a2)) && (0 <= ((long long) a29 + 192415)))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0))) || (((44 <= a29) && (((long long) 89 + a4) <= 0)) && (5 <= a2))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (((long long) a0 + 61) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || ((((2 == a2) && (44 <= a29)) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) a0 + 60)))) || (((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (a2 == 4))) || (((((long long) 89 + a4) <= 0) && (3 == a2)) && (((long long) a0 + 61) <= 0))) || ((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (3 == a2)) && (0 <= ((long long) a0 + 145)))) || (((((long long) 89 + a4) <= 0) && (3 == a2)) && (((long long) a29 + 127) <= 0))) || ((((((a2 == 1) && (((long long) a0 + 61) <= 0)) || ((0 <= ((long long) a4 + 85)) && (a2 == 1))) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a29 + 15))) && (a29 <= 42))) RESULT: Ultimate proved your program to be correct! [2025-02-05 11:52:37,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE