./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label34.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_label34.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 c371ce1f15a8888766c33a9703b06847f70d6274570c9b062f0d05b5c6caa625 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:04:21,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:04:21,555 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:04:21,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:04:21,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:04:21,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:04:21,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:04:21,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:04:21,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:04:21,596 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:04:21,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:04:21,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:04:21,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:04:21,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:04:21,598 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:04:21,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:04:21,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:04:21,599 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:04:21,599 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:04:21,599 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:04:21,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:04:21,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:04:21,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:04:21,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:04:21,600 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:04:21,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:04:21,600 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:04:21,600 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:04:21,600 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:04:21,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:04:21,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:04:21,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:04:21,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:04:21,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:04:21,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:04:21,602 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:04:21,602 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:04:21,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:04:21,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:04:21,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:04:21,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:04:21,602 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:04:21,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:04:21,602 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 -> c371ce1f15a8888766c33a9703b06847f70d6274570c9b062f0d05b5c6caa625 [2025-02-05 12:04:21,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:04:21,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:04:21,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:04:21,884 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:04:21,884 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:04:21,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label34.c [2025-02-05 12:04:23,110 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6e2b292a/43af4464fa954c7bad8ca122f07da352/FLAGe5b465004 [2025-02-05 12:04:23,602 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:04:23,603 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label34.c [2025-02-05 12:04:23,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6e2b292a/43af4464fa954c7bad8ca122f07da352/FLAGe5b465004 [2025-02-05 12:04:23,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6e2b292a/43af4464fa954c7bad8ca122f07da352 [2025-02-05 12:04:23,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:04:23,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:04:23,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:04:23,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:04:23,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:04:23,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:04:23" (1/1) ... [2025-02-05 12:04:23,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad79e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:23, skipping insertion in model container [2025-02-05 12:04:23,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:04:23" (1/1) ... [2025-02-05 12:04:23,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:04:23,924 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_label34.c[2983,2996] [2025-02-05 12:04:24,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:04:24,371 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:04:24,385 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_label34.c[2983,2996] [2025-02-05 12:04:24,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:04:24,665 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:04:24,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:24 WrapperNode [2025-02-05 12:04:24,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:04:24,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:04:24,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:04:24,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:04:24,674 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:04:24" (1/1) ... [2025-02-05 12:04:24,720 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:04:24" (1/1) ... [2025-02-05 12:04:24,987 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-02-05 12:04:24,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:04:24,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:04:24,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:04:24,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:04:24,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:24" (1/1) ... [2025-02-05 12:04:24,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:24" (1/1) ... [2025-02-05 12:04:25,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:24" (1/1) ... [2025-02-05 12:04:25,302 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:04:25,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:24" (1/1) ... [2025-02-05 12:04:25,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:24" (1/1) ... [2025-02-05 12:04:25,484 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:24" (1/1) ... [2025-02-05 12:04:25,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:24" (1/1) ... [2025-02-05 12:04:25,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:24" (1/1) ... [2025-02-05 12:04:25,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:24" (1/1) ... [2025-02-05 12:04:25,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:04:25,594 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:04:25,594 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:04:25,594 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:04:25,595 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:24" (1/1) ... [2025-02-05 12:04:25,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:04:25,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:04:25,629 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:04:25,634 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:04:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:04:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:04:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:04:25,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:04:25,726 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:04:25,728 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:04:29,274 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-02-05 12:04:29,395 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-02-05 12:04:29,395 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:04:29,429 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:04:29,431 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:04:29,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:04:29 BoogieIcfgContainer [2025-02-05 12:04:29,432 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:04:29,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:04:29,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:04:29,441 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:04:29,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:04:23" (1/3) ... [2025-02-05 12:04:29,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfa0fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:04:29, skipping insertion in model container [2025-02-05 12:04:29,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:24" (2/3) ... [2025-02-05 12:04:29,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfa0fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:04:29, skipping insertion in model container [2025-02-05 12:04:29,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:04:29" (3/3) ... [2025-02-05 12:04:29,445 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label34.c [2025-02-05 12:04:29,461 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:04:29,463 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label34.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:04:29,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:04:29,562 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;@7c807556, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:04:29,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:04:29,572 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:04:29,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 12:04:29,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:29,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:29,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:29,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:29,586 INFO L85 PathProgramCache]: Analyzing trace with hash 755126714, now seen corresponding path program 1 times [2025-02-05 12:04:29,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:29,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253343229] [2025-02-05 12:04:29,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:29,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:29,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 12:04:29,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 12:04:29,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:29,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:29,843 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:04:29,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:29,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253343229] [2025-02-05 12:04:29,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253343229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:29,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:29,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:04:29,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270441613] [2025-02-05 12:04:29,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:29,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:29,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:29,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:29,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:29,876 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 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:04:32,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:32,380 INFO L93 Difference]: Finished difference Result 1642 states and 3021 transitions. [2025-02-05 12:04:32,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:32,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-02-05 12:04:32,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:32,400 INFO L225 Difference]: With dead ends: 1642 [2025-02-05 12:04:32,401 INFO L226 Difference]: Without dead ends: 975 [2025-02-05 12:04:32,406 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:04:32,409 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 471 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:32,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 551 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 12:04:32,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-02-05 12:04:32,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972. [2025-02-05 12:04:32,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have 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:04:32,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions. [2025-02-05 12:04:32,507 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 19 [2025-02-05 12:04:32,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:32,508 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions. [2025-02-05 12:04:32,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:04:32,508 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions. [2025-02-05 12:04:32,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 12:04:32,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:32,511 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:32,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:04:32,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:32,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:32,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1986629265, now seen corresponding path program 1 times [2025-02-05 12:04:32,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:32,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697525715] [2025-02-05 12:04:32,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:32,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:32,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 12:04:32,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 12:04:32,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:32,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:04:33,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:33,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697525715] [2025-02-05 12:04:33,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697525715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:33,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:33,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:33,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974850877] [2025-02-05 12:04:33,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:33,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:04:33,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:33,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:04:33,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:04:33,190 INFO L87 Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have 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:04:36,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:36,795 INFO L93 Difference]: Finished difference Result 3735 states and 5654 transitions. [2025-02-05 12:04:36,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:04:36,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-02-05 12:04:36,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:36,807 INFO L225 Difference]: With dead ends: 3735 [2025-02-05 12:04:36,807 INFO L226 Difference]: Without dead ends: 2765 [2025-02-05 12:04:36,810 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:04:36,811 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 899 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2826 mSolverCounterSat, 590 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 3416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 590 IncrementalHoareTripleChecker+Valid, 2826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:36,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 313 Invalid, 3416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [590 Valid, 2826 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-02-05 12:04:36,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2025-02-05 12:04:36,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 2724. [2025-02-05 12:04:36,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2724 states, 2723 states have (on average 1.3944179214102093) internal successors, (3797), 2723 states have internal predecessors, (3797), 0 states have call successors, (0), 0 states have 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:04:36,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2724 states and 3797 transitions. [2025-02-05 12:04:36,892 INFO L78 Accepts]: Start accepts. Automaton has 2724 states and 3797 transitions. Word has length 89 [2025-02-05 12:04:36,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:36,893 INFO L471 AbstractCegarLoop]: Abstraction has 2724 states and 3797 transitions. [2025-02-05 12:04:36,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have 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:04:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 3797 transitions. [2025-02-05 12:04:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 12:04:36,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:36,901 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 12:04:36,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:04:36,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:36,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:36,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1911969857, now seen corresponding path program 1 times [2025-02-05 12:04:36,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:36,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034287365] [2025-02-05 12:04:36,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:36,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:36,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 12:04:36,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 12:04:36,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:36,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:04:37,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:37,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034287365] [2025-02-05 12:04:37,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034287365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:37,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:37,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:04:37,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138855565] [2025-02-05 12:04:37,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:37,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:37,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:37,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:37,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:37,365 INFO L87 Difference]: Start difference. First operand 2724 states and 3797 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have 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:04:39,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:39,556 INFO L93 Difference]: Finished difference Result 6731 states and 9407 transitions. [2025-02-05 12:04:39,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:39,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-02-05 12:04:39,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:39,575 INFO L225 Difference]: With dead ends: 6731 [2025-02-05 12:04:39,576 INFO L226 Difference]: Without dead ends: 4009 [2025-02-05 12:04:39,584 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:04:39,586 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 331 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:39,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 564 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:04:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2025-02-05 12:04:39,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 4005. [2025-02-05 12:04:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4005 states, 4004 states have (on average 1.2987012987012987) internal successors, (5200), 4004 states have internal predecessors, (5200), 0 states have call successors, (0), 0 states have 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:04:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4005 states to 4005 states and 5200 transitions. [2025-02-05 12:04:39,667 INFO L78 Accepts]: Start accepts. Automaton has 4005 states and 5200 transitions. Word has length 124 [2025-02-05 12:04:39,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:39,669 INFO L471 AbstractCegarLoop]: Abstraction has 4005 states and 5200 transitions. [2025-02-05 12:04:39,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have 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:04:39,670 INFO L276 IsEmpty]: Start isEmpty. Operand 4005 states and 5200 transitions. [2025-02-05 12:04:39,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 12:04:39,675 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:39,675 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 12:04:39,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:04:39,675 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:39,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:39,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1433134994, now seen corresponding path program 1 times [2025-02-05 12:04:39,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:39,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564147408] [2025-02-05 12:04:39,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:39,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:39,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 12:04:39,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 12:04:39,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:39,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:04:40,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:40,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564147408] [2025-02-05 12:04:40,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564147408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:40,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:40,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:40,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462176795] [2025-02-05 12:04:40,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:40,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:04:40,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:40,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:04:40,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:04:40,304 INFO L87 Difference]: Start difference. First operand 4005 states and 5200 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have 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:04:42,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:42,424 INFO L93 Difference]: Finished difference Result 8433 states and 10835 transitions. [2025-02-05 12:04:42,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:04:42,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-02-05 12:04:42,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:42,443 INFO L225 Difference]: With dead ends: 8433 [2025-02-05 12:04:42,444 INFO L226 Difference]: Without dead ends: 4430 [2025-02-05 12:04:42,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:04:42,453 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 530 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:42,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 855 Invalid, 1960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:04:42,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4430 states. [2025-02-05 12:04:42,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4430 to 4430. [2025-02-05 12:04:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4430 states, 4429 states have (on average 1.2713930909911944) internal successors, (5631), 4429 states have internal predecessors, (5631), 0 states have call successors, (0), 0 states have 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:04:42,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4430 states to 4430 states and 5631 transitions. [2025-02-05 12:04:42,545 INFO L78 Accepts]: Start accepts. Automaton has 4430 states and 5631 transitions. Word has length 130 [2025-02-05 12:04:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:42,545 INFO L471 AbstractCegarLoop]: Abstraction has 4430 states and 5631 transitions. [2025-02-05 12:04:42,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have 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:04:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4430 states and 5631 transitions. [2025-02-05 12:04:42,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 12:04:42,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:42,551 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:42,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:04:42,551 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:42,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:42,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1461386836, now seen corresponding path program 1 times [2025-02-05 12:04:42,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:42,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82584357] [2025-02-05 12:04:42,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:42,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:42,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 12:04:42,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 12:04:42,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:42,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-02-05 12:04:42,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:42,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82584357] [2025-02-05 12:04:42,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82584357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:42,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:42,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:04:42,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320994918] [2025-02-05 12:04:42,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:42,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:42,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:42,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:42,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:42,799 INFO L87 Difference]: Start difference. First operand 4430 states and 5631 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:04:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:44,849 INFO L93 Difference]: Finished difference Result 11421 states and 14862 transitions. [2025-02-05 12:04:44,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:44,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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 160 [2025-02-05 12:04:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:44,870 INFO L225 Difference]: With dead ends: 11421 [2025-02-05 12:04:44,871 INFO L226 Difference]: Without dead ends: 6133 [2025-02-05 12:04:44,878 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:04:44,879 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:44,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:04:44,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2025-02-05 12:04:44,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 5280. [2025-02-05 12:04:44,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5280 states, 5279 states have (on average 1.1882932373555597) internal successors, (6273), 5279 states have internal predecessors, (6273), 0 states have call successors, (0), 0 states have 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:04:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5280 states to 5280 states and 6273 transitions. [2025-02-05 12:04:44,967 INFO L78 Accepts]: Start accepts. Automaton has 5280 states and 6273 transitions. Word has length 160 [2025-02-05 12:04:44,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:44,967 INFO L471 AbstractCegarLoop]: Abstraction has 5280 states and 6273 transitions. [2025-02-05 12:04:44,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:04:44,968 INFO L276 IsEmpty]: Start isEmpty. Operand 5280 states and 6273 transitions. [2025-02-05 12:04:44,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 12:04:44,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:44,970 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:44,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:04:44,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:44,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:44,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1286503706, now seen corresponding path program 1 times [2025-02-05 12:04:44,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:44,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256825138] [2025-02-05 12:04:44,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:44,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:44,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 12:04:45,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 12:04:45,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:45,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 12:04:45,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:45,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256825138] [2025-02-05 12:04:45,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256825138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:45,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:45,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:45,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246833285] [2025-02-05 12:04:45,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:45,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:45,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:45,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:45,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:45,102 INFO L87 Difference]: Start difference. First operand 5280 states and 6273 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have 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:04:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:46,973 INFO L93 Difference]: Finished difference Result 13108 states and 15826 transitions. [2025-02-05 12:04:46,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:46,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2025-02-05 12:04:46,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:46,997 INFO L225 Difference]: With dead ends: 13108 [2025-02-05 12:04:46,997 INFO L226 Difference]: Without dead ends: 7830 [2025-02-05 12:04:47,005 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:04:47,005 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 441 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:47,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 477 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:04:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7830 states. [2025-02-05 12:04:47,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7830 to 5257. [2025-02-05 12:04:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5257 states, 5256 states have (on average 1.1868340943683409) internal successors, (6238), 5256 states have internal predecessors, (6238), 0 states have call successors, (0), 0 states have 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:04:47,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 6238 transitions. [2025-02-05 12:04:47,129 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 6238 transitions. Word has length 173 [2025-02-05 12:04:47,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:47,129 INFO L471 AbstractCegarLoop]: Abstraction has 5257 states and 6238 transitions. [2025-02-05 12:04:47,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have 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:04:47,131 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 6238 transitions. [2025-02-05 12:04:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-05 12:04:47,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:47,133 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:47,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:04:47,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:47,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:47,134 INFO L85 PathProgramCache]: Analyzing trace with hash -628835924, now seen corresponding path program 1 times [2025-02-05 12:04:47,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:47,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795671263] [2025-02-05 12:04:47,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:47,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:47,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-05 12:04:47,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-05 12:04:47,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:47,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:04:47,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:47,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795671263] [2025-02-05 12:04:47,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795671263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:47,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:47,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 12:04:47,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817855481] [2025-02-05 12:04:47,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:47,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 12:04:47,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:47,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 12:04:47,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:04:47,484 INFO L87 Difference]: Start difference. First operand 5257 states and 6238 transitions. Second operand has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have 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:04:49,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:49,663 INFO L93 Difference]: Finished difference Result 13507 states and 16329 transitions. [2025-02-05 12:04:49,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:04:49,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 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 180 [2025-02-05 12:04:49,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:49,686 INFO L225 Difference]: With dead ends: 13507 [2025-02-05 12:04:49,686 INFO L226 Difference]: Without dead ends: 8252 [2025-02-05 12:04:49,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:04:49,693 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 1073 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 700 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 2567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 700 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:49,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 855 Invalid, 2567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [700 Valid, 1867 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:04:49,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8252 states. [2025-02-05 12:04:49,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8252 to 8239. [2025-02-05 12:04:49,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8239 states, 8238 states have (on average 1.1714008254430688) internal successors, (9650), 8238 states have internal predecessors, (9650), 0 states have call successors, (0), 0 states have 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:04:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8239 states to 8239 states and 9650 transitions. [2025-02-05 12:04:49,845 INFO L78 Accepts]: Start accepts. Automaton has 8239 states and 9650 transitions. Word has length 180 [2025-02-05 12:04:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:49,846 INFO L471 AbstractCegarLoop]: Abstraction has 8239 states and 9650 transitions. [2025-02-05 12:04:49,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have 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:04:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 8239 states and 9650 transitions. [2025-02-05 12:04:49,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-05 12:04:49,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:49,849 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:49,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:04:49,854 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:49,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:49,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1284813297, now seen corresponding path program 1 times [2025-02-05 12:04:49,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:49,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453894929] [2025-02-05 12:04:49,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:49,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:49,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-05 12:04:49,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-05 12:04:49,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:49,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 172 proven. 70 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 12:04:50,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:50,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453894929] [2025-02-05 12:04:50,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453894929] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:04:50,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81795818] [2025-02-05 12:04:50,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:50,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:04:50,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:04:50,258 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:04:50,261 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:04:50,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-05 12:04:50,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-05 12:04:50,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:50,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:50,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:04:50,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:04:50,647 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 172 proven. 70 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 12:04:50,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:04:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 12:04:50,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81795818] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:04:50,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:04:50,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-02-05 12:04:50,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162608382] [2025-02-05 12:04:50,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:50,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:04:50,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:50,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:04:50,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:04:50,942 INFO L87 Difference]: Start difference. First operand 8239 states and 9650 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have 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:04:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:53,999 INFO L93 Difference]: Finished difference Result 25016 states and 29831 transitions. [2025-02-05 12:04:53,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:04:54,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 243 [2025-02-05 12:04:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:54,037 INFO L225 Difference]: With dead ends: 25016 [2025-02-05 12:04:54,037 INFO L226 Difference]: Without dead ends: 16347 [2025-02-05 12:04:54,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 483 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:04:54,047 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 1071 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2242 mSolverCounterSat, 1228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 3470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1228 IncrementalHoareTripleChecker+Valid, 2242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:54,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 146 Invalid, 3470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1228 Valid, 2242 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 12:04:54,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16347 states. [2025-02-05 12:04:54,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16347 to 16345. [2025-02-05 12:04:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16345 states, 16344 states have (on average 1.1751713166911404) internal successors, (19207), 16344 states have internal predecessors, (19207), 0 states have call successors, (0), 0 states have 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:04:54,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16345 states to 16345 states and 19207 transitions. [2025-02-05 12:04:54,257 INFO L78 Accepts]: Start accepts. Automaton has 16345 states and 19207 transitions. Word has length 243 [2025-02-05 12:04:54,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:54,258 INFO L471 AbstractCegarLoop]: Abstraction has 16345 states and 19207 transitions. [2025-02-05 12:04:54,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have 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:04:54,261 INFO L276 IsEmpty]: Start isEmpty. Operand 16345 states and 19207 transitions. [2025-02-05 12:04:54,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-02-05 12:04:54,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:54,264 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:54,274 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:04:54,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:04:54,466 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:54,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:54,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1174278473, now seen corresponding path program 1 times [2025-02-05 12:04:54,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:54,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264917798] [2025-02-05 12:04:54,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:54,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:54,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-02-05 12:04:54,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-02-05 12:04:54,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:54,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-05 12:04:54,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264917798] [2025-02-05 12:04:54,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264917798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:54,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:54,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:54,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292962966] [2025-02-05 12:04:54,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:54,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:54,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:54,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:54,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:54,696 INFO L87 Difference]: Start difference. First operand 16345 states and 19207 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have 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:04:56,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:56,581 INFO L93 Difference]: Finished difference Result 35664 states and 42121 transitions. [2025-02-05 12:04:56,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:56,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 256 [2025-02-05 12:04:56,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:56,629 INFO L225 Difference]: With dead ends: 35664 [2025-02-05 12:04:56,629 INFO L226 Difference]: Without dead ends: 18895 [2025-02-05 12:04:56,646 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:04:56,647 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 372 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:56,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 905 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:04:56,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18895 states. [2025-02-05 12:04:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18895 to 18895. [2025-02-05 12:04:56,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18895 states, 18894 states have (on average 1.1532761723298401) internal successors, (21790), 18894 states have internal predecessors, (21790), 0 states have call successors, (0), 0 states have 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:04:56,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18895 states to 18895 states and 21790 transitions. [2025-02-05 12:04:56,958 INFO L78 Accepts]: Start accepts. Automaton has 18895 states and 21790 transitions. Word has length 256 [2025-02-05 12:04:56,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:56,958 INFO L471 AbstractCegarLoop]: Abstraction has 18895 states and 21790 transitions. [2025-02-05 12:04:56,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have 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:04:56,959 INFO L276 IsEmpty]: Start isEmpty. Operand 18895 states and 21790 transitions. [2025-02-05 12:04:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-02-05 12:04:56,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:56,963 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:56,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 12:04:56,963 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:56,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:56,964 INFO L85 PathProgramCache]: Analyzing trace with hash 52959148, now seen corresponding path program 1 times [2025-02-05 12:04:56,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:56,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809077983] [2025-02-05 12:04:56,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:56,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:56,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-05 12:04:57,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-05 12:04:57,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:57,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:57,228 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:04:57,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:57,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809077983] [2025-02-05 12:04:57,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809077983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:57,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:57,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:57,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240091027] [2025-02-05 12:04:57,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:57,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:57,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:57,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:57,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:57,231 INFO L87 Difference]: Start difference. First operand 18895 states and 21790 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have 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:04:58,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:58,949 INFO L93 Difference]: Finished difference Result 40770 states and 47074 transitions. [2025-02-05 12:04:58,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:58,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 257 [2025-02-05 12:04:58,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:58,986 INFO L225 Difference]: With dead ends: 40770 [2025-02-05 12:04:58,986 INFO L226 Difference]: Without dead ends: 21452 [2025-02-05 12:04:59,008 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:04:59,009 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 422 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:59,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 906 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:04:59,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21452 states. [2025-02-05 12:04:59,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21452 to 21448. [2025-02-05 12:04:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21448 states, 21447 states have (on average 1.140998741082669) internal successors, (24471), 21447 states have internal predecessors, (24471), 0 states have call successors, (0), 0 states have 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:04:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21448 states to 21448 states and 24471 transitions. [2025-02-05 12:04:59,374 INFO L78 Accepts]: Start accepts. Automaton has 21448 states and 24471 transitions. Word has length 257 [2025-02-05 12:04:59,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:59,375 INFO L471 AbstractCegarLoop]: Abstraction has 21448 states and 24471 transitions. [2025-02-05 12:04:59,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have 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:04:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 21448 states and 24471 transitions. [2025-02-05 12:04:59,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-02-05 12:04:59,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:59,380 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:04:59,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 12:04:59,381 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:59,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:59,382 INFO L85 PathProgramCache]: Analyzing trace with hash 115362515, now seen corresponding path program 1 times [2025-02-05 12:04:59,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:59,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818543538] [2025-02-05 12:04:59,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:59,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:59,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-02-05 12:04:59,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-02-05 12:04:59,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:59,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:59,555 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-02-05 12:04:59,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:59,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818543538] [2025-02-05 12:04:59,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818543538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:59,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:59,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:59,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237527830] [2025-02-05 12:04:59,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:59,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:59,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:59,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:59,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:59,559 INFO L87 Difference]: Start difference. First operand 21448 states and 24471 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:05:01,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:01,481 INFO L93 Difference]: Finished difference Result 54800 states and 62359 transitions. [2025-02-05 12:05:01,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:01,482 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 291 [2025-02-05 12:05:01,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:01,539 INFO L225 Difference]: With dead ends: 54800 [2025-02-05 12:05:01,540 INFO L226 Difference]: Without dead ends: 32921 [2025-02-05 12:05:01,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:01,562 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 450 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:01,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 420 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:05:01,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32921 states. [2025-02-05 12:05:01,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32921 to 30366. [2025-02-05 12:05:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30366 states, 30365 states have (on average 1.1215214885559033) internal successors, (34055), 30365 states have internal predecessors, (34055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:02,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30366 states to 30366 states and 34055 transitions. [2025-02-05 12:05:02,103 INFO L78 Accepts]: Start accepts. Automaton has 30366 states and 34055 transitions. Word has length 291 [2025-02-05 12:05:02,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:02,104 INFO L471 AbstractCegarLoop]: Abstraction has 30366 states and 34055 transitions. [2025-02-05 12:05:02,104 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:05:02,104 INFO L276 IsEmpty]: Start isEmpty. Operand 30366 states and 34055 transitions. [2025-02-05 12:05:02,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-02-05 12:05:02,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:02,111 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:05:02,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 12:05:02,112 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:02,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:02,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1954805063, now seen corresponding path program 1 times [2025-02-05 12:05:02,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:02,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54135899] [2025-02-05 12:05:02,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:02,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:02,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-05 12:05:02,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-05 12:05:02,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:02,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:02,435 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-02-05 12:05:02,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:02,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54135899] [2025-02-05 12:05:02,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54135899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:02,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:02,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:02,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286479142] [2025-02-05 12:05:02,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:02,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:02,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:02,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:02,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:02,441 INFO L87 Difference]: Start difference. First operand 30366 states and 34055 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:04,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:04,419 INFO L93 Difference]: Finished difference Result 70516 states and 79430 transitions. [2025-02-05 12:05:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:04,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 309 [2025-02-05 12:05:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:04,559 INFO L225 Difference]: With dead ends: 70516 [2025-02-05 12:05:04,559 INFO L226 Difference]: Without dead ends: 38875 [2025-02-05 12:05:04,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:04,585 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 342 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:04,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 776 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:05:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38875 states. [2025-02-05 12:05:05,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38875 to 37598. [2025-02-05 12:05:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37598 states, 37597 states have (on average 1.1054073463308243) internal successors, (41560), 37597 states have internal predecessors, (41560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37598 states to 37598 states and 41560 transitions. [2025-02-05 12:05:05,112 INFO L78 Accepts]: Start accepts. Automaton has 37598 states and 41560 transitions. Word has length 309 [2025-02-05 12:05:05,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:05,112 INFO L471 AbstractCegarLoop]: Abstraction has 37598 states and 41560 transitions. [2025-02-05 12:05:05,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:05,112 INFO L276 IsEmpty]: Start isEmpty. Operand 37598 states and 41560 transitions. [2025-02-05 12:05:05,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-02-05 12:05:05,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:05,117 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:05:05,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 12:05:05,118 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:05,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:05,119 INFO L85 PathProgramCache]: Analyzing trace with hash -946902864, now seen corresponding path program 1 times [2025-02-05 12:05:05,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:05,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068989432] [2025-02-05 12:05:05,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:05,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:05,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-02-05 12:05:05,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-02-05 12:05:05,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:05,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:05,658 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 313 proven. 73 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-05 12:05:05,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:05,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068989432] [2025-02-05 12:05:05,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068989432] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:05:05,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917900832] [2025-02-05 12:05:05,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:05,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:05:05,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:05:05,662 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:05:05,663 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:05:05,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-02-05 12:05:05,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-02-05 12:05:05,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:05,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:05,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:05:05,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:05:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 313 proven. 73 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-05 12:05:06,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:05:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-05 12:05:06,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917900832] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:05:06,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:05:06,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-02-05 12:05:06,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744078163] [2025-02-05 12:05:06,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:06,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:05:06,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:06,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:05:06,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:05:06,271 INFO L87 Difference]: Start difference. First operand 37598 states and 41560 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:09,120 INFO L93 Difference]: Finished difference Result 90106 states and 99744 transitions. [2025-02-05 12:05:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:05:09,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 317 [2025-02-05 12:05:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:09,206 INFO L225 Difference]: With dead ends: 90106 [2025-02-05 12:05:09,206 INFO L226 Difference]: Without dead ends: 52083 [2025-02-05 12:05:09,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 631 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:05:09,259 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 841 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:09,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 187 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 12:05:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52083 states. [2025-02-05 12:05:10,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52083 to 49530. [2025-02-05 12:05:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49530 states, 49529 states have (on average 1.1097942619475458) internal successors, (54967), 49529 states have internal predecessors, (54967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:10,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49530 states to 49530 states and 54967 transitions. [2025-02-05 12:05:10,402 INFO L78 Accepts]: Start accepts. Automaton has 49530 states and 54967 transitions. Word has length 317 [2025-02-05 12:05:10,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:10,402 INFO L471 AbstractCegarLoop]: Abstraction has 49530 states and 54967 transitions. [2025-02-05 12:05:10,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:10,402 INFO L276 IsEmpty]: Start isEmpty. Operand 49530 states and 54967 transitions. [2025-02-05 12:05:10,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-02-05 12:05:10,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:10,410 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-05 12:05:10,418 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:05:10,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:05:10,611 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:10,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:10,612 INFO L85 PathProgramCache]: Analyzing trace with hash -943785365, now seen corresponding path program 1 times [2025-02-05 12:05:10,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:10,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746717168] [2025-02-05 12:05:10,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:10,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:10,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-02-05 12:05:10,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-02-05 12:05:10,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:10,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:10,963 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-02-05 12:05:10,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:10,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746717168] [2025-02-05 12:05:10,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746717168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:10,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:10,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:10,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923364639] [2025-02-05 12:05:10,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:10,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:10,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:10,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:10,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:10,967 INFO L87 Difference]: Start difference. First operand 49530 states and 54967 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:13,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:13,270 INFO L93 Difference]: Finished difference Result 119530 states and 132324 transitions. [2025-02-05 12:05:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:13,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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:05:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:13,355 INFO L225 Difference]: With dead ends: 119530 [2025-02-05 12:05:13,355 INFO L226 Difference]: Without dead ends: 69576 [2025-02-05 12:05:13,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:13,393 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 472 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:13,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 348 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:05:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69576 states. [2025-02-05 12:05:14,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69576 to 68262. [2025-02-05 12:05:14,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68262 states, 68261 states have (on average 1.102034836876108) internal successors, (75226), 68261 states have internal predecessors, (75226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68262 states to 68262 states and 75226 transitions. [2025-02-05 12:05:14,400 INFO L78 Accepts]: Start accepts. Automaton has 68262 states and 75226 transitions. Word has length 415 [2025-02-05 12:05:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:14,401 INFO L471 AbstractCegarLoop]: Abstraction has 68262 states and 75226 transitions. [2025-02-05 12:05:14,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 68262 states and 75226 transitions. [2025-02-05 12:05:14,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-02-05 12:05:14,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:14,410 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-05 12:05:14,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 12:05:14,411 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:14,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:14,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1778970971, now seen corresponding path program 1 times [2025-02-05 12:05:14,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:14,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126361954] [2025-02-05 12:05:14,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:14,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:14,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-02-05 12:05:14,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-02-05 12:05:14,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:14,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:14,738 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-02-05 12:05:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:14,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126361954] [2025-02-05 12:05:14,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126361954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:14,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:14,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:14,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858478387] [2025-02-05 12:05:14,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:14,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:14,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:14,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:14,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:14,743 INFO L87 Difference]: Start difference. First operand 68262 states and 75226 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:16,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:16,699 INFO L93 Difference]: Finished difference Result 150999 states and 166544 transitions. [2025-02-05 12:05:16,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:16,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 442 [2025-02-05 12:05:16,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:16,818 INFO L225 Difference]: With dead ends: 150999 [2025-02-05 12:05:16,819 INFO L226 Difference]: Without dead ends: 82313 [2025-02-05 12:05:16,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:16,841 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 489 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:16,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 301 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:05:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82313 states. [2025-02-05 12:05:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82313 to 63131. [2025-02-05 12:05:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63131 states, 63130 states have (on average 1.1038333597338825) internal successors, (69685), 63130 states have internal predecessors, (69685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63131 states to 63131 states and 69685 transitions. [2025-02-05 12:05:17,889 INFO L78 Accepts]: Start accepts. Automaton has 63131 states and 69685 transitions. Word has length 442 [2025-02-05 12:05:17,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:17,891 INFO L471 AbstractCegarLoop]: Abstraction has 63131 states and 69685 transitions. [2025-02-05 12:05:17,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:17,891 INFO L276 IsEmpty]: Start isEmpty. Operand 63131 states and 69685 transitions. [2025-02-05 12:05:17,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-02-05 12:05:17,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:17,907 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:05:17,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 12:05:17,907 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:17,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:17,913 INFO L85 PathProgramCache]: Analyzing trace with hash 81844504, now seen corresponding path program 1 times [2025-02-05 12:05:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:17,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552681804] [2025-02-05 12:05:17,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:17,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-02-05 12:05:18,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-02-05 12:05:18,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:18,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-02-05 12:05:18,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:18,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552681804] [2025-02-05 12:05:18,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552681804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:18,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:18,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:18,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317371281] [2025-02-05 12:05:18,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:18,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:18,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:18,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:18,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:18,485 INFO L87 Difference]: Start difference. First operand 63131 states and 69685 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:20,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:20,233 INFO L93 Difference]: Finished difference Result 138608 states and 153016 transitions. [2025-02-05 12:05:20,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:20,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 454 [2025-02-05 12:05:20,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:20,308 INFO L225 Difference]: With dead ends: 138608 [2025-02-05 12:05:20,309 INFO L226 Difference]: Without dead ends: 75047 [2025-02-05 12:05:20,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:20,343 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 502 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:20,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 169 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:05:20,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75047 states. [2025-02-05 12:05:21,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75047 to 72053. [2025-02-05 12:05:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72053 states, 72052 states have (on average 1.1038000333092766) internal successors, (79531), 72052 states have internal predecessors, (79531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72053 states to 72053 states and 79531 transitions. [2025-02-05 12:05:21,365 INFO L78 Accepts]: Start accepts. Automaton has 72053 states and 79531 transitions. Word has length 454 [2025-02-05 12:05:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:21,365 INFO L471 AbstractCegarLoop]: Abstraction has 72053 states and 79531 transitions. [2025-02-05 12:05:21,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 72053 states and 79531 transitions. [2025-02-05 12:05:21,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-02-05 12:05:21,379 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:21,379 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:05:21,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 12:05:21,380 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:21,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:21,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1909482236, now seen corresponding path program 1 times [2025-02-05 12:05:21,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:21,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656428604] [2025-02-05 12:05:21,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:21,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:21,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-02-05 12:05:21,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-02-05 12:05:21,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:21,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:22,240 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:05:22,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:22,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656428604] [2025-02-05 12:05:22,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656428604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:22,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:22,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:05:22,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568292028] [2025-02-05 12:05:22,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:22,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:05:22,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:22,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:05:22,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:05:22,244 INFO L87 Difference]: Start difference. First operand 72053 states and 79531 transitions. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:25,347 INFO L93 Difference]: Finished difference Result 169680 states and 187335 transitions. [2025-02-05 12:05:25,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:05:25,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 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 475 [2025-02-05 12:05:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:25,440 INFO L225 Difference]: With dead ends: 169680 [2025-02-05 12:05:25,440 INFO L226 Difference]: Without dead ends: 97629 [2025-02-05 12:05:25,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:05:25,460 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 646 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 2800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:25,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 166 Invalid, 2800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 12:05:25,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97629 states. [2025-02-05 12:05:26,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97629 to 92089. [2025-02-05 12:05:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92089 states, 92088 states have (on average 1.1053991833898011) internal successors, (101794), 92088 states have internal predecessors, (101794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:26,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92089 states to 92089 states and 101794 transitions. [2025-02-05 12:05:26,507 INFO L78 Accepts]: Start accepts. Automaton has 92089 states and 101794 transitions. Word has length 475 [2025-02-05 12:05:26,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:26,508 INFO L471 AbstractCegarLoop]: Abstraction has 92089 states and 101794 transitions. [2025-02-05 12:05:26,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:26,508 INFO L276 IsEmpty]: Start isEmpty. Operand 92089 states and 101794 transitions. [2025-02-05 12:05:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-02-05 12:05:26,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:26,523 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:05:26,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 12:05:26,523 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:26,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:26,524 INFO L85 PathProgramCache]: Analyzing trace with hash -259791740, now seen corresponding path program 1 times [2025-02-05 12:05:26,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:26,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435627203] [2025-02-05 12:05:26,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:26,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:26,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-02-05 12:05:26,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-02-05 12:05:26,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:26,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:27,577 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 263 proven. 82 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 12:05:27,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:27,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435627203] [2025-02-05 12:05:27,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435627203] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:05:27,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555180031] [2025-02-05 12:05:27,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:27,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:05:27,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:05:27,581 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:05:27,583 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:05:27,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-02-05 12:05:27,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-02-05 12:05:27,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:27,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:27,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 12:05:27,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:05:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 263 proven. 82 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 12:05:28,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:05:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 263 proven. 82 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 12:05:30,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555180031] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 12:05:30,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 12:05:30,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-02-05 12:05:30,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523945259] [2025-02-05 12:05:30,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 12:05:30,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 12:05:30,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:30,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 12:05:30,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:05:30,438 INFO L87 Difference]: Start difference. First operand 92089 states and 101794 transitions. Second operand has 8 states, 8 states have (on average 120.75) internal successors, (966), 7 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)