./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label19.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b69dfd7ce787b4bea7f704286d79d9dc2873c99a6634157ddcd6c7ea8551fd0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:02:44,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:02:44,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:02:44,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:02:44,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:02:44,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:02:44,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:02:44,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:02:44,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:02:44,571 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:02:44,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:02:44,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:02:44,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:02:44,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:02:44,572 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:02:44,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:02:44,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:02:44,573 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:02:44,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:02:44,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:02:44,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:02:44,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:02:44,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:02:44,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:02:44,574 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:02:44,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:02:44,574 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:02:44,574 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:02:44,574 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:02:44,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:02:44,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:02:44,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:02:44,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:02:44,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:02:44,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:02:44,576 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:02:44,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:02:44,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:02:44,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:02:44,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:02:44,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:02:44,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:02:44,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:02:44,576 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b69dfd7ce787b4bea7f704286d79d9dc2873c99a6634157ddcd6c7ea8551fd0 [2025-02-05 12:02:44,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:02:44,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:02:44,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:02:44,885 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:02:44,885 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:02:44,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label19.c [2025-02-05 12:02:46,259 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dfb146691/0975b32f577e42bda8b65bd04d3ba8e7/FLAG0aeeaff4b [2025-02-05 12:02:46,827 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:02:46,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label19.c [2025-02-05 12:02:46,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dfb146691/0975b32f577e42bda8b65bd04d3ba8e7/FLAG0aeeaff4b [2025-02-05 12:02:46,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dfb146691/0975b32f577e42bda8b65bd04d3ba8e7 [2025-02-05 12:02:46,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:02:46,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:02:46,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:02:46,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:02:46,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:02:46,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:02:46" (1/1) ... [2025-02-05 12:02:46,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49e33aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:46, skipping insertion in model container [2025-02-05 12:02:46,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:02:46" (1/1) ... [2025-02-05 12:02:46,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:02:47,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label19.c[6359,6372] [2025-02-05 12:02:47,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:02:47,568 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:02:47,596 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label19.c[6359,6372] [2025-02-05 12:02:47,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:02:47,879 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:02:47,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:47 WrapperNode [2025-02-05 12:02:47,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:02:47,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:02:47,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:02:47,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:02:47,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:47" (1/1) ... [2025-02-05 12:02:47,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:47" (1/1) ... [2025-02-05 12:02:48,170 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-02-05 12:02:48,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:02:48,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:02:48,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:02:48,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:02:48,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:47" (1/1) ... [2025-02-05 12:02:48,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:47" (1/1) ... [2025-02-05 12:02:48,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:47" (1/1) ... [2025-02-05 12:02:48,454 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 12:02:48,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:47" (1/1) ... [2025-02-05 12:02:48,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:47" (1/1) ... [2025-02-05 12:02:48,567 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:47" (1/1) ... [2025-02-05 12:02:48,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:47" (1/1) ... [2025-02-05 12:02:48,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:47" (1/1) ... [2025-02-05 12:02:48,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:47" (1/1) ... [2025-02-05 12:02:48,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:02:48,656 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:02:48,656 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:02:48,657 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:02:48,658 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:47" (1/1) ... [2025-02-05 12:02:48,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:02:48,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:02:48,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 12:02:48,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 12:02:48,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:02:48,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:02:48,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:02:48,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:02:48,779 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:02:48,781 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:02:52,116 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-02-05 12:02:52,292 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-02-05 12:02:52,292 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:02:52,324 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:02:52,328 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:02:52,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:02:52 BoogieIcfgContainer [2025-02-05 12:02:52,331 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:02:52,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:02:52,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:02:52,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:02:52,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:02:46" (1/3) ... [2025-02-05 12:02:52,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6727d3ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:02:52, skipping insertion in model container [2025-02-05 12:02:52,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:47" (2/3) ... [2025-02-05 12:02:52,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6727d3ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:02:52, skipping insertion in model container [2025-02-05 12:02:52,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:02:52" (3/3) ... [2025-02-05 12:02:52,339 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label19.c [2025-02-05 12:02:52,355 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:02:52,356 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label19.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:02:52,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:02:52,445 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;@6b56fe94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:02:52,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:02:52,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:52,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 12:02:52,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:52,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:52,462 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:52,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:52,468 INFO L85 PathProgramCache]: Analyzing trace with hash -672077432, now seen corresponding path program 1 times [2025-02-05 12:02:52,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:52,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877503557] [2025-02-05 12:02:52,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:52,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:52,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 12:02:52,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 12:02:52,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:52,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:02:52,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:52,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877503557] [2025-02-05 12:02:52,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877503557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:52,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:52,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:02:52,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149358468] [2025-02-05 12:02:52,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:52,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:52,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:52,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:52,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:52,891 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:55,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:55,351 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-02-05 12:02:55,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:55,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-02-05 12:02:55,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:55,367 INFO L225 Difference]: With dead ends: 1644 [2025-02-05 12:02:55,367 INFO L226 Difference]: Without dead ends: 977 [2025-02-05 12:02:55,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:55,376 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 446 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:55,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 12:02:55,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-02-05 12:02:55,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-02-05 12:02:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:55,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-02-05 12:02:55,483 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 42 [2025-02-05 12:02:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:55,484 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-02-05 12:02:55,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-02-05 12:02:55,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 12:02:55,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:55,488 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:55,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:02:55,489 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:55,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:55,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1530901930, now seen corresponding path program 1 times [2025-02-05 12:02:55,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:55,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847290251] [2025-02-05 12:02:55,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:55,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:55,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 12:02:55,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 12:02:55,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:55,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:02:55,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:55,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847290251] [2025-02-05 12:02:55,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847290251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:55,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:55,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:02:55,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831904171] [2025-02-05 12:02:55,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:55,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:55,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:55,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:55,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:55,833 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:57,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:57,817 INFO L93 Difference]: Finished difference Result 2813 states and 4381 transitions. [2025-02-05 12:02:57,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:57,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-02-05 12:02:57,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:57,826 INFO L225 Difference]: With dead ends: 2813 [2025-02-05 12:02:57,826 INFO L226 Difference]: Without dead ends: 1844 [2025-02-05 12:02:57,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:57,829 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:57,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 580 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:02:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-02-05 12:02:57,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1841. [2025-02-05 12:02:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.35) internal successors, (2484), 1840 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2484 transitions. [2025-02-05 12:02:57,870 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2484 transitions. Word has length 109 [2025-02-05 12:02:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:57,870 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2484 transitions. [2025-02-05 12:02:57,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2484 transitions. [2025-02-05 12:02:57,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 12:02:57,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:57,873 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:57,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:02:57,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:57,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:57,874 INFO L85 PathProgramCache]: Analyzing trace with hash 783894800, now seen corresponding path program 1 times [2025-02-05 12:02:57,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:57,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329888228] [2025-02-05 12:02:57,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:57,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:57,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 12:02:57,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 12:02:57,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:57,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:02:58,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:58,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329888228] [2025-02-05 12:02:58,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329888228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:58,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:58,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:58,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003222760] [2025-02-05 12:02:58,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:58,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:58,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:58,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:58,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:58,179 INFO L87 Difference]: Start difference. First operand 1841 states and 2484 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:00,350 INFO L93 Difference]: Finished difference Result 4552 states and 6282 transitions. [2025-02-05 12:03:00,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:03:00,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-02-05 12:03:00,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:00,363 INFO L225 Difference]: With dead ends: 4552 [2025-02-05 12:03:00,364 INFO L226 Difference]: Without dead ends: 2713 [2025-02-05 12:03:00,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:00,369 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 465 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:00,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 886 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:03:00,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2025-02-05 12:03:00,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2711. [2025-02-05 12:03:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2710 states have (on average 1.3003690036900368) internal successors, (3524), 2710 states have internal predecessors, (3524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3524 transitions. [2025-02-05 12:03:00,459 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3524 transitions. Word has length 112 [2025-02-05 12:03:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:00,461 INFO L471 AbstractCegarLoop]: Abstraction has 2711 states and 3524 transitions. [2025-02-05 12:03:00,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3524 transitions. [2025-02-05 12:03:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-05 12:03:00,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:00,468 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:03:00,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:03:00,468 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:00,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:00,469 INFO L85 PathProgramCache]: Analyzing trace with hash -643099011, now seen corresponding path program 1 times [2025-02-05 12:03:00,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:00,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779193488] [2025-02-05 12:03:00,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:00,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:00,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-05 12:03:00,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-05 12:03:00,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:00,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 12:03:00,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:00,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779193488] [2025-02-05 12:03:00,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779193488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:00,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:00,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:03:00,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302892980] [2025-02-05 12:03:00,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:00,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:03:00,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:00,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:03:00,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:00,818 INFO L87 Difference]: Start difference. First operand 2711 states and 3524 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:02,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:02,623 INFO L93 Difference]: Finished difference Result 7984 states and 10361 transitions. [2025-02-05 12:03:02,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:03:02,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2025-02-05 12:03:02,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:02,641 INFO L225 Difference]: With dead ends: 7984 [2025-02-05 12:03:02,641 INFO L226 Difference]: Without dead ends: 4421 [2025-02-05 12:03:02,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:02,649 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:02,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:03:02,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4421 states. [2025-02-05 12:03:02,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4421 to 3571. [2025-02-05 12:03:02,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3571 states, 3570 states have (on average 1.1775910364145659) internal successors, (4204), 3570 states have internal predecessors, (4204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 4204 transitions. [2025-02-05 12:03:02,727 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 4204 transitions. Word has length 181 [2025-02-05 12:03:02,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:02,728 INFO L471 AbstractCegarLoop]: Abstraction has 3571 states and 4204 transitions. [2025-02-05 12:03:02,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 4204 transitions. [2025-02-05 12:03:02,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-05 12:03:02,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:02,733 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:03:02,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:03:02,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:02,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:02,734 INFO L85 PathProgramCache]: Analyzing trace with hash -350259411, now seen corresponding path program 1 times [2025-02-05 12:03:02,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:02,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409119916] [2025-02-05 12:03:02,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:02,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:02,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 12:03:02,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 12:03:02,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:02,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:02,989 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:03:02,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:02,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409119916] [2025-02-05 12:03:02,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409119916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:02,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:02,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:03:02,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235597609] [2025-02-05 12:03:02,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:02,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:03:02,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:02,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:03:02,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:02,992 INFO L87 Difference]: Start difference. First operand 3571 states and 4204 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:04,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:04,398 INFO L93 Difference]: Finished difference Result 9273 states and 11087 transitions. [2025-02-05 12:03:04,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:03:04,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2025-02-05 12:03:04,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:04,418 INFO L225 Difference]: With dead ends: 9273 [2025-02-05 12:03:04,418 INFO L226 Difference]: Without dead ends: 5704 [2025-02-05 12:03:04,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:04,425 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:04,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:03:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5704 states. [2025-02-05 12:03:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5704 to 5704. [2025-02-05 12:03:04,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5704 states, 5703 states have (on average 1.1595651411537786) internal successors, (6613), 5703 states have internal predecessors, (6613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 6613 transitions. [2025-02-05 12:03:04,520 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 6613 transitions. Word has length 194 [2025-02-05 12:03:04,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:04,521 INFO L471 AbstractCegarLoop]: Abstraction has 5704 states and 6613 transitions. [2025-02-05 12:03:04,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:04,521 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 6613 transitions. [2025-02-05 12:03:04,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 12:03:04,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:04,524 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:03:04,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:03:04,525 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:04,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:04,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1356967048, now seen corresponding path program 1 times [2025-02-05 12:03:04,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:04,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231269010] [2025-02-05 12:03:04,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:04,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:04,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 12:03:04,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 12:03:04,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:04,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 12:03:04,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:04,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231269010] [2025-02-05 12:03:04,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231269010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:04,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:04,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:03:04,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399591287] [2025-02-05 12:03:04,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:04,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:03:04,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:04,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:03:04,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:04,744 INFO L87 Difference]: Start difference. First operand 5704 states and 6613 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:06,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:06,411 INFO L93 Difference]: Finished difference Result 14376 states and 16776 transitions. [2025-02-05 12:03:06,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:03:06,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 196 [2025-02-05 12:03:06,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:06,432 INFO L225 Difference]: With dead ends: 14376 [2025-02-05 12:03:06,432 INFO L226 Difference]: Without dead ends: 8673 [2025-02-05 12:03:06,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:06,440 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 409 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:06,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 445 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:03:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8673 states. [2025-02-05 12:03:06,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8673 to 5677. [2025-02-05 12:03:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5677 states, 5676 states have (on average 1.1578576462297392) internal successors, (6572), 5676 states have internal predecessors, (6572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:06,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5677 states to 5677 states and 6572 transitions. [2025-02-05 12:03:06,545 INFO L78 Accepts]: Start accepts. Automaton has 5677 states and 6572 transitions. Word has length 196 [2025-02-05 12:03:06,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:06,546 INFO L471 AbstractCegarLoop]: Abstraction has 5677 states and 6572 transitions. [2025-02-05 12:03:06,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:06,546 INFO L276 IsEmpty]: Start isEmpty. Operand 5677 states and 6572 transitions. [2025-02-05 12:03:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-05 12:03:06,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:06,556 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:03:06,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:03:06,557 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:06,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:06,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1956974773, now seen corresponding path program 1 times [2025-02-05 12:03:06,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:06,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821495947] [2025-02-05 12:03:06,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:06,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:06,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-05 12:03:06,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-05 12:03:06,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:06,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-02-05 12:03:06,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:06,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821495947] [2025-02-05 12:03:06,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821495947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:06,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:06,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:03:06,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51829796] [2025-02-05 12:03:06,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:06,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:03:06,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:06,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:03:06,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:06,745 INFO L87 Difference]: Start difference. First operand 5677 states and 6572 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:08,508 INFO L93 Difference]: Finished difference Result 14315 states and 16680 transitions. [2025-02-05 12:03:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:03:08,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2025-02-05 12:03:08,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:08,530 INFO L225 Difference]: With dead ends: 14315 [2025-02-05 12:03:08,530 INFO L226 Difference]: Without dead ends: 7790 [2025-02-05 12:03:08,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:08,537 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 383 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:08,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 847 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:03:08,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7790 states. [2025-02-05 12:03:08,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7790 to 7790. [2025-02-05 12:03:08,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7790 states, 7789 states have (on average 1.1186288355372962) internal successors, (8713), 7789 states have internal predecessors, (8713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7790 states to 7790 states and 8713 transitions. [2025-02-05 12:03:08,646 INFO L78 Accepts]: Start accepts. Automaton has 7790 states and 8713 transitions. Word has length 274 [2025-02-05 12:03:08,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:08,647 INFO L471 AbstractCegarLoop]: Abstraction has 7790 states and 8713 transitions. [2025-02-05 12:03:08,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 7790 states and 8713 transitions. [2025-02-05 12:03:08,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-02-05 12:03:08,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:08,653 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:03:08,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:03:08,653 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:08,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:08,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1587692882, now seen corresponding path program 1 times [2025-02-05 12:03:08,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:08,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309618258] [2025-02-05 12:03:08,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:08,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:08,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-02-05 12:03:08,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-02-05 12:03:08,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:08,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-02-05 12:03:08,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:08,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309618258] [2025-02-05 12:03:08,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309618258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:08,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:08,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:03:08,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803609684] [2025-02-05 12:03:08,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:08,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:03:08,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:08,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:03:08,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:08,906 INFO L87 Difference]: Start difference. First operand 7790 states and 8713 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:10,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:10,506 INFO L93 Difference]: Finished difference Result 18559 states and 20913 transitions. [2025-02-05 12:03:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:03:10,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 314 [2025-02-05 12:03:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:10,527 INFO L225 Difference]: With dead ends: 18559 [2025-02-05 12:03:10,527 INFO L226 Difference]: Without dead ends: 10771 [2025-02-05 12:03:10,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:10,534 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 430 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:10,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 402 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:03:10,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10771 states. [2025-02-05 12:03:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10771 to 9916. [2025-02-05 12:03:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9916 states, 9915 states have (on average 1.119415027735754) internal successors, (11099), 9915 states have internal predecessors, (11099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9916 states to 9916 states and 11099 transitions. [2025-02-05 12:03:10,644 INFO L78 Accepts]: Start accepts. Automaton has 9916 states and 11099 transitions. Word has length 314 [2025-02-05 12:03:10,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:10,645 INFO L471 AbstractCegarLoop]: Abstraction has 9916 states and 11099 transitions. [2025-02-05 12:03:10,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 9916 states and 11099 transitions. [2025-02-05 12:03:10,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-02-05 12:03:10,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:10,656 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:03:10,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:03:10,656 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:10,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:10,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1324124499, now seen corresponding path program 1 times [2025-02-05 12:03:10,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:10,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013464414] [2025-02-05 12:03:10,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:10,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:10,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-02-05 12:03:10,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-02-05 12:03:10,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:10,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:11,087 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:03:11,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:11,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013464414] [2025-02-05 12:03:11,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013464414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:11,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:11,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:03:11,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356819417] [2025-02-05 12:03:11,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:11,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:03:11,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:11,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:03:11,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:03:11,090 INFO L87 Difference]: Start difference. First operand 9916 states and 11099 transitions. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:13,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:13,491 INFO L93 Difference]: Finished difference Result 26239 states and 29414 transitions. [2025-02-05 12:03:13,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:03:13,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 381 [2025-02-05 12:03:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:13,525 INFO L225 Difference]: With dead ends: 26239 [2025-02-05 12:03:13,525 INFO L226 Difference]: Without dead ends: 15900 [2025-02-05 12:03:13,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:03:13,540 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 633 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 2697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:13,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 196 Invalid, 2697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 12:03:13,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15900 states. [2025-02-05 12:03:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15900 to 15898. [2025-02-05 12:03:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15898 states, 15897 states have (on average 1.1247405170786942) internal successors, (17880), 15897 states have internal predecessors, (17880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15898 states to 15898 states and 17880 transitions. [2025-02-05 12:03:13,793 INFO L78 Accepts]: Start accepts. Automaton has 15898 states and 17880 transitions. Word has length 381 [2025-02-05 12:03:13,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:13,794 INFO L471 AbstractCegarLoop]: Abstraction has 15898 states and 17880 transitions. [2025-02-05 12:03:13,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 15898 states and 17880 transitions. [2025-02-05 12:03:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-02-05 12:03:13,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:13,806 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:03:13,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 12:03:13,806 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:13,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:13,810 INFO L85 PathProgramCache]: Analyzing trace with hash 303267118, now seen corresponding path program 1 times [2025-02-05 12:03:13,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:13,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422244561] [2025-02-05 12:03:13,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:13,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:13,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-02-05 12:03:13,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-02-05 12:03:13,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:13,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 12:03:14,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:14,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422244561] [2025-02-05 12:03:14,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422244561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:14,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:14,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:03:14,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355008006] [2025-02-05 12:03:14,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:14,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:03:14,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:14,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:03:14,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:14,070 INFO L87 Difference]: Start difference. First operand 15898 states and 17880 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:15,737 INFO L93 Difference]: Finished difference Result 44148 states and 49784 transitions. [2025-02-05 12:03:15,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:03:15,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 415 [2025-02-05 12:03:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:15,786 INFO L225 Difference]: With dead ends: 44148 [2025-02-05 12:03:15,786 INFO L226 Difference]: Without dead ends: 28252 [2025-02-05 12:03:15,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:15,806 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 497 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:15,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 287 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:03:15,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28252 states. [2025-02-05 12:03:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28252 to 27809. [2025-02-05 12:03:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27809 states, 27808 states have (on average 1.1171605293440736) internal successors, (31066), 27808 states have internal predecessors, (31066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27809 states to 27809 states and 31066 transitions. [2025-02-05 12:03:16,169 INFO L78 Accepts]: Start accepts. Automaton has 27809 states and 31066 transitions. Word has length 415 [2025-02-05 12:03:16,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:16,169 INFO L471 AbstractCegarLoop]: Abstraction has 27809 states and 31066 transitions. [2025-02-05 12:03:16,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:16,169 INFO L276 IsEmpty]: Start isEmpty. Operand 27809 states and 31066 transitions. [2025-02-05 12:03:16,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-02-05 12:03:16,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:16,179 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:03:16,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 12:03:16,180 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:16,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:16,180 INFO L85 PathProgramCache]: Analyzing trace with hash -831590644, now seen corresponding path program 1 times [2025-02-05 12:03:16,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:16,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052616091] [2025-02-05 12:03:16,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:16,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:16,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-02-05 12:03:16,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-02-05 12:03:16,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:16,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:17,933 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 79 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:03:17,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:17,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052616091] [2025-02-05 12:03:17,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052616091] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:03:17,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385807159] [2025-02-05 12:03:17,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:17,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:03:17,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:03:17,938 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:03:17,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 12:03:18,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-02-05 12:03:18,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-02-05 12:03:18,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:18,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:18,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:03:18,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:03:18,763 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 79 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:03:18,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:03:19,312 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:03:19,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385807159] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:03:19,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:03:19,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 3] total 10 [2025-02-05 12:03:19,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846220212] [2025-02-05 12:03:19,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:19,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:03:19,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:19,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:03:19,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 12:03:19,315 INFO L87 Difference]: Start difference. First operand 27809 states and 31066 transitions. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:22,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:22,113 INFO L93 Difference]: Finished difference Result 83735 states and 93626 transitions. [2025-02-05 12:03:22,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:03:22,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 428 [2025-02-05 12:03:22,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:22,196 INFO L225 Difference]: With dead ends: 83735 [2025-02-05 12:03:22,196 INFO L226 Difference]: Without dead ends: 55075 [2025-02-05 12:03:22,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 860 GetRequests, 851 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 12:03:22,227 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 712 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2327 mSolverCounterSat, 803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 3130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 803 IncrementalHoareTripleChecker+Valid, 2327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:22,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 170 Invalid, 3130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [803 Valid, 2327 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 12:03:22,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55075 states. [2025-02-05 12:03:22,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55075 to 51237. [2025-02-05 12:03:22,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51237 states, 51236 states have (on average 1.1068389413693496) internal successors, (56710), 51236 states have internal predecessors, (56710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51237 states to 51237 states and 56710 transitions. [2025-02-05 12:03:23,114 INFO L78 Accepts]: Start accepts. Automaton has 51237 states and 56710 transitions. Word has length 428 [2025-02-05 12:03:23,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:23,118 INFO L471 AbstractCegarLoop]: Abstraction has 51237 states and 56710 transitions. [2025-02-05 12:03:23,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:23,119 INFO L276 IsEmpty]: Start isEmpty. Operand 51237 states and 56710 transitions. [2025-02-05 12:03:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-02-05 12:03:23,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:23,136 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:03:23,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 12:03:23,337 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,SelfDestructingSolverStorable10 [2025-02-05 12:03:23,338 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:23,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash -933356117, now seen corresponding path program 1 times [2025-02-05 12:03:23,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:23,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756541455] [2025-02-05 12:03:23,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:23,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:23,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-02-05 12:03:23,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-02-05 12:03:23,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:23,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:03:23,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:23,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756541455] [2025-02-05 12:03:23,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756541455] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:23,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:23,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:03:23,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97440056] [2025-02-05 12:03:23,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:23,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:03:23,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:23,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:03:23,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:03:23,964 INFO L87 Difference]: Start difference. First operand 51237 states and 56710 transitions. Second operand has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:26,433 INFO L93 Difference]: Finished difference Result 119501 states and 132258 transitions. [2025-02-05 12:03:26,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:03:26,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 477 [2025-02-05 12:03:26,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:26,511 INFO L225 Difference]: With dead ends: 119501 [2025-02-05 12:03:26,512 INFO L226 Difference]: Without dead ends: 68266 [2025-02-05 12:03:26,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:03:26,556 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 897 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:26,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 320 Invalid, 2238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 1867 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:03:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68266 states. [2025-02-05 12:03:27,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68266 to 61447. [2025-02-05 12:03:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61447 states, 61446 states have (on average 1.1070858965595807) internal successors, (68026), 61446 states have internal predecessors, (68026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:27,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61447 states to 61447 states and 68026 transitions. [2025-02-05 12:03:27,573 INFO L78 Accepts]: Start accepts. Automaton has 61447 states and 68026 transitions. Word has length 477 [2025-02-05 12:03:27,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:27,574 INFO L471 AbstractCegarLoop]: Abstraction has 61447 states and 68026 transitions. [2025-02-05 12:03:27,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 61447 states and 68026 transitions. [2025-02-05 12:03:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-02-05 12:03:27,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:27,584 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:03:27,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 12:03:27,584 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:27,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:27,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1976517235, now seen corresponding path program 1 times [2025-02-05 12:03:27,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:27,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613615729] [2025-02-05 12:03:27,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:27,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:27,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-02-05 12:03:27,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-02-05 12:03:27,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:27,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-02-05 12:03:27,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:27,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613615729] [2025-02-05 12:03:27,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613615729] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:27,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:27,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:03:27,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209932082] [2025-02-05 12:03:27,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:27,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:03:27,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:27,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:03:27,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:27,799 INFO L87 Difference]: Start difference. First operand 61447 states and 68026 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:29,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:29,493 INFO L93 Difference]: Finished difference Result 120334 states and 133047 transitions. [2025-02-05 12:03:29,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:03:29,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 485 [2025-02-05 12:03:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:29,571 INFO L225 Difference]: With dead ends: 120334 [2025-02-05 12:03:29,571 INFO L226 Difference]: Without dead ends: 58889 [2025-02-05 12:03:29,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:29,613 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 453 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:29,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 322 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:03:29,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58889 states. [2025-02-05 12:03:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58889 to 54633. [2025-02-05 12:03:30,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54633 states, 54632 states have (on average 1.1071533167374432) internal successors, (60486), 54632 states have internal predecessors, (60486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54633 states to 54633 states and 60486 transitions. [2025-02-05 12:03:30,553 INFO L78 Accepts]: Start accepts. Automaton has 54633 states and 60486 transitions. Word has length 485 [2025-02-05 12:03:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:30,554 INFO L471 AbstractCegarLoop]: Abstraction has 54633 states and 60486 transitions. [2025-02-05 12:03:30,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 54633 states and 60486 transitions. [2025-02-05 12:03:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-02-05 12:03:30,564 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:30,564 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:03:30,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 12:03:30,565 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:30,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:30,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1597689294, now seen corresponding path program 1 times [2025-02-05 12:03:30,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:30,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246265213] [2025-02-05 12:03:30,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:30,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:30,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-02-05 12:03:30,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-02-05 12:03:30,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:30,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-02-05 12:03:31,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:31,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246265213] [2025-02-05 12:03:31,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246265213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:31,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:31,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:03:31,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064513468] [2025-02-05 12:03:31,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:31,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:03:31,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:31,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:03:31,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:31,190 INFO L87 Difference]: Start difference. First operand 54633 states and 60486 transitions. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:32,726 INFO L93 Difference]: Finished difference Result 110542 states and 122307 transitions. [2025-02-05 12:03:32,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:03:32,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 502 [2025-02-05 12:03:32,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:32,816 INFO L225 Difference]: With dead ends: 110542 [2025-02-05 12:03:32,817 INFO L226 Difference]: Without dead ends: 55911 [2025-02-05 12:03:32,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:32,849 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 127 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:32,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 839 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 12:03:32,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55911 states. [2025-02-05 12:03:33,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55911 to 55909. [2025-02-05 12:03:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55909 states, 55908 states have (on average 1.1046540745510482) internal successors, (61759), 55908 states have internal predecessors, (61759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:33,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55909 states to 55909 states and 61759 transitions. [2025-02-05 12:03:33,638 INFO L78 Accepts]: Start accepts. Automaton has 55909 states and 61759 transitions. Word has length 502 [2025-02-05 12:03:33,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:33,638 INFO L471 AbstractCegarLoop]: Abstraction has 55909 states and 61759 transitions. [2025-02-05 12:03:33,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:33,638 INFO L276 IsEmpty]: Start isEmpty. Operand 55909 states and 61759 transitions. [2025-02-05 12:03:33,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-02-05 12:03:33,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:33,648 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:03:33,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 12:03:33,648 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:33,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:33,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1605139226, now seen corresponding path program 1 times [2025-02-05 12:03:33,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:33,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724090455] [2025-02-05 12:03:33,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:33,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:33,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-02-05 12:03:33,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-02-05 12:03:33,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:33,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:34,331 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 12:03:34,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:34,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724090455] [2025-02-05 12:03:34,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724090455] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:03:34,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468623680] [2025-02-05 12:03:34,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:34,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:03:34,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:03:34,334 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:03:34,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 12:03:34,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-02-05 12:03:34,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-02-05 12:03:34,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:34,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:34,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:03:34,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:03:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 12:03:34,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:03:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 12:03:34,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468623680] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:03:34,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:03:34,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-02-05 12:03:34,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772983828] [2025-02-05 12:03:34,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:34,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:03:34,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:34,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:03:34,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:03:34,879 INFO L87 Difference]: Start difference. First operand 55909 states and 61759 transitions. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:37,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:37,357 INFO L93 Difference]: Finished difference Result 126723 states and 139743 transitions. [2025-02-05 12:03:37,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:03:37,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 507 [2025-02-05 12:03:37,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:37,431 INFO L225 Difference]: With dead ends: 126723 [2025-02-05 12:03:37,431 INFO L226 Difference]: Without dead ends: 70388 [2025-02-05 12:03:37,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1015 GetRequests, 1011 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:03:37,467 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 843 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 2314 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 2757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:37,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 201 Invalid, 2757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2314 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:03:37,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70388 states. [2025-02-05 12:03:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70388 to 63586. [2025-02-05 12:03:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63586 states, 63585 states have (on average 1.1042069670519776) internal successors, (70211), 63585 states have internal predecessors, (70211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63586 states to 63586 states and 70211 transitions. [2025-02-05 12:03:38,535 INFO L78 Accepts]: Start accepts. Automaton has 63586 states and 70211 transitions. Word has length 507 [2025-02-05 12:03:38,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:38,536 INFO L471 AbstractCegarLoop]: Abstraction has 63586 states and 70211 transitions. [2025-02-05 12:03:38,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:38,536 INFO L276 IsEmpty]: Start isEmpty. Operand 63586 states and 70211 transitions. [2025-02-05 12:03:38,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-02-05 12:03:38,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:38,546 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:03:38,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 12:03:38,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 12:03:38,747 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:38,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:38,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1632861824, now seen corresponding path program 1 times [2025-02-05 12:03:38,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:38,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820851392] [2025-02-05 12:03:38,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:38,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:38,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-02-05 12:03:38,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-02-05 12:03:38,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:38,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 266 proven. 82 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 12:03:39,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:39,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820851392] [2025-02-05 12:03:39,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820851392] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:03:39,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593274399] [2025-02-05 12:03:39,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:39,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:03:39,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:03:39,800 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:03:39,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 12:03:39,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-02-05 12:03:39,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-02-05 12:03:39,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:39,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:39,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 12:03:39,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:03:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 266 proven. 82 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 12:03:40,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:03:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 266 proven. 82 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 12:03:41,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593274399] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 12:03:41,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 12:03:41,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-02-05 12:03:41,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053370651] [2025-02-05 12:03:41,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 12:03:41,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 12:03:41,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:41,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 12:03:41,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 12:03:41,495 INFO L87 Difference]: Start difference. First operand 63586 states and 70211 transitions. Second operand has 10 states, 10 states have (on average 87.2) internal successors, (872), 9 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:48,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:48,866 INFO L93 Difference]: Finished difference Result 149327 states and 164897 transitions. [2025-02-05 12:03:48,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 12:03:48,866 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 87.2) internal successors, (872), 9 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 533 [2025-02-05 12:03:48,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:48,973 INFO L225 Difference]: With dead ends: 149327 [2025-02-05 12:03:48,973 INFO L226 Difference]: Without dead ends: 84893 [2025-02-05 12:03:49,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1074 GetRequests, 1061 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-02-05 12:03:49,001 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 5483 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 9048 mSolverCounterSat, 1214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5483 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 10262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1214 IncrementalHoareTripleChecker+Valid, 9048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:49,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5483 Valid, 483 Invalid, 10262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1214 Valid, 9048 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2025-02-05 12:03:49,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84893 states. [2025-02-05 12:03:49,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84893 to 75905. [2025-02-05 12:03:49,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75905 states, 75904 states have (on average 1.1027613827993255) internal successors, (83704), 75904 states have internal predecessors, (83704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:49,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75905 states to 75905 states and 83704 transitions. [2025-02-05 12:03:49,750 INFO L78 Accepts]: Start accepts. Automaton has 75905 states and 83704 transitions. Word has length 533 [2025-02-05 12:03:49,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:49,750 INFO L471 AbstractCegarLoop]: Abstraction has 75905 states and 83704 transitions. [2025-02-05 12:03:49,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.2) internal successors, (872), 9 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:49,750 INFO L276 IsEmpty]: Start isEmpty. Operand 75905 states and 83704 transitions. [2025-02-05 12:03:49,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-02-05 12:03:49,760 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:49,761 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:03:49,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 12:03:49,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:03:49,961 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:49,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:49,962 INFO L85 PathProgramCache]: Analyzing trace with hash -364576373, now seen corresponding path program 1 times [2025-02-05 12:03:49,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:49,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998101256] [2025-02-05 12:03:49,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:49,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:50,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-02-05 12:03:50,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-02-05 12:03:50,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:50,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 545 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-02-05 12:03:50,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:50,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998101256] [2025-02-05 12:03:50,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998101256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:50,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:50,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:03:50,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107288788] [2025-02-05 12:03:50,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:50,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:03:50,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:50,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:03:50,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:50,397 INFO L87 Difference]: Start difference. First operand 75905 states and 83704 transitions. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:52,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:52,202 INFO L93 Difference]: Finished difference Result 162422 states and 178343 transitions. [2025-02-05 12:03:52,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:03:52,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 608 [2025-02-05 12:03:52,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:52,297 INFO L225 Difference]: With dead ends: 162422 [2025-02-05 12:03:52,297 INFO L226 Difference]: Without dead ends: 83109 [2025-02-05 12:03:52,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:52,337 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 447 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:52,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 562 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:03:52,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83109 states. [2025-02-05 12:03:53,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83109 to 77573. [2025-02-05 12:03:53,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77573 states, 77572 states have (on average 1.0836899912339504) internal successors, (84064), 77572 states have internal predecessors, (84064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77573 states to 77573 states and 84064 transitions. [2025-02-05 12:03:53,151 INFO L78 Accepts]: Start accepts. Automaton has 77573 states and 84064 transitions. Word has length 608 [2025-02-05 12:03:53,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:53,152 INFO L471 AbstractCegarLoop]: Abstraction has 77573 states and 84064 transitions. [2025-02-05 12:03:53,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:53,152 INFO L276 IsEmpty]: Start isEmpty. Operand 77573 states and 84064 transitions. [2025-02-05 12:03:53,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2025-02-05 12:03:53,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:53,161 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:03:53,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 12:03:53,161 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:53,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:53,161 INFO L85 PathProgramCache]: Analyzing trace with hash -697655370, now seen corresponding path program 1 times [2025-02-05 12:03:53,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:53,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066887964] [2025-02-05 12:03:53,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:53,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:53,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-02-05 12:03:53,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-02-05 12:03:53,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:53,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-05 12:03:54,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:54,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066887964] [2025-02-05 12:03:54,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066887964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:54,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:54,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:03:54,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624372343] [2025-02-05 12:03:54,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:54,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:03:54,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:54,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:03:54,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:54,187 INFO L87 Difference]: Start difference. First operand 77573 states and 84064 transitions. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:55,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:55,459 INFO L93 Difference]: Finished difference Result 154717 states and 167697 transitions. [2025-02-05 12:03:55,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:03:55,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 609 [2025-02-05 12:03:55,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:55,543 INFO L225 Difference]: With dead ends: 154717 [2025-02-05 12:03:55,543 INFO L226 Difference]: Without dead ends: 77571 [2025-02-05 12:03:55,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:55,585 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 567 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:55,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 538 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 12:03:55,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77571 states. [2025-02-05 12:03:56,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77571 to 77570. [2025-02-05 12:03:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77570 states, 77569 states have (on average 1.0835385269888744) internal successors, (84049), 77569 states have internal predecessors, (84049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77570 states to 77570 states and 84049 transitions. [2025-02-05 12:03:56,647 INFO L78 Accepts]: Start accepts. Automaton has 77570 states and 84049 transitions. Word has length 609 [2025-02-05 12:03:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:56,648 INFO L471 AbstractCegarLoop]: Abstraction has 77570 states and 84049 transitions. [2025-02-05 12:03:56,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 77570 states and 84049 transitions. [2025-02-05 12:03:56,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2025-02-05 12:03:56,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:56,665 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:03:56,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 12:03:56,665 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:56,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash 531308290, now seen corresponding path program 1 times [2025-02-05 12:03:56,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:56,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082228935] [2025-02-05 12:03:56,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:56,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:56,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 613 statements into 1 equivalence classes. [2025-02-05 12:03:56,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 613 of 613 statements. [2025-02-05 12:03:56,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:56,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat