./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5bfb987fcec0e4e87ab47a565086b76b03edc9a60525cd8ee77a0c461c0fdaaa --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:56:10,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:56:10,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 22:56:10,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:56:10,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:56:10,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:56:10,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:56:10,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:56:10,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:56:10,503 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:56:10,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:56:10,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:56:10,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:56:10,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:56:10,503 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:56:10,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:56:10,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:56:10,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:56:10,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:56:10,504 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:56:10,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:56:10,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:56:10,504 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:56:10,504 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:56:10,504 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:56:10,504 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:56:10,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:56:10,505 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:56:10,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:56:10,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:56:10,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:56:10,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:56:10,505 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:56:10,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:56:10,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:56:10,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:56:10,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:56:10,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:56:10,505 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:56:10,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:56:10,506 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bfb987fcec0e4e87ab47a565086b76b03edc9a60525cd8ee77a0c461c0fdaaa [2025-02-07 22:56:10,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:56:10,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:56:10,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:56:10,712 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:56:10,712 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:56:10,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c [2025-02-07 22:56:11,973 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d1700190/b44746a52a5842a39e17ee0f857d8e18/FLAG41cefe2fc [2025-02-07 22:56:12,257 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:56:12,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c [2025-02-07 22:56:12,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d1700190/b44746a52a5842a39e17ee0f857d8e18/FLAG41cefe2fc [2025-02-07 22:56:12,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d1700190/b44746a52a5842a39e17ee0f857d8e18 [2025-02-07 22:56:12,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:56:12,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:56:12,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:56:12,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:56:12,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:56:12,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:56:12" (1/1) ... [2025-02-07 22:56:12,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@267df75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:12, skipping insertion in model container [2025-02-07 22:56:12,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:56:12" (1/1) ... [2025-02-07 22:56:12,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:56:12,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c[1279,1292] [2025-02-07 22:56:12,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:56:12,851 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:56:12,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c[1279,1292] [2025-02-07 22:56:12,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:56:12,976 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:56:12,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:12 WrapperNode [2025-02-07 22:56:12,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:56:12,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:56:12,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:56:12,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:56:12,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:12" (1/1) ... [2025-02-07 22:56:13,003 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:12" (1/1) ... [2025-02-07 22:56:13,097 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1382 [2025-02-07 22:56:13,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:56:13,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:56:13,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:56:13,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:56:13,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:12" (1/1) ... [2025-02-07 22:56:13,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:12" (1/1) ... [2025-02-07 22:56:13,125 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:12" (1/1) ... [2025-02-07 22:56:13,175 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-07 22:56:13,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:12" (1/1) ... [2025-02-07 22:56:13,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:12" (1/1) ... [2025-02-07 22:56:13,206 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:12" (1/1) ... [2025-02-07 22:56:13,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:12" (1/1) ... [2025-02-07 22:56:13,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:12" (1/1) ... [2025-02-07 22:56:13,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:12" (1/1) ... [2025-02-07 22:56:13,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:56:13,262 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:56:13,262 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:56:13,263 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:56:13,264 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:12" (1/1) ... [2025-02-07 22:56:13,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:56:13,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:56:13,321 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-07 22:56:13,325 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-07 22:56:13,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:56:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 22:56:13,338 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 22:56:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:56:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:56:13,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:56:13,460 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:56:13,461 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:56:14,602 INFO L? ?]: Removed 752 outVars from TransFormulas that were not future-live. [2025-02-07 22:56:14,602 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:56:14,680 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:56:14,681 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:56:14,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:56:14 BoogieIcfgContainer [2025-02-07 22:56:14,681 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:56:14,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:56:14,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:56:14,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:56:14,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:56:12" (1/3) ... [2025-02-07 22:56:14,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a3cfdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:56:14, skipping insertion in model container [2025-02-07 22:56:14,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:12" (2/3) ... [2025-02-07 22:56:14,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a3cfdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:56:14, skipping insertion in model container [2025-02-07 22:56:14,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:56:14" (3/3) ... [2025-02-07 22:56:14,688 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c [2025-02-07 22:56:14,699 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:56:14,700 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c that has 2 procedures, 390 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:56:14,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:56:14,775 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;@7468f186, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:56:14,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:56:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 390 states, 384 states have (on average 1.4947916666666667) internal successors, (574), 385 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:14,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-07 22:56:14,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:14,788 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:14,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:14,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:14,793 INFO L85 PathProgramCache]: Analyzing trace with hash 329665021, now seen corresponding path program 1 times [2025-02-07 22:56:14,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:14,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215460122] [2025-02-07 22:56:14,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:14,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:14,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-07 22:56:14,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-07 22:56:14,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:14,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 22:56:15,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:15,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215460122] [2025-02-07 22:56:15,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215460122] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:56:15,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257017549] [2025-02-07 22:56:15,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:15,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:56:15,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:56:15,100 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-07 22:56:15,113 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-07 22:56:15,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-07 22:56:15,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-07 22:56:15,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:15,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:15,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 22:56:15,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:56:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 22:56:15,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:56:15,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257017549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:15,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:56:15,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-07 22:56:15,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84456722] [2025-02-07 22:56:15,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:15,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 22:56:15,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:15,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 22:56:15,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 22:56:15,424 INFO L87 Difference]: Start difference. First operand has 390 states, 384 states have (on average 1.4947916666666667) internal successors, (574), 385 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:15,544 INFO L93 Difference]: Finished difference Result 709 states and 1059 transitions. [2025-02-07 22:56:15,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 22:56:15,545 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 116 [2025-02-07 22:56:15,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:15,551 INFO L225 Difference]: With dead ends: 709 [2025-02-07 22:56:15,551 INFO L226 Difference]: Without dead ends: 388 [2025-02-07 22:56:15,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 22:56:15,555 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:15,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:56:15,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-07 22:56:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2025-02-07 22:56:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 383 states have (on average 1.4882506527415145) internal successors, (570), 383 states have internal predecessors, (570), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:15,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 576 transitions. [2025-02-07 22:56:15,589 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 576 transitions. Word has length 116 [2025-02-07 22:56:15,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:15,589 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 576 transitions. [2025-02-07 22:56:15,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 576 transitions. [2025-02-07 22:56:15,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-07 22:56:15,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:15,593 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:15,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 22:56:15,793 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,SelfDestructingSolverStorable0 [2025-02-07 22:56:15,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:15,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:15,794 INFO L85 PathProgramCache]: Analyzing trace with hash -598367334, now seen corresponding path program 1 times [2025-02-07 22:56:15,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:15,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976472759] [2025-02-07 22:56:15,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:15,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:15,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-07 22:56:15,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-07 22:56:15,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:15,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:16,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:16,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:16,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976472759] [2025-02-07 22:56:16,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976472759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:16,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:16,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:56:16,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072158692] [2025-02-07 22:56:16,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:16,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:56:16,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:16,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:56:16,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:16,429 INFO L87 Difference]: Start difference. First operand 388 states and 576 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:16,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:16,593 INFO L93 Difference]: Finished difference Result 392 states and 580 transitions. [2025-02-07 22:56:16,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:16,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 116 [2025-02-07 22:56:16,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:16,595 INFO L225 Difference]: With dead ends: 392 [2025-02-07 22:56:16,595 INFO L226 Difference]: Without dead ends: 390 [2025-02-07 22:56:16,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:16,596 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 0 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:16,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:56:16,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-02-07 22:56:16,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-02-07 22:56:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.4857142857142858) internal successors, (572), 385 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 578 transitions. [2025-02-07 22:56:16,606 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 578 transitions. Word has length 116 [2025-02-07 22:56:16,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:16,607 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 578 transitions. [2025-02-07 22:56:16,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:16,607 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 578 transitions. [2025-02-07 22:56:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-07 22:56:16,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:16,609 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:16,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 22:56:16,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:16,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:16,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1364838705, now seen corresponding path program 1 times [2025-02-07 22:56:16,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:16,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102591244] [2025-02-07 22:56:16,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:16,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:16,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-07 22:56:16,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-07 22:56:16,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:16,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:16,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:16,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102591244] [2025-02-07 22:56:16,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102591244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:16,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:16,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:16,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443654287] [2025-02-07 22:56:16,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:16,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:16,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:16,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:16,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:16,970 INFO L87 Difference]: Start difference. First operand 390 states and 578 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:17,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:17,405 INFO L93 Difference]: Finished difference Result 970 states and 1440 transitions. [2025-02-07 22:56:17,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:56:17,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 117 [2025-02-07 22:56:17,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:17,407 INFO L225 Difference]: With dead ends: 970 [2025-02-07 22:56:17,407 INFO L226 Difference]: Without dead ends: 390 [2025-02-07 22:56:17,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:56:17,409 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 1090 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:17,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1412 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:56:17,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-02-07 22:56:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-02-07 22:56:17,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.483116883116883) internal successors, (571), 385 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 577 transitions. [2025-02-07 22:56:17,418 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 577 transitions. Word has length 117 [2025-02-07 22:56:17,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:17,418 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 577 transitions. [2025-02-07 22:56:17,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:17,419 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 577 transitions. [2025-02-07 22:56:17,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-07 22:56:17,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:17,421 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:17,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:56:17,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:17,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:17,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1499737672, now seen corresponding path program 1 times [2025-02-07 22:56:17,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:17,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998127202] [2025-02-07 22:56:17,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:17,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:17,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-07 22:56:17,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-07 22:56:17,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:17,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:17,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:17,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998127202] [2025-02-07 22:56:17,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998127202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:17,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:17,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:56:17,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279865123] [2025-02-07 22:56:17,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:17,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:56:17,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:17,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:56:17,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:17,683 INFO L87 Difference]: Start difference. First operand 390 states and 577 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:17,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:17,831 INFO L93 Difference]: Finished difference Result 713 states and 1054 transitions. [2025-02-07 22:56:17,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:17,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 118 [2025-02-07 22:56:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:17,833 INFO L225 Difference]: With dead ends: 713 [2025-02-07 22:56:17,833 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:56:17,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:17,834 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 0 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:17,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1432 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:56:17,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:56:17,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:56:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4806201550387597) internal successors, (573), 387 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:17,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 579 transitions. [2025-02-07 22:56:17,841 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 579 transitions. Word has length 118 [2025-02-07 22:56:17,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:17,842 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 579 transitions. [2025-02-07 22:56:17,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:17,842 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 579 transitions. [2025-02-07 22:56:17,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-07 22:56:17,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:17,844 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:17,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 22:56:17,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:17,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:17,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1178737116, now seen corresponding path program 1 times [2025-02-07 22:56:17,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:17,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594922783] [2025-02-07 22:56:17,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:17,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:17,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-07 22:56:17,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-07 22:56:17,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:17,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:18,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:18,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594922783] [2025-02-07 22:56:18,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594922783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:18,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:18,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:56:18,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145210509] [2025-02-07 22:56:18,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:18,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:56:18,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:18,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:56:18,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:18,162 INFO L87 Difference]: Start difference. First operand 392 states and 579 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:18,319 INFO L93 Difference]: Finished difference Result 715 states and 1055 transitions. [2025-02-07 22:56:18,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:18,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 119 [2025-02-07 22:56:18,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:18,321 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:56:18,321 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:56:18,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:18,323 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 487 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:18,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 929 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:56:18,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:56:18,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:56:18,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.475452196382429) internal successors, (571), 387 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 577 transitions. [2025-02-07 22:56:18,331 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 577 transitions. Word has length 119 [2025-02-07 22:56:18,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:18,331 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 577 transitions. [2025-02-07 22:56:18,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:18,331 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 577 transitions. [2025-02-07 22:56:18,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-07 22:56:18,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:18,333 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:18,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 22:56:18,334 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:18,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:18,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1756688063, now seen corresponding path program 1 times [2025-02-07 22:56:18,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:18,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802671399] [2025-02-07 22:56:18,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:18,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:18,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-07 22:56:18,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-07 22:56:18,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:18,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:18,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:18,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802671399] [2025-02-07 22:56:18,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802671399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:18,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:18,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:18,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547842219] [2025-02-07 22:56:18,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:18,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:18,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:18,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:18,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:18,612 INFO L87 Difference]: Start difference. First operand 392 states and 577 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:18,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:18,768 INFO L93 Difference]: Finished difference Result 715 states and 1051 transitions. [2025-02-07 22:56:18,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:18,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 121 [2025-02-07 22:56:18,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:18,770 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:56:18,770 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:56:18,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-07 22:56:18,771 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 1041 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:18,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 929 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:56:18,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:56:18,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:56:18,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4728682170542635) internal successors, (570), 387 states have internal predecessors, (570), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 576 transitions. [2025-02-07 22:56:18,778 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 576 transitions. Word has length 121 [2025-02-07 22:56:18,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:18,778 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 576 transitions. [2025-02-07 22:56:18,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 576 transitions. [2025-02-07 22:56:18,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-07 22:56:18,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:18,779 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:18,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 22:56:18,779 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:18,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:18,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1781573896, now seen corresponding path program 1 times [2025-02-07 22:56:18,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:18,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674897017] [2025-02-07 22:56:18,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:18,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:18,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-07 22:56:18,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-07 22:56:18,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:18,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:19,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:19,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674897017] [2025-02-07 22:56:19,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674897017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:19,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:19,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:56:19,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028832126] [2025-02-07 22:56:19,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:19,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:56:19,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:19,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:56:19,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:19,162 INFO L87 Difference]: Start difference. First operand 392 states and 576 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:19,431 INFO L93 Difference]: Finished difference Result 715 states and 1049 transitions. [2025-02-07 22:56:19,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:19,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122 [2025-02-07 22:56:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:19,433 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:56:19,434 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:56:19,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:19,435 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 474 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:19,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 891 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:19,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:56:19,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:56:19,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4702842377260983) internal successors, (569), 387 states have internal predecessors, (569), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 575 transitions. [2025-02-07 22:56:19,452 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 575 transitions. Word has length 122 [2025-02-07 22:56:19,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:19,452 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 575 transitions. [2025-02-07 22:56:19,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:19,452 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 575 transitions. [2025-02-07 22:56:19,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-07 22:56:19,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:19,453 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:19,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 22:56:19,453 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:19,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:19,454 INFO L85 PathProgramCache]: Analyzing trace with hash -548863952, now seen corresponding path program 1 times [2025-02-07 22:56:19,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:19,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827074633] [2025-02-07 22:56:19,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:19,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:19,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-07 22:56:19,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-07 22:56:19,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:19,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:19,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:19,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827074633] [2025-02-07 22:56:19,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827074633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:19,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:19,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:19,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75916278] [2025-02-07 22:56:19,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:19,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:19,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:19,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:19,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:19,666 INFO L87 Difference]: Start difference. First operand 392 states and 575 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:19,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:19,885 INFO L93 Difference]: Finished difference Result 719 states and 1052 transitions. [2025-02-07 22:56:19,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:56:19,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 123 [2025-02-07 22:56:19,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:19,887 INFO L225 Difference]: With dead ends: 719 [2025-02-07 22:56:19,887 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:56:19,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:56:19,888 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 481 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:19,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1390 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:19,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:56:19,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:56:19,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4677002583979328) internal successors, (568), 387 states have internal predecessors, (568), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 574 transitions. [2025-02-07 22:56:19,905 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 574 transitions. Word has length 123 [2025-02-07 22:56:19,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:19,905 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 574 transitions. [2025-02-07 22:56:19,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 574 transitions. [2025-02-07 22:56:19,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-07 22:56:19,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:19,906 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:19,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 22:56:19,906 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:19,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:19,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1986497086, now seen corresponding path program 1 times [2025-02-07 22:56:19,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:19,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424819726] [2025-02-07 22:56:19,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:19,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:19,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-07 22:56:19,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-07 22:56:19,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:19,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:20,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:20,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424819726] [2025-02-07 22:56:20,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424819726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:20,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:20,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:20,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633399079] [2025-02-07 22:56:20,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:20,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:20,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:20,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:20,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:20,147 INFO L87 Difference]: Start difference. First operand 392 states and 574 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:20,331 INFO L93 Difference]: Finished difference Result 715 states and 1045 transitions. [2025-02-07 22:56:20,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:20,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 124 [2025-02-07 22:56:20,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:20,332 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:56:20,333 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:56:20,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-07 22:56:20,334 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 1030 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:20,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 891 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:56:20,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:56:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4651162790697674) internal successors, (567), 387 states have internal predecessors, (567), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 573 transitions. [2025-02-07 22:56:20,343 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 573 transitions. Word has length 124 [2025-02-07 22:56:20,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:20,344 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 573 transitions. [2025-02-07 22:56:20,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:20,344 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 573 transitions. [2025-02-07 22:56:20,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-07 22:56:20,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:20,345 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:20,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 22:56:20,345 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:20,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:20,345 INFO L85 PathProgramCache]: Analyzing trace with hash -279691979, now seen corresponding path program 1 times [2025-02-07 22:56:20,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:20,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947424245] [2025-02-07 22:56:20,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:20,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:20,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-07 22:56:20,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-07 22:56:20,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:20,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:20,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:20,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947424245] [2025-02-07 22:56:20,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947424245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:20,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:20,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:20,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089007474] [2025-02-07 22:56:20,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:20,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:20,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:20,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:20,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:20,548 INFO L87 Difference]: Start difference. First operand 392 states and 573 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:20,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:20,734 INFO L93 Difference]: Finished difference Result 715 states and 1043 transitions. [2025-02-07 22:56:20,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:20,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 125 [2025-02-07 22:56:20,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:20,737 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:56:20,737 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:56:20,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-07 22:56:20,738 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 552 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:20,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 897 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:56:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:56:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4625322997416021) internal successors, (566), 387 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 572 transitions. [2025-02-07 22:56:20,745 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 572 transitions. Word has length 125 [2025-02-07 22:56:20,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:20,746 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 572 transitions. [2025-02-07 22:56:20,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:20,746 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 572 transitions. [2025-02-07 22:56:20,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-07 22:56:20,747 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:20,747 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:20,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 22:56:20,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:20,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:20,747 INFO L85 PathProgramCache]: Analyzing trace with hash 807747390, now seen corresponding path program 1 times [2025-02-07 22:56:20,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:20,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019897303] [2025-02-07 22:56:20,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:20,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:20,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-07 22:56:20,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-07 22:56:20,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:20,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:21,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:21,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019897303] [2025-02-07 22:56:21,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019897303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:21,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:21,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:56:21,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959128680] [2025-02-07 22:56:21,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:21,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:56:21,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:21,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:56:21,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:21,017 INFO L87 Difference]: Start difference. First operand 392 states and 572 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:21,182 INFO L93 Difference]: Finished difference Result 715 states and 1041 transitions. [2025-02-07 22:56:21,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:21,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 126 [2025-02-07 22:56:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:21,184 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:56:21,184 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:56:21,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:21,185 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 518 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:21,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 925 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:56:21,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:56:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:56:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4599483204134367) internal successors, (565), 387 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 571 transitions. [2025-02-07 22:56:21,192 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 571 transitions. Word has length 126 [2025-02-07 22:56:21,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:21,192 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 571 transitions. [2025-02-07 22:56:21,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 571 transitions. [2025-02-07 22:56:21,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-07 22:56:21,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:21,193 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:21,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 22:56:21,194 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:21,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:21,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1719590931, now seen corresponding path program 1 times [2025-02-07 22:56:21,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:21,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46395674] [2025-02-07 22:56:21,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:21,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:21,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-07 22:56:21,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-07 22:56:21,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:21,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:21,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:21,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46395674] [2025-02-07 22:56:21,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46395674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:21,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:21,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:56:21,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075714766] [2025-02-07 22:56:21,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:21,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:56:21,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:21,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:56:21,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:21,442 INFO L87 Difference]: Start difference. First operand 392 states and 571 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:21,609 INFO L93 Difference]: Finished difference Result 715 states and 1039 transitions. [2025-02-07 22:56:21,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:21,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 127 [2025-02-07 22:56:21,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:21,611 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:56:21,611 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:56:21,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:21,612 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 516 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:21,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 925 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:56:21,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:56:21,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:56:21,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4573643410852712) internal successors, (564), 387 states have internal predecessors, (564), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:21,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 570 transitions. [2025-02-07 22:56:21,620 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 570 transitions. Word has length 127 [2025-02-07 22:56:21,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:21,620 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 570 transitions. [2025-02-07 22:56:21,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:21,621 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 570 transitions. [2025-02-07 22:56:21,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-07 22:56:21,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:21,622 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:21,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 22:56:21,622 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:21,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:21,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1660999615, now seen corresponding path program 1 times [2025-02-07 22:56:21,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:21,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926053546] [2025-02-07 22:56:21,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:21,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:21,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-07 22:56:21,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-07 22:56:21,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:21,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:21,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:21,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926053546] [2025-02-07 22:56:21,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926053546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:21,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:21,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:56:21,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155629596] [2025-02-07 22:56:21,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:21,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:56:21,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:21,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:56:21,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:21,967 INFO L87 Difference]: Start difference. First operand 392 states and 570 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:22,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:22,214 INFO L93 Difference]: Finished difference Result 717 states and 1039 transitions. [2025-02-07 22:56:22,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:22,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 128 [2025-02-07 22:56:22,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:22,216 INFO L225 Difference]: With dead ends: 717 [2025-02-07 22:56:22,216 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:56:22,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:22,217 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 2 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:22,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1286 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:56:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:56:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.454780361757106) internal successors, (563), 387 states have internal predecessors, (563), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:22,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 569 transitions. [2025-02-07 22:56:22,225 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 569 transitions. Word has length 128 [2025-02-07 22:56:22,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:22,225 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 569 transitions. [2025-02-07 22:56:22,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:22,225 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 569 transitions. [2025-02-07 22:56:22,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-07 22:56:22,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:22,226 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:22,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 22:56:22,227 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:22,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:22,227 INFO L85 PathProgramCache]: Analyzing trace with hash 972662121, now seen corresponding path program 1 times [2025-02-07 22:56:22,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:22,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506108298] [2025-02-07 22:56:22,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:22,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:22,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-07 22:56:22,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-07 22:56:22,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:22,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:22,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:22,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506108298] [2025-02-07 22:56:22,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506108298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:22,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:22,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:22,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518591943] [2025-02-07 22:56:22,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:22,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:22,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:22,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:22,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:22,531 INFO L87 Difference]: Start difference. First operand 392 states and 569 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:22,728 INFO L93 Difference]: Finished difference Result 715 states and 1035 transitions. [2025-02-07 22:56:22,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:22,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 129 [2025-02-07 22:56:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:22,730 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:56:22,730 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:56:22,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:22,731 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 469 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:22,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 885 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:22,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:56:22,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:56:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4521963824289406) internal successors, (562), 387 states have internal predecessors, (562), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 568 transitions. [2025-02-07 22:56:22,738 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 568 transitions. Word has length 129 [2025-02-07 22:56:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:22,738 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 568 transitions. [2025-02-07 22:56:22,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:22,738 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 568 transitions. [2025-02-07 22:56:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-07 22:56:22,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:22,739 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:22,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 22:56:22,739 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:22,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:22,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1038141905, now seen corresponding path program 1 times [2025-02-07 22:56:22,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:22,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145396743] [2025-02-07 22:56:22,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:22,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:22,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-07 22:56:22,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-07 22:56:22,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:22,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:23,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:23,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145396743] [2025-02-07 22:56:23,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145396743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:23,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:23,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:23,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846963909] [2025-02-07 22:56:23,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:23,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:23,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:23,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:23,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:23,231 INFO L87 Difference]: Start difference. First operand 392 states and 568 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:23,493 INFO L93 Difference]: Finished difference Result 715 states and 1033 transitions. [2025-02-07 22:56:23,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:23,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 130 [2025-02-07 22:56:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:23,495 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:56:23,495 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:56:23,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:23,496 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 926 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:23,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 885 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:56:23,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:56:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.449612403100775) internal successors, (561), 387 states have internal predecessors, (561), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 567 transitions. [2025-02-07 22:56:23,504 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 567 transitions. Word has length 130 [2025-02-07 22:56:23,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:23,504 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 567 transitions. [2025-02-07 22:56:23,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:23,504 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 567 transitions. [2025-02-07 22:56:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-07 22:56:23,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:23,505 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:23,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 22:56:23,505 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:23,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:23,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1829828771, now seen corresponding path program 1 times [2025-02-07 22:56:23,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:23,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382658733] [2025-02-07 22:56:23,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:23,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:23,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-07 22:56:23,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-07 22:56:23,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:23,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:23,805 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:23,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:23,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382658733] [2025-02-07 22:56:23,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382658733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:23,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:23,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:23,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982431023] [2025-02-07 22:56:23,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:23,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:23,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:23,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:23,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:23,808 INFO L87 Difference]: Start difference. First operand 392 states and 567 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:24,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:24,021 INFO L93 Difference]: Finished difference Result 715 states and 1031 transitions. [2025-02-07 22:56:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:24,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 131 [2025-02-07 22:56:24,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:24,023 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:56:24,023 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:56:24,024 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-07 22:56:24,024 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 464 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:24,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 891 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:56:24,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:56:24,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4470284237726099) internal successors, (560), 387 states have internal predecessors, (560), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 566 transitions. [2025-02-07 22:56:24,034 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 566 transitions. Word has length 131 [2025-02-07 22:56:24,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:24,034 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 566 transitions. [2025-02-07 22:56:24,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:24,034 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 566 transitions. [2025-02-07 22:56:24,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-07 22:56:24,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:24,036 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:24,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 22:56:24,036 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:24,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:24,037 INFO L85 PathProgramCache]: Analyzing trace with hash 801528005, now seen corresponding path program 1 times [2025-02-07 22:56:24,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:24,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619089096] [2025-02-07 22:56:24,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:24,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:24,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-07 22:56:24,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-07 22:56:24,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:24,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:24,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:24,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619089096] [2025-02-07 22:56:24,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619089096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:24,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:24,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:24,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629653887] [2025-02-07 22:56:24,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:24,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:24,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:24,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:24,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:24,479 INFO L87 Difference]: Start difference. First operand 392 states and 566 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:24,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:24,693 INFO L93 Difference]: Finished difference Result 759 states and 1083 transitions. [2025-02-07 22:56:24,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:56:24,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 132 [2025-02-07 22:56:24,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:24,695 INFO L225 Difference]: With dead ends: 759 [2025-02-07 22:56:24,695 INFO L226 Difference]: Without dead ends: 436 [2025-02-07 22:56:24,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:24,696 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 18 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:24,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1848 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-02-07 22:56:24,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2025-02-07 22:56:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 429 states have (on average 1.421911421911422) internal successors, (610), 429 states have internal predecessors, (610), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:24,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 616 transitions. [2025-02-07 22:56:24,707 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 616 transitions. Word has length 132 [2025-02-07 22:56:24,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:24,707 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 616 transitions. [2025-02-07 22:56:24,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:24,708 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 616 transitions. [2025-02-07 22:56:24,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-07 22:56:24,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:24,708 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:24,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 22:56:24,709 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:24,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:24,709 INFO L85 PathProgramCache]: Analyzing trace with hash 965927204, now seen corresponding path program 1 times [2025-02-07 22:56:24,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:24,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370163598] [2025-02-07 22:56:24,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:24,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:24,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-07 22:56:24,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-07 22:56:24,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:24,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:25,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:25,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370163598] [2025-02-07 22:56:25,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370163598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:25,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:25,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:56:25,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368301827] [2025-02-07 22:56:25,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:25,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:56:25,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:25,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:56:25,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:25,148 INFO L87 Difference]: Start difference. First operand 434 states and 616 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:25,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:25,426 INFO L93 Difference]: Finished difference Result 961 states and 1345 transitions. [2025-02-07 22:56:25,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:56:25,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 133 [2025-02-07 22:56:25,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:25,429 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:56:25,429 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:56:25,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:56:25,430 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 831 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 1816 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:25,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 1816 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:25,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:56:25,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:56:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3928571428571428) internal successors, (819), 588 states have internal predecessors, (819), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:56:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 831 transitions. [2025-02-07 22:56:25,447 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 831 transitions. Word has length 133 [2025-02-07 22:56:25,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:25,447 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 831 transitions. [2025-02-07 22:56:25,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 831 transitions. [2025-02-07 22:56:25,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-02-07 22:56:25,449 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:25,450 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:25,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 22:56:25,450 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:25,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:25,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1802322026, now seen corresponding path program 1 times [2025-02-07 22:56:25,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:25,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648725260] [2025-02-07 22:56:25,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:25,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:25,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-02-07 22:56:25,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-02-07 22:56:25,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:25,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:25,977 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:25,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:25,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648725260] [2025-02-07 22:56:25,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648725260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:25,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:25,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:25,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782803125] [2025-02-07 22:56:25,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:25,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:25,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:25,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:25,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:25,979 INFO L87 Difference]: Start difference. First operand 596 states and 831 transitions. Second operand has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:26,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:26,165 INFO L93 Difference]: Finished difference Result 961 states and 1344 transitions. [2025-02-07 22:56:26,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:26,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 321 [2025-02-07 22:56:26,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:26,168 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:56:26,169 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:56:26,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-07 22:56:26,170 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 514 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:26,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 891 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:26,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:56:26,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:56:26,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3911564625850341) internal successors, (818), 588 states have internal predecessors, (818), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:56:26,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 830 transitions. [2025-02-07 22:56:26,183 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 830 transitions. Word has length 321 [2025-02-07 22:56:26,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:26,184 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 830 transitions. [2025-02-07 22:56:26,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:26,184 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 830 transitions. [2025-02-07 22:56:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-02-07 22:56:26,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:26,188 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:26,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 22:56:26,188 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:26,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:26,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1404820520, now seen corresponding path program 1 times [2025-02-07 22:56:26,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:26,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337317248] [2025-02-07 22:56:26,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:26,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:26,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-02-07 22:56:26,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-02-07 22:56:26,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:26,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:26,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:26,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337317248] [2025-02-07 22:56:26,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337317248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:26,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:26,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:26,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054635751] [2025-02-07 22:56:26,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:26,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:26,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:26,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:26,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:26,621 INFO L87 Difference]: Start difference. First operand 596 states and 830 transitions. Second operand has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:26,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:26,795 INFO L93 Difference]: Finished difference Result 961 states and 1342 transitions. [2025-02-07 22:56:26,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:26,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 322 [2025-02-07 22:56:26,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:26,797 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:56:26,797 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:56:26,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-07 22:56:26,798 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 921 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:26,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 885 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:26,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:56:26,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:56:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3894557823129252) internal successors, (817), 588 states have internal predecessors, (817), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:56:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 829 transitions. [2025-02-07 22:56:26,811 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 829 transitions. Word has length 322 [2025-02-07 22:56:26,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:26,811 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 829 transitions. [2025-02-07 22:56:26,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:26,811 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 829 transitions. [2025-02-07 22:56:26,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-02-07 22:56:26,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:26,814 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:26,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 22:56:26,814 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:26,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:26,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2031266073, now seen corresponding path program 1 times [2025-02-07 22:56:26,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:26,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777690237] [2025-02-07 22:56:26,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:26,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:26,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-02-07 22:56:26,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-02-07 22:56:26,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:26,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:27,242 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:27,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:27,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777690237] [2025-02-07 22:56:27,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777690237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:27,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:27,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:27,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858828486] [2025-02-07 22:56:27,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:27,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:27,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:27,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:27,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:27,244 INFO L87 Difference]: Start difference. First operand 596 states and 829 transitions. Second operand has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:27,420 INFO L93 Difference]: Finished difference Result 961 states and 1340 transitions. [2025-02-07 22:56:27,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:27,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 323 [2025-02-07 22:56:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:27,423 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:56:27,423 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:56:27,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-07 22:56:27,424 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 905 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:27,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 885 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:27,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:56:27,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:56:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3877551020408163) internal successors, (816), 588 states have internal predecessors, (816), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:56:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 828 transitions. [2025-02-07 22:56:27,438 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 828 transitions. Word has length 323 [2025-02-07 22:56:27,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:27,438 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 828 transitions. [2025-02-07 22:56:27,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 828 transitions. [2025-02-07 22:56:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-02-07 22:56:27,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:27,441 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:27,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 22:56:27,441 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:27,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:27,441 INFO L85 PathProgramCache]: Analyzing trace with hash 701209049, now seen corresponding path program 1 times [2025-02-07 22:56:27,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:27,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759221043] [2025-02-07 22:56:27,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:27,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:27,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-02-07 22:56:27,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-02-07 22:56:27,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:27,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:27,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:27,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759221043] [2025-02-07 22:56:27,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759221043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:27,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:27,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:27,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941414485] [2025-02-07 22:56:27,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:27,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:27,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:27,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:27,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:27,845 INFO L87 Difference]: Start difference. First operand 596 states and 828 transitions. Second operand has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:28,058 INFO L93 Difference]: Finished difference Result 961 states and 1338 transitions. [2025-02-07 22:56:28,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:28,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 324 [2025-02-07 22:56:28,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:28,061 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:56:28,061 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:56:28,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-07 22:56:28,064 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 889 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:28,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 885 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:56:28,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:56:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3860544217687074) internal successors, (815), 588 states have internal predecessors, (815), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:56:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 827 transitions. [2025-02-07 22:56:28,076 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 827 transitions. Word has length 324 [2025-02-07 22:56:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:28,077 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 827 transitions. [2025-02-07 22:56:28,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 827 transitions. [2025-02-07 22:56:28,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-07 22:56:28,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:28,080 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:28,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 22:56:28,080 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:28,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:28,081 INFO L85 PathProgramCache]: Analyzing trace with hash -989393992, now seen corresponding path program 1 times [2025-02-07 22:56:28,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:28,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902745113] [2025-02-07 22:56:28,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:28,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:28,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-07 22:56:28,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-07 22:56:28,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:28,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:28,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:28,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902745113] [2025-02-07 22:56:28,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902745113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:28,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:28,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:28,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568014978] [2025-02-07 22:56:28,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:28,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:28,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:28,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:28,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:28,482 INFO L87 Difference]: Start difference. First operand 596 states and 827 transitions. Second operand has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:28,639 INFO L93 Difference]: Finished difference Result 961 states and 1336 transitions. [2025-02-07 22:56:28,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:28,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 325 [2025-02-07 22:56:28,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:28,641 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:56:28,641 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:56:28,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-07 22:56:28,642 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 866 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:28,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 901 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:56:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:56:28,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:56:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3843537414965987) internal successors, (814), 588 states have internal predecessors, (814), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:56:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 826 transitions. [2025-02-07 22:56:28,657 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 826 transitions. Word has length 325 [2025-02-07 22:56:28,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:28,657 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 826 transitions. [2025-02-07 22:56:28,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 826 transitions. [2025-02-07 22:56:28,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-02-07 22:56:28,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:28,660 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:28,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-07 22:56:28,660 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:28,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:28,661 INFO L85 PathProgramCache]: Analyzing trace with hash 112176394, now seen corresponding path program 1 times [2025-02-07 22:56:28,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:28,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763249295] [2025-02-07 22:56:28,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:28,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:28,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-02-07 22:56:28,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-02-07 22:56:28,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:28,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:29,244 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:29,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:29,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763249295] [2025-02-07 22:56:29,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763249295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:29,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:29,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:29,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926878707] [2025-02-07 22:56:29,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:29,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:29,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:29,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:29,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:29,246 INFO L87 Difference]: Start difference. First operand 596 states and 826 transitions. Second operand has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:29,399 INFO L93 Difference]: Finished difference Result 961 states and 1334 transitions. [2025-02-07 22:56:29,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:29,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 326 [2025-02-07 22:56:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:29,402 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:56:29,402 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:56:29,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-07 22:56:29,403 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 467 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:29,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 907 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:56:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:56:29,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:56:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3826530612244898) internal successors, (813), 588 states have internal predecessors, (813), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:56:29,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 825 transitions. [2025-02-07 22:56:29,413 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 825 transitions. Word has length 326 [2025-02-07 22:56:29,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:29,414 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 825 transitions. [2025-02-07 22:56:29,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:29,414 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 825 transitions. [2025-02-07 22:56:29,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-02-07 22:56:29,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:29,416 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:29,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-07 22:56:29,416 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:29,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:29,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1431641609, now seen corresponding path program 1 times [2025-02-07 22:56:29,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:29,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433975692] [2025-02-07 22:56:29,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:29,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:29,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-02-07 22:56:29,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-02-07 22:56:29,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:29,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:29,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:29,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433975692] [2025-02-07 22:56:29,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433975692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:29,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:29,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:29,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189897994] [2025-02-07 22:56:29,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:29,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:29,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:29,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:29,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:29,854 INFO L87 Difference]: Start difference. First operand 596 states and 825 transitions. Second operand has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:30,144 INFO L93 Difference]: Finished difference Result 961 states and 1332 transitions. [2025-02-07 22:56:30,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:30,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 327 [2025-02-07 22:56:30,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:30,146 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:56:30,146 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:56:30,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-07 22:56:30,147 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 453 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:30,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 681 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:56:30,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:56:30,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:56:30,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.380952380952381) internal successors, (812), 588 states have internal predecessors, (812), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:56:30,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 824 transitions. [2025-02-07 22:56:30,162 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 824 transitions. Word has length 327 [2025-02-07 22:56:30,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:30,162 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 824 transitions. [2025-02-07 22:56:30,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 824 transitions. [2025-02-07 22:56:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-02-07 22:56:30,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:30,164 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:30,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-07 22:56:30,165 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:30,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:30,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2115545669, now seen corresponding path program 1 times [2025-02-07 22:56:30,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:30,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944778837] [2025-02-07 22:56:30,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:30,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:30,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-07 22:56:30,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-07 22:56:30,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:30,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:30,883 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:30,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:30,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944778837] [2025-02-07 22:56:30,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944778837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:30,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:30,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:56:30,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015513321] [2025-02-07 22:56:30,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:30,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:56:30,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:30,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:56:30,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:30,885 INFO L87 Difference]: Start difference. First operand 596 states and 824 transitions. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:31,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:31,028 INFO L93 Difference]: Finished difference Result 961 states and 1330 transitions. [2025-02-07 22:56:31,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:31,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 328 [2025-02-07 22:56:31,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:31,032 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:56:31,033 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:56:31,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:31,033 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 382 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:31,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 899 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:56:31,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:56:31,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:56:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.379251700680272) internal successors, (811), 588 states have internal predecessors, (811), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:56:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 823 transitions. [2025-02-07 22:56:31,046 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 823 transitions. Word has length 328 [2025-02-07 22:56:31,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:31,046 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 823 transitions. [2025-02-07 22:56:31,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:31,046 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 823 transitions. [2025-02-07 22:56:31,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-02-07 22:56:31,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:31,048 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:31,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-07 22:56:31,049 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:31,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:31,049 INFO L85 PathProgramCache]: Analyzing trace with hash -545579365, now seen corresponding path program 1 times [2025-02-07 22:56:31,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:31,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005806153] [2025-02-07 22:56:31,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:31,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:31,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-07 22:56:31,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-07 22:56:31,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:31,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:31,704 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:31,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:31,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005806153] [2025-02-07 22:56:31,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005806153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:31,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:31,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:31,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348548863] [2025-02-07 22:56:31,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:31,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:31,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:31,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:31,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:31,707 INFO L87 Difference]: Start difference. First operand 596 states and 823 transitions. Second operand has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:31,905 INFO L93 Difference]: Finished difference Result 961 states and 1328 transitions. [2025-02-07 22:56:31,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:31,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 329 [2025-02-07 22:56:31,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:31,908 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:56:31,908 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:56:31,908 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-07 22:56:31,909 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 863 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:31,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 877 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:31,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:56:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:56:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3775510204081634) internal successors, (810), 588 states have internal predecessors, (810), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:56:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 822 transitions. [2025-02-07 22:56:31,923 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 822 transitions. Word has length 329 [2025-02-07 22:56:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:31,923 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 822 transitions. [2025-02-07 22:56:31,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 822 transitions. [2025-02-07 22:56:31,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-02-07 22:56:31,925 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:31,925 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:31,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-07 22:56:31,925 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:31,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:31,926 INFO L85 PathProgramCache]: Analyzing trace with hash -604916684, now seen corresponding path program 1 times [2025-02-07 22:56:31,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:31,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305058981] [2025-02-07 22:56:31,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:31,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:32,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-02-07 22:56:32,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-02-07 22:56:32,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:32,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:32,578 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:32,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:32,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305058981] [2025-02-07 22:56:32,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305058981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:32,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:32,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:32,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754278838] [2025-02-07 22:56:32,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:32,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:32,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:32,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:32,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:32,580 INFO L87 Difference]: Start difference. First operand 596 states and 822 transitions. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:32,770 INFO L93 Difference]: Finished difference Result 961 states and 1326 transitions. [2025-02-07 22:56:32,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:32,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 330 [2025-02-07 22:56:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:32,773 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:56:32,773 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:56:32,774 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-07 22:56:32,774 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 853 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:32,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 877 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:32,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:56:32,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:56:32,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3758503401360545) internal successors, (809), 588 states have internal predecessors, (809), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:56:32,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 821 transitions. [2025-02-07 22:56:32,784 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 821 transitions. Word has length 330 [2025-02-07 22:56:32,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:32,784 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 821 transitions. [2025-02-07 22:56:32,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:32,785 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 821 transitions. [2025-02-07 22:56:32,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-02-07 22:56:32,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:32,791 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:32,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-07 22:56:32,792 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:32,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:32,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2015607887, now seen corresponding path program 1 times [2025-02-07 22:56:32,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:32,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582500559] [2025-02-07 22:56:32,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:32,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:32,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-02-07 22:56:33,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-02-07 22:56:33,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:33,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:33,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:33,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582500559] [2025-02-07 22:56:33,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582500559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:33,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:33,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:56:33,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497242737] [2025-02-07 22:56:33,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:33,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:56:33,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:33,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:56:33,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:33,549 INFO L87 Difference]: Start difference. First operand 596 states and 821 transitions. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:33,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:33,721 INFO L93 Difference]: Finished difference Result 961 states and 1324 transitions. [2025-02-07 22:56:33,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:33,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 331 [2025-02-07 22:56:33,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:33,724 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:56:33,724 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:56:33,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:33,726 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 391 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:33,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 877 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:56:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:56:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3741496598639455) internal successors, (808), 588 states have internal predecessors, (808), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:56:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 820 transitions. [2025-02-07 22:56:33,739 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 820 transitions. Word has length 331 [2025-02-07 22:56:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:33,740 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 820 transitions. [2025-02-07 22:56:33,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:33,740 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 820 transitions. [2025-02-07 22:56:33,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-02-07 22:56:33,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:33,742 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-07 22:56:33,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-07 22:56:33,742 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:33,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:33,742 INFO L85 PathProgramCache]: Analyzing trace with hash 348143711, now seen corresponding path program 1 times [2025-02-07 22:56:33,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:33,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29173400] [2025-02-07 22:56:33,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:33,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:33,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-07 22:56:34,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-07 22:56:34,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:34,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:34,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:34,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29173400] [2025-02-07 22:56:34,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29173400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:34,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:34,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:56:34,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103695241] [2025-02-07 22:56:34,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:34,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:56:34,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:34,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:56:34,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:34,465 INFO L87 Difference]: Start difference. First operand 596 states and 820 transitions. Second operand has 6 states, 6 states have (on average 50.833333333333336) internal successors, (305), 6 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:34,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:34,889 INFO L93 Difference]: Finished difference Result 1394 states and 1925 transitions. [2025-02-07 22:56:34,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:56:34,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 50.833333333333336) internal successors, (305), 6 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 332 [2025-02-07 22:56:34,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:34,893 INFO L225 Difference]: With dead ends: 1394 [2025-02-07 22:56:34,893 INFO L226 Difference]: Without dead ends: 1029 [2025-02-07 22:56:34,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:56:34,894 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 589 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:34,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1659 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:56:34,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-02-07 22:56:34,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 917. [2025-02-07 22:56:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 906 states have (on average 1.369757174392936) internal successors, (1241), 906 states have internal predecessors, (1241), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 22:56:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1259 transitions. [2025-02-07 22:56:34,909 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1259 transitions. Word has length 332 [2025-02-07 22:56:34,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:34,909 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1259 transitions. [2025-02-07 22:56:34,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.833333333333336) internal successors, (305), 6 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:34,910 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1259 transitions. [2025-02-07 22:56:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-07 22:56:34,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:34,911 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:34,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-07 22:56:34,912 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:34,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:34,912 INFO L85 PathProgramCache]: Analyzing trace with hash 362103805, now seen corresponding path program 1 times [2025-02-07 22:56:34,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:34,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33977480] [2025-02-07 22:56:34,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:34,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:34,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-07 22:56:35,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-07 22:56:35,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:35,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:35,985 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-07 22:56:35,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:35,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33977480] [2025-02-07 22:56:35,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33977480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:35,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:35,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:35,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927751847] [2025-02-07 22:56:35,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:35,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:35,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:35,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:35,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:35,987 INFO L87 Difference]: Start difference. First operand 917 states and 1259 transitions. Second operand has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:36,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:36,312 INFO L93 Difference]: Finished difference Result 1588 states and 2152 transitions. [2025-02-07 22:56:36,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:56:36,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 333 [2025-02-07 22:56:36,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:36,315 INFO L225 Difference]: With dead ends: 1588 [2025-02-07 22:56:36,316 INFO L226 Difference]: Without dead ends: 941 [2025-02-07 22:56:36,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:36,317 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 324 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:36,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1007 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:56:36,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-02-07 22:56:36,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 935. [2025-02-07 22:56:36,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 924 states have (on average 1.3625541125541125) internal successors, (1259), 924 states have internal predecessors, (1259), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 22:56:36,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1277 transitions. [2025-02-07 22:56:36,331 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1277 transitions. Word has length 333 [2025-02-07 22:56:36,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:36,331 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1277 transitions. [2025-02-07 22:56:36,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:36,331 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1277 transitions. [2025-02-07 22:56:36,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-02-07 22:56:36,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:36,333 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:36,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-07 22:56:36,334 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:36,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:36,334 INFO L85 PathProgramCache]: Analyzing trace with hash 2042418315, now seen corresponding path program 1 times [2025-02-07 22:56:36,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:36,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144230703] [2025-02-07 22:56:36,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:36,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:36,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-02-07 22:56:36,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-02-07 22:56:36,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:36,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 81 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:37,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:37,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144230703] [2025-02-07 22:56:37,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144230703] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:56:37,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231744336] [2025-02-07 22:56:37,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:37,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:56:37,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:56:37,609 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-07 22:56:37,614 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-07 22:56:38,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-02-07 22:56:38,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-02-07 22:56:38,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:38,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:38,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 2042 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-07 22:56:38,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:56:38,969 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:38,969 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:56:38,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231744336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:38,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:56:38,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-02-07 22:56:38,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874655571] [2025-02-07 22:56:38,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:38,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:56:38,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:38,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:56:38,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-07 22:56:38,971 INFO L87 Difference]: Start difference. First operand 935 states and 1277 transitions. Second operand has 7 states, 7 states have (on average 39.714285714285715) internal successors, (278), 7 states have internal predecessors, (278), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 22:56:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:39,454 INFO L93 Difference]: Finished difference Result 1724 states and 2334 transitions. [2025-02-07 22:56:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:56:39,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.714285714285715) internal successors, (278), 7 states have internal predecessors, (278), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 335 [2025-02-07 22:56:39,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:39,456 INFO L225 Difference]: With dead ends: 1724 [2025-02-07 22:56:39,456 INFO L226 Difference]: Without dead ends: 959 [2025-02-07 22:56:39,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-02-07 22:56:39,457 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 953 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:39,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 1246 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:56:39,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-02-07 22:56:39,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 935. [2025-02-07 22:56:39,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 924 states have (on average 1.3593073593073592) internal successors, (1256), 924 states have internal predecessors, (1256), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 22:56:39,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1274 transitions. [2025-02-07 22:56:39,473 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1274 transitions. Word has length 335 [2025-02-07 22:56:39,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:39,473 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1274 transitions. [2025-02-07 22:56:39,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.714285714285715) internal successors, (278), 7 states have internal predecessors, (278), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 22:56:39,473 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1274 transitions. [2025-02-07 22:56:39,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-02-07 22:56:39,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:39,475 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:39,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 22:56:39,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:56:39,676 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:39,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:39,677 INFO L85 PathProgramCache]: Analyzing trace with hash 771806123, now seen corresponding path program 1 times [2025-02-07 22:56:39,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:39,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336860502] [2025-02-07 22:56:39,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:39,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:39,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-02-07 22:56:40,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-02-07 22:56:40,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:40,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:40,455 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:40,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:40,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336860502] [2025-02-07 22:56:40,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336860502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:40,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:40,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:56:40,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961025650] [2025-02-07 22:56:40,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:40,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:56:40,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:40,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:56:40,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:40,456 INFO L87 Difference]: Start difference. First operand 935 states and 1274 transitions. Second operand has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:40,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:40,930 INFO L93 Difference]: Finished difference Result 1329 states and 1815 transitions. [2025-02-07 22:56:40,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:56:40,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 335 [2025-02-07 22:56:40,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:40,932 INFO L225 Difference]: With dead ends: 1329 [2025-02-07 22:56:40,932 INFO L226 Difference]: Without dead ends: 958 [2025-02-07 22:56:40,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:56:40,933 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 1006 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:40,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 1310 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:56:40,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2025-02-07 22:56:40,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 936. [2025-02-07 22:56:40,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 925 states have (on average 1.358918918918919) internal successors, (1257), 925 states have internal predecessors, (1257), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 22:56:40,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1275 transitions. [2025-02-07 22:56:40,950 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1275 transitions. Word has length 335 [2025-02-07 22:56:40,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:40,951 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1275 transitions. [2025-02-07 22:56:40,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:40,951 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1275 transitions. [2025-02-07 22:56:40,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-02-07 22:56:40,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:40,953 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:40,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-07 22:56:40,953 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:40,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:40,953 INFO L85 PathProgramCache]: Analyzing trace with hash 2129424028, now seen corresponding path program 1 times [2025-02-07 22:56:40,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:40,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650899581] [2025-02-07 22:56:40,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:40,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:41,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-02-07 22:56:41,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-02-07 22:56:41,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:41,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-07 22:56:42,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:42,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650899581] [2025-02-07 22:56:42,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650899581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:42,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:42,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:56:42,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708095629] [2025-02-07 22:56:42,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:42,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:56:42,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:42,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:56:42,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:56:42,029 INFO L87 Difference]: Start difference. First operand 936 states and 1275 transitions. Second operand has 8 states, 8 states have (on average 32.125) internal successors, (257), 8 states have internal predecessors, (257), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:43,052 INFO L93 Difference]: Finished difference Result 2113 states and 2870 transitions. [2025-02-07 22:56:43,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:56:43,052 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.125) internal successors, (257), 8 states have internal predecessors, (257), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 335 [2025-02-07 22:56:43,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:43,056 INFO L225 Difference]: With dead ends: 2113 [2025-02-07 22:56:43,056 INFO L226 Difference]: Without dead ends: 1624 [2025-02-07 22:56:43,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:56:43,057 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 1345 mSDsluCounter, 2905 mSDsCounter, 0 mSdLazyCounter, 2606 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 3696 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:43,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 3696 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2606 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 22:56:43,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2025-02-07 22:56:43,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1003. [2025-02-07 22:56:43,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 989 states have (on average 1.3619817997977754) internal successors, (1347), 989 states have internal predecessors, (1347), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-07 22:56:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1371 transitions. [2025-02-07 22:56:43,072 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1371 transitions. Word has length 335 [2025-02-07 22:56:43,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:43,072 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1371 transitions. [2025-02-07 22:56:43,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.125) internal successors, (257), 8 states have internal predecessors, (257), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:43,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1371 transitions. [2025-02-07 22:56:43,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-02-07 22:56:43,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:43,074 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:43,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-07 22:56:43,074 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:43,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:43,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1114257072, now seen corresponding path program 1 times [2025-02-07 22:56:43,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:43,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553575593] [2025-02-07 22:56:43,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:43,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:43,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-02-07 22:56:43,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-02-07 22:56:43,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:43,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:44,443 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 4 proven. 80 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:44,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:44,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553575593] [2025-02-07 22:56:44,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553575593] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:56:44,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107839911] [2025-02-07 22:56:44,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:44,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:56:44,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:56:44,446 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-07 22:56:44,447 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-07 22:56:45,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-02-07 22:56:45,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-02-07 22:56:45,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:45,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:45,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 2039 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-07 22:56:45,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:56:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-02-07 22:56:45,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:56:45,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107839911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:45,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:56:45,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2025-02-07 22:56:45,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889454494] [2025-02-07 22:56:45,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:45,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:56:45,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:45,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:56:45,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-02-07 22:56:45,455 INFO L87 Difference]: Start difference. First operand 1003 states and 1371 transitions. Second operand has 6 states, 6 states have (on average 39.5) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:45,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:45,847 INFO L93 Difference]: Finished difference Result 1889 states and 2568 transitions. [2025-02-07 22:56:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:56:45,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 336 [2025-02-07 22:56:45,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:45,854 INFO L225 Difference]: With dead ends: 1889 [2025-02-07 22:56:45,854 INFO L226 Difference]: Without dead ends: 1019 [2025-02-07 22:56:45,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-02-07 22:56:45,856 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 506 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:45,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1288 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:56:45,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2025-02-07 22:56:45,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1015. [2025-02-07 22:56:45,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1001 states have (on average 1.3536463536463537) internal successors, (1355), 1001 states have internal predecessors, (1355), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-07 22:56:45,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1379 transitions. [2025-02-07 22:56:45,891 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1379 transitions. Word has length 336 [2025-02-07 22:56:45,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:45,891 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1379 transitions. [2025-02-07 22:56:45,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1379 transitions. [2025-02-07 22:56:45,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-02-07 22:56:45,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:45,897 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:45,921 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-07 22:56:46,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:56:46,097 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:46,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:46,098 INFO L85 PathProgramCache]: Analyzing trace with hash -805024198, now seen corresponding path program 1 times [2025-02-07 22:56:46,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:46,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293159850] [2025-02-07 22:56:46,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:46,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:46,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-02-07 22:56:46,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-02-07 22:56:46,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:46,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:47,179 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 64 proven. 3 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-02-07 22:56:47,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:47,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293159850] [2025-02-07 22:56:47,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293159850] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:56:47,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154549514] [2025-02-07 22:56:47,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:47,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:56:47,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:56:47,182 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-07 22:56:47,183 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-07 22:56:47,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-02-07 22:56:48,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-02-07 22:56:48,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:48,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:48,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 2047 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-07 22:56:48,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:56:48,305 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-02-07 22:56:48,305 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:56:48,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154549514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:48,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:56:48,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2025-02-07 22:56:48,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645361759] [2025-02-07 22:56:48,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:48,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 22:56:48,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:48,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 22:56:48,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-07 22:56:48,307 INFO L87 Difference]: Start difference. First operand 1015 states and 1379 transitions. Second operand has 9 states, 9 states have (on average 29.11111111111111) internal successors, (262), 9 states have internal predecessors, (262), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 22:56:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:48,939 INFO L93 Difference]: Finished difference Result 1800 states and 2429 transitions. [2025-02-07 22:56:48,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 22:56:48,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.11111111111111) internal successors, (262), 9 states have internal predecessors, (262), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 340 [2025-02-07 22:56:48,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:48,942 INFO L225 Difference]: With dead ends: 1800 [2025-02-07 22:56:48,942 INFO L226 Difference]: Without dead ends: 1035 [2025-02-07 22:56:48,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-02-07 22:56:48,943 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 497 mSDsluCounter, 1898 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 2221 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:48,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 2221 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:56:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2025-02-07 22:56:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1027. [2025-02-07 22:56:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1013 states have (on average 1.3494570582428431) internal successors, (1367), 1013 states have internal predecessors, (1367), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-07 22:56:48,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1391 transitions. [2025-02-07 22:56:48,958 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1391 transitions. Word has length 340 [2025-02-07 22:56:48,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:48,958 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1391 transitions. [2025-02-07 22:56:48,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.11111111111111) internal successors, (262), 9 states have internal predecessors, (262), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 22:56:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1391 transitions. [2025-02-07 22:56:48,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-02-07 22:56:48,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:48,960 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:48,973 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-07 22:56:49,164 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,SelfDestructingSolverStorable35 [2025-02-07 22:56:49,164 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:49,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:49,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1321657560, now seen corresponding path program 1 times [2025-02-07 22:56:49,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:49,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350596499] [2025-02-07 22:56:49,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:49,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:49,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-02-07 22:56:49,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-02-07 22:56:49,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:49,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 4 proven. 84 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:50,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:50,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350596499] [2025-02-07 22:56:50,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350596499] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:56:50,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808336331] [2025-02-07 22:56:50,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:50,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:56:50,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:56:50,568 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-07 22:56:50,569 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-07 22:56:51,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-02-07 22:56:51,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-02-07 22:56:51,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:51,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:51,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 2055 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-07 22:56:51,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:56:51,602 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-07 22:56:51,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:56:51,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808336331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:51,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:56:51,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2025-02-07 22:56:51,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734469741] [2025-02-07 22:56:51,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:51,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 22:56:51,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:51,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 22:56:51,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-02-07 22:56:51,603 INFO L87 Difference]: Start difference. First operand 1027 states and 1391 transitions. Second operand has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 9 states have internal predecessors, (257), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 22:56:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:52,231 INFO L93 Difference]: Finished difference Result 1878 states and 2531 transitions. [2025-02-07 22:56:52,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 22:56:52,231 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 9 states have internal predecessors, (257), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 344 [2025-02-07 22:56:52,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:52,234 INFO L225 Difference]: With dead ends: 1878 [2025-02-07 22:56:52,234 INFO L226 Difference]: Without dead ends: 1047 [2025-02-07 22:56:52,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-02-07 22:56:52,235 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 494 mSDsluCounter, 1910 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 2232 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:52,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 2232 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:56:52,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2025-02-07 22:56:52,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1039. [2025-02-07 22:56:52,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 1025 states have (on average 1.3414634146341464) internal successors, (1375), 1025 states have internal predecessors, (1375), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-07 22:56:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1399 transitions. [2025-02-07 22:56:52,248 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1399 transitions. Word has length 344 [2025-02-07 22:56:52,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:52,248 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1399 transitions. [2025-02-07 22:56:52,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 9 states have internal predecessors, (257), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 22:56:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1399 transitions. [2025-02-07 22:56:52,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-02-07 22:56:52,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:52,251 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:52,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-07 22:56:52,451 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,SelfDestructingSolverStorable36 [2025-02-07 22:56:52,451 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:52,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1612515804, now seen corresponding path program 1 times [2025-02-07 22:56:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:52,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166053594] [2025-02-07 22:56:52,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:52,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:52,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-07 22:56:53,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-07 22:56:53,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:53,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 50 proven. 38 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-07 22:56:56,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:56,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166053594] [2025-02-07 22:56:56,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166053594] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:56:56,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807332058] [2025-02-07 22:56:56,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:56,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:56:56,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:56:56,932 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:56:56,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 22:56:57,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-07 22:56:57,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-07 22:56:57,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:57,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:57,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 2063 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 22:56:57,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:56:57,990 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-02-07 22:56:57,990 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:56:57,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807332058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:57,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:56:57,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [20] total 24 [2025-02-07 22:56:57,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881192753] [2025-02-07 22:56:57,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:57,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:56:57,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:57,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:56:57,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2025-02-07 22:56:57,992 INFO L87 Difference]: Start difference. First operand 1039 states and 1399 transitions. Second operand has 6 states, 5 states have (on average 59.0) internal successors, (295), 6 states have internal predecessors, (295), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 22:56:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:58,198 INFO L93 Difference]: Finished difference Result 1812 states and 2429 transitions. [2025-02-07 22:56:58,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:56:58,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 59.0) internal successors, (295), 6 states have internal predecessors, (295), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 348 [2025-02-07 22:56:58,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:58,201 INFO L225 Difference]: With dead ends: 1812 [2025-02-07 22:56:58,201 INFO L226 Difference]: Without dead ends: 1039 [2025-02-07 22:56:58,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2025-02-07 22:56:58,202 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 0 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2236 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:58,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2236 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:58,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2025-02-07 22:56:58,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1039. [2025-02-07 22:56:58,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 1025 states have (on average 1.3375609756097562) internal successors, (1371), 1025 states have internal predecessors, (1371), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-07 22:56:58,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1395 transitions. [2025-02-07 22:56:58,216 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1395 transitions. Word has length 348 [2025-02-07 22:56:58,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:58,216 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1395 transitions. [2025-02-07 22:56:58,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 59.0) internal successors, (295), 6 states have internal predecessors, (295), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 22:56:58,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1395 transitions. [2025-02-07 22:56:58,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-02-07 22:56:58,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:58,219 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:56:58,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-07 22:56:58,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-02-07 22:56:58,419 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:58,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:58,420 INFO L85 PathProgramCache]: Analyzing trace with hash -543117042, now seen corresponding path program 1 times [2025-02-07 22:56:58,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:58,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740631427] [2025-02-07 22:56:58,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:58,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:58,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-07 22:56:58,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-07 22:56:58,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:58,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:59,768 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 86 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:59,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:59,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740631427] [2025-02-07 22:56:59,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740631427] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:56:59,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091967875] [2025-02-07 22:56:59,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:59,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:56:59,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:56:59,771 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:56:59,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-07 22:57:00,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-07 22:57:00,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-07 22:57:00,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:00,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:00,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 2063 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-07 22:57:00,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:57:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:01,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:57:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:01,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091967875] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-07 22:57:01,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-07 22:57:01,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 8] total 22 [2025-02-07 22:57:01,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020080943] [2025-02-07 22:57:01,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:01,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:57:01,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:01,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:57:01,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-02-07 22:57:01,291 INFO L87 Difference]: Start difference. First operand 1039 states and 1395 transitions. Second operand has 7 states, 7 states have (on average 45.857142857142854) internal successors, (321), 7 states have internal predecessors, (321), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:01,782 INFO L93 Difference]: Finished difference Result 1797 states and 2420 transitions. [2025-02-07 22:57:01,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:57:01,782 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 45.857142857142854) internal successors, (321), 7 states have internal predecessors, (321), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 348 [2025-02-07 22:57:01,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:01,786 INFO L225 Difference]: With dead ends: 1797 [2025-02-07 22:57:01,786 INFO L226 Difference]: Without dead ends: 1417 [2025-02-07 22:57:01,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2025-02-07 22:57:01,787 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 353 mSDsluCounter, 3605 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 4399 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:01,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 4399 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:57:01,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2025-02-07 22:57:01,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1214. [2025-02-07 22:57:01,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1197 states have (on average 1.3266499582289055) internal successors, (1588), 1197 states have internal predecessors, (1588), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-07 22:57:01,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1618 transitions. [2025-02-07 22:57:01,805 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1618 transitions. Word has length 348 [2025-02-07 22:57:01,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:01,806 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1618 transitions. [2025-02-07 22:57:01,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.857142857142854) internal successors, (321), 7 states have internal predecessors, (321), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:01,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1618 transitions. [2025-02-07 22:57:01,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-02-07 22:57:01,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:01,808 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:57:01,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-07 22:57:02,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:57:02,013 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:02,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:02,014 INFO L85 PathProgramCache]: Analyzing trace with hash -651979593, now seen corresponding path program 1 times [2025-02-07 22:57:02,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:02,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254446081] [2025-02-07 22:57:02,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:02,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:02,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-07 22:57:02,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-07 22:57:02,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:02,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:02,435 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-02-07 22:57:02,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:02,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254446081] [2025-02-07 22:57:02,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254446081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:02,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:02,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:02,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95343661] [2025-02-07 22:57:02,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:02,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:02,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:02,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:02,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:02,436 INFO L87 Difference]: Start difference. First operand 1214 states and 1618 transitions. Second operand has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:02,610 INFO L93 Difference]: Finished difference Result 2082 states and 2780 transitions. [2025-02-07 22:57:02,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:57:02,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 348 [2025-02-07 22:57:02,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:02,613 INFO L225 Difference]: With dead ends: 2082 [2025-02-07 22:57:02,613 INFO L226 Difference]: Without dead ends: 1286 [2025-02-07 22:57:02,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:02,614 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 16 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:02,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1794 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:02,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2025-02-07 22:57:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1286. [2025-02-07 22:57:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1269 states have (on average 1.3333333333333333) internal successors, (1692), 1269 states have internal predecessors, (1692), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-07 22:57:02,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1722 transitions. [2025-02-07 22:57:02,629 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1722 transitions. Word has length 348 [2025-02-07 22:57:02,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:02,630 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 1722 transitions. [2025-02-07 22:57:02,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:02,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1722 transitions. [2025-02-07 22:57:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-02-07 22:57:02,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:02,632 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:57:02,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-07 22:57:02,632 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:02,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:02,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1043038646, now seen corresponding path program 1 times [2025-02-07 22:57:02,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:02,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907766529] [2025-02-07 22:57:02,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:02,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:02,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-02-07 22:57:03,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-02-07 22:57:03,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:03,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:04,391 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 52 proven. 19 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-02-07 22:57:04,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:04,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907766529] [2025-02-07 22:57:04,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907766529] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:57:04,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084604632] [2025-02-07 22:57:04,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:04,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:57:04,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:57:04,394 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:57:04,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-07 22:57:05,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-02-07 22:57:05,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-02-07 22:57:05,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:05,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:05,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 2066 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-07 22:57:05,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:57:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-07 22:57:05,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:57:05,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084604632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:05,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:57:05,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2025-02-07 22:57:05,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270668281] [2025-02-07 22:57:05,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:05,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:57:05,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:05,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:57:05,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-02-07 22:57:05,838 INFO L87 Difference]: Start difference. First operand 1286 states and 1722 transitions. Second operand has 8 states, 8 states have (on average 40.25) internal successors, (322), 8 states have internal predecessors, (322), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:06,359 INFO L93 Difference]: Finished difference Result 2826 states and 3793 transitions. [2025-02-07 22:57:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:57:06,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.25) internal successors, (322), 8 states have internal predecessors, (322), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 349 [2025-02-07 22:57:06,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:06,364 INFO L225 Difference]: With dead ends: 2826 [2025-02-07 22:57:06,365 INFO L226 Difference]: Without dead ends: 2092 [2025-02-07 22:57:06,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-02-07 22:57:06,366 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 930 mSDsluCounter, 1649 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:06,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1981 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:57:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2025-02-07 22:57:06,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 1746. [2025-02-07 22:57:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1746 states, 1720 states have (on average 1.3203488372093024) internal successors, (2271), 1720 states have internal predecessors, (2271), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 22:57:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 2319 transitions. [2025-02-07 22:57:06,394 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 2319 transitions. Word has length 349 [2025-02-07 22:57:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:06,394 INFO L471 AbstractCegarLoop]: Abstraction has 1746 states and 2319 transitions. [2025-02-07 22:57:06,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.25) internal successors, (322), 8 states have internal predecessors, (322), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 2319 transitions. [2025-02-07 22:57:06,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-02-07 22:57:06,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:06,398 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:57:06,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-07 22:57:06,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:57:06,603 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:06,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:06,603 INFO L85 PathProgramCache]: Analyzing trace with hash -489588388, now seen corresponding path program 1 times [2025-02-07 22:57:06,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:06,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122908875] [2025-02-07 22:57:06,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:06,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:06,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-02-07 22:57:07,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-02-07 22:57:07,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:07,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:08,248 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-02-07 22:57:08,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:08,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122908875] [2025-02-07 22:57:08,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122908875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:08,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:08,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 22:57:08,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185081482] [2025-02-07 22:57:08,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:08,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 22:57:08,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:08,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 22:57:08,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-07 22:57:08,250 INFO L87 Difference]: Start difference. First operand 1746 states and 2319 transitions. Second operand has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 22:57:09,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:09,843 INFO L93 Difference]: Finished difference Result 4187 states and 5487 transitions. [2025-02-07 22:57:09,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 22:57:09,843 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 350 [2025-02-07 22:57:09,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:09,848 INFO L225 Difference]: With dead ends: 4187 [2025-02-07 22:57:09,848 INFO L226 Difference]: Without dead ends: 3039 [2025-02-07 22:57:09,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-02-07 22:57:09,849 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 864 mSDsluCounter, 3299 mSDsCounter, 0 mSdLazyCounter, 2872 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 3807 SdHoareTripleChecker+Invalid, 2875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:09,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 3807 Invalid, 2875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2872 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-07 22:57:09,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3039 states. [2025-02-07 22:57:09,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3039 to 2038. [2025-02-07 22:57:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2038 states, 2004 states have (on average 1.3228542914171657) internal successors, (2651), 2004 states have internal predecessors, (2651), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-07 22:57:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 2715 transitions. [2025-02-07 22:57:09,879 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 2715 transitions. Word has length 350 [2025-02-07 22:57:09,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:09,879 INFO L471 AbstractCegarLoop]: Abstraction has 2038 states and 2715 transitions. [2025-02-07 22:57:09,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 22:57:09,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2715 transitions. [2025-02-07 22:57:09,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-02-07 22:57:09,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:09,883 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:57:09,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-07 22:57:09,883 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:09,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:09,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1890793714, now seen corresponding path program 1 times [2025-02-07 22:57:09,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:09,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390220191] [2025-02-07 22:57:09,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:09,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:09,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-07 22:57:10,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-07 22:57:10,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:10,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-02-07 22:57:12,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:12,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390220191] [2025-02-07 22:57:12,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390220191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:12,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:12,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 22:57:12,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718073056] [2025-02-07 22:57:12,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:12,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 22:57:12,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:12,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 22:57:12,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:57:12,076 INFO L87 Difference]: Start difference. First operand 2038 states and 2715 transitions. Second operand has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 22:57:12,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:12,860 INFO L93 Difference]: Finished difference Result 3715 states and 4943 transitions. [2025-02-07 22:57:12,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 22:57:12,860 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 352 [2025-02-07 22:57:12,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:12,865 INFO L225 Difference]: With dead ends: 3715 [2025-02-07 22:57:12,865 INFO L226 Difference]: Without dead ends: 2634 [2025-02-07 22:57:12,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-02-07 22:57:12,867 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 1640 mSDsluCounter, 3717 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1645 SdHoareTripleChecker+Valid, 4408 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:12,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1645 Valid, 4408 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:57:12,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2025-02-07 22:57:12,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2166. [2025-02-07 22:57:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2166 states, 2126 states have (on average 1.319379115710254) internal successors, (2805), 2126 states have internal predecessors, (2805), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-07 22:57:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 2881 transitions. [2025-02-07 22:57:12,902 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 2881 transitions. Word has length 352 [2025-02-07 22:57:12,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:12,902 INFO L471 AbstractCegarLoop]: Abstraction has 2166 states and 2881 transitions. [2025-02-07 22:57:12,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 22:57:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2881 transitions. [2025-02-07 22:57:12,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-02-07 22:57:12,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:12,906 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:57:12,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-07 22:57:12,906 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:12,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:12,906 INFO L85 PathProgramCache]: Analyzing trace with hash 443005273, now seen corresponding path program 1 times [2025-02-07 22:57:12,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:12,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617864426] [2025-02-07 22:57:12,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:12,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:12,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-07 22:57:13,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-07 22:57:13,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:13,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 86 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:14,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:14,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617864426] [2025-02-07 22:57:14,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617864426] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:57:14,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336515290] [2025-02-07 22:57:14,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:14,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:57:14,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:57:14,581 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:57:14,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-07 22:57:15,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-07 22:57:15,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-07 22:57:15,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:15,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:15,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 2075 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 22:57:15,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:57:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-02-07 22:57:16,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:57:16,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336515290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:16,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:57:16,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2025-02-07 22:57:16,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10896955] [2025-02-07 22:57:16,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:16,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:57:16,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:16,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:57:16,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-02-07 22:57:16,038 INFO L87 Difference]: Start difference. First operand 2166 states and 2881 transitions. Second operand has 6 states, 5 states have (on average 53.4) internal successors, (267), 6 states have internal predecessors, (267), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-07 22:57:16,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:16,251 INFO L93 Difference]: Finished difference Result 3856 states and 5119 transitions. [2025-02-07 22:57:16,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:57:16,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 53.4) internal successors, (267), 6 states have internal predecessors, (267), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 352 [2025-02-07 22:57:16,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:16,255 INFO L225 Difference]: With dead ends: 3856 [2025-02-07 22:57:16,255 INFO L226 Difference]: Without dead ends: 2166 [2025-02-07 22:57:16,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-02-07 22:57:16,258 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 0 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:16,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2237 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:16,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2025-02-07 22:57:16,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2166. [2025-02-07 22:57:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2166 states, 2126 states have (on average 1.3156161806208844) internal successors, (2797), 2126 states have internal predecessors, (2797), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-07 22:57:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 2873 transitions. [2025-02-07 22:57:16,288 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 2873 transitions. Word has length 352 [2025-02-07 22:57:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:16,289 INFO L471 AbstractCegarLoop]: Abstraction has 2166 states and 2873 transitions. [2025-02-07 22:57:16,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 53.4) internal successors, (267), 6 states have internal predecessors, (267), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-07 22:57:16,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2873 transitions. [2025-02-07 22:57:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-02-07 22:57:16,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:16,292 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:57:16,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-07 22:57:16,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:57:16,493 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:16,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:16,494 INFO L85 PathProgramCache]: Analyzing trace with hash 838172720, now seen corresponding path program 1 times [2025-02-07 22:57:16,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:16,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60149763] [2025-02-07 22:57:16,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:16,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:16,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-07 22:57:16,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-07 22:57:16,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:16,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:17,672 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-02-07 22:57:17,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:17,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60149763] [2025-02-07 22:57:17,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60149763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:17,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:17,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:57:17,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115841764] [2025-02-07 22:57:17,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:17,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:57:17,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:17,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:57:17,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:57:17,674 INFO L87 Difference]: Start difference. First operand 2166 states and 2873 transitions. Second operand has 8 states, 8 states have (on average 34.125) internal successors, (273), 8 states have internal predecessors, (273), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:18,852 INFO L93 Difference]: Finished difference Result 4462 states and 5926 transitions. [2025-02-07 22:57:18,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:57:18,853 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.125) internal successors, (273), 8 states have internal predecessors, (273), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 352 [2025-02-07 22:57:18,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:18,858 INFO L225 Difference]: With dead ends: 4462 [2025-02-07 22:57:18,858 INFO L226 Difference]: Without dead ends: 3472 [2025-02-07 22:57:18,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:57:18,860 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 1275 mSDsluCounter, 2856 mSDsCounter, 0 mSdLazyCounter, 2606 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 3638 SdHoareTripleChecker+Invalid, 2606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:18,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 3638 Invalid, 2606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2606 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-07 22:57:18,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2025-02-07 22:57:18,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 2167. [2025-02-07 22:57:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 2127 states have (on average 1.315937940761636) internal successors, (2799), 2127 states have internal predecessors, (2799), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-07 22:57:18,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 2875 transitions. [2025-02-07 22:57:18,895 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 2875 transitions. Word has length 352 [2025-02-07 22:57:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:18,895 INFO L471 AbstractCegarLoop]: Abstraction has 2167 states and 2875 transitions. [2025-02-07 22:57:18,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.125) internal successors, (273), 8 states have internal predecessors, (273), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 2875 transitions. [2025-02-07 22:57:18,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-02-07 22:57:18,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:18,899 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:57:18,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-07 22:57:18,899 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:18,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:18,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1735206244, now seen corresponding path program 1 times [2025-02-07 22:57:18,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:18,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528085119] [2025-02-07 22:57:18,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:18,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:18,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-07 22:57:19,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-07 22:57:19,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:19,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:19,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:19,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528085119] [2025-02-07 22:57:19,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528085119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:19,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:19,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:57:19,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183955186] [2025-02-07 22:57:19,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:19,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:57:19,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:19,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:57:19,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:19,805 INFO L87 Difference]: Start difference. First operand 2167 states and 2875 transitions. Second operand has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:20,454 INFO L93 Difference]: Finished difference Result 3501 states and 4656 transitions. [2025-02-07 22:57:20,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:57:20,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 352 [2025-02-07 22:57:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:20,460 INFO L225 Difference]: With dead ends: 3501 [2025-02-07 22:57:20,460 INFO L226 Difference]: Without dead ends: 2824 [2025-02-07 22:57:20,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:57:20,462 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 746 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:20,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 2036 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:57:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2025-02-07 22:57:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 2240. [2025-02-07 22:57:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2240 states, 2198 states have (on average 1.3166515013648772) internal successors, (2894), 2198 states have internal predecessors, (2894), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-07 22:57:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 2974 transitions. [2025-02-07 22:57:20,498 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 2974 transitions. Word has length 352 [2025-02-07 22:57:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:20,498 INFO L471 AbstractCegarLoop]: Abstraction has 2240 states and 2974 transitions. [2025-02-07 22:57:20,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:20,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 2974 transitions. [2025-02-07 22:57:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-02-07 22:57:20,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:20,501 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:57:20,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-07 22:57:20,502 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:20,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:20,502 INFO L85 PathProgramCache]: Analyzing trace with hash -608335383, now seen corresponding path program 1 times [2025-02-07 22:57:20,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:20,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723774851] [2025-02-07 22:57:20,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:20,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:20,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-07 22:57:20,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-07 22:57:20,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:20,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:21,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:21,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723774851] [2025-02-07 22:57:21,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723774851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:21,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:21,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 22:57:21,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433462593] [2025-02-07 22:57:21,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:21,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 22:57:21,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:21,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 22:57:21,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:57:21,799 INFO L87 Difference]: Start difference. First operand 2240 states and 2974 transitions. Second operand has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:23,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:23,047 INFO L93 Difference]: Finished difference Result 5620 states and 7478 transitions. [2025-02-07 22:57:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 22:57:23,047 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 352 [2025-02-07 22:57:23,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:23,055 INFO L225 Difference]: With dead ends: 5620 [2025-02-07 22:57:23,055 INFO L226 Difference]: Without dead ends: 4943 [2025-02-07 22:57:23,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-02-07 22:57:23,058 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 1736 mSDsluCounter, 2943 mSDsCounter, 0 mSdLazyCounter, 2441 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 3442 SdHoareTripleChecker+Invalid, 2444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:23,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 3442 Invalid, 2444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2441 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-07 22:57:23,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4943 states. [2025-02-07 22:57:23,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4943 to 2414. [2025-02-07 22:57:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2414 states, 2364 states have (on average 1.3147208121827412) internal successors, (3108), 2364 states have internal predecessors, (3108), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-07 22:57:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 3204 transitions. [2025-02-07 22:57:23,106 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 3204 transitions. Word has length 352 [2025-02-07 22:57:23,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:23,106 INFO L471 AbstractCegarLoop]: Abstraction has 2414 states and 3204 transitions. [2025-02-07 22:57:23,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:23,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 3204 transitions. [2025-02-07 22:57:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-02-07 22:57:23,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:23,110 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:57:23,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-07 22:57:23,110 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:23,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:23,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1081680018, now seen corresponding path program 1 times [2025-02-07 22:57:23,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:23,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287336479] [2025-02-07 22:57:23,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:23,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:23,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-02-07 22:57:23,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-02-07 22:57:23,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:23,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-02-07 22:57:24,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:24,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287336479] [2025-02-07 22:57:24,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287336479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:24,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:24,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:57:24,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565254370] [2025-02-07 22:57:24,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:24,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:57:24,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:24,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:57:24,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:57:24,329 INFO L87 Difference]: Start difference. First operand 2414 states and 3204 transitions. Second operand has 8 states, 8 states have (on average 34.75) internal successors, (278), 8 states have internal predecessors, (278), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 22:57:24,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:24,836 INFO L93 Difference]: Finished difference Result 4659 states and 6182 transitions. [2025-02-07 22:57:24,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:57:24,836 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.75) internal successors, (278), 8 states have internal predecessors, (278), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 353 [2025-02-07 22:57:24,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:24,842 INFO L225 Difference]: With dead ends: 4659 [2025-02-07 22:57:24,842 INFO L226 Difference]: Without dead ends: 3570 [2025-02-07 22:57:24,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:57:24,844 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 1046 mSDsluCounter, 2818 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 3515 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:24,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 3515 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:57:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3570 states. [2025-02-07 22:57:24,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3570 to 2562. [2025-02-07 22:57:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2562 states, 2506 states have (on average 1.3112529928172387) internal successors, (3286), 2506 states have internal predecessors, (3286), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-07 22:57:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 3394 transitions. [2025-02-07 22:57:24,891 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 3394 transitions. Word has length 353 [2025-02-07 22:57:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:24,891 INFO L471 AbstractCegarLoop]: Abstraction has 2562 states and 3394 transitions. [2025-02-07 22:57:24,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.75) internal successors, (278), 8 states have internal predecessors, (278), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 22:57:24,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 3394 transitions. [2025-02-07 22:57:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-02-07 22:57:24,895 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:24,895 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:57:24,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-07 22:57:24,895 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:24,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:24,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1080791528, now seen corresponding path program 1 times [2025-02-07 22:57:24,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:24,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786951701] [2025-02-07 22:57:24,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:24,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:24,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-02-07 22:57:25,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-02-07 22:57:25,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:25,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-02-07 22:57:25,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:25,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786951701] [2025-02-07 22:57:25,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786951701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:25,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:25,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:57:25,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838009060] [2025-02-07 22:57:25,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:25,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:57:25,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:25,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:57:25,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:25,377 INFO L87 Difference]: Start difference. First operand 2562 states and 3394 transitions. Second operand has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:25,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:25,797 INFO L93 Difference]: Finished difference Result 3940 states and 5208 transitions. [2025-02-07 22:57:25,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:57:25,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 353 [2025-02-07 22:57:25,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:25,803 INFO L225 Difference]: With dead ends: 3940 [2025-02-07 22:57:25,803 INFO L226 Difference]: Without dead ends: 2658 [2025-02-07 22:57:25,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:25,805 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 505 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:25,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1324 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:57:25,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2025-02-07 22:57:25,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2610. [2025-02-07 22:57:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 2554 states have (on average 1.3054032889584966) internal successors, (3334), 2554 states have internal predecessors, (3334), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-07 22:57:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 3442 transitions. [2025-02-07 22:57:25,850 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 3442 transitions. Word has length 353 [2025-02-07 22:57:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:25,851 INFO L471 AbstractCegarLoop]: Abstraction has 2610 states and 3442 transitions. [2025-02-07 22:57:25,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 3442 transitions. [2025-02-07 22:57:25,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-02-07 22:57:25,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:25,855 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-07 22:57:25,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-07 22:57:25,855 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:25,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:25,855 INFO L85 PathProgramCache]: Analyzing trace with hash -853023263, now seen corresponding path program 1 times [2025-02-07 22:57:25,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:25,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448969735] [2025-02-07 22:57:25,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:25,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:25,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-02-07 22:57:26,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-02-07 22:57:26,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:26,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:30,326 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 51 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:30,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:30,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448969735] [2025-02-07 22:57:30,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448969735] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:57:30,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494644831] [2025-02-07 22:57:30,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:30,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:57:30,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:57:30,329 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:57:30,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-07 22:57:31,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-02-07 22:57:32,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-02-07 22:57:32,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:32,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:32,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 2078 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-02-07 22:57:32,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:57:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 123 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 22:57:33,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:57:34,348 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 86 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:34,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494644831] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:57:34,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 22:57:34,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 38 [2025-02-07 22:57:34,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612709083] [2025-02-07 22:57:34,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 22:57:34,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-07 22:57:34,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:34,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-07 22:57:34,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1253, Unknown=0, NotChecked=0, Total=1406 [2025-02-07 22:57:34,351 INFO L87 Difference]: Start difference. First operand 2610 states and 3442 transitions. Second operand has 38 states, 38 states have (on average 22.0) internal successors, (836), 38 states have internal predecessors, (836), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18)