./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label54.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/Problem13_label54.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 49ff6ba228d081d26cec6b087caf15954318cb178107abc089cabcbe5599946d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:47:16,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:47:16,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:47:16,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:47:16,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:47:16,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:47:16,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:47:16,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:47:16,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:47:16,503 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:47:16,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:47:16,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:47:16,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:47:16,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:47:16,504 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:47:16,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:47:16,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:47:16,504 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:47:16,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:47:16,504 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:47:16,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:47:16,504 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:47:16,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:47:16,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:47:16,504 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:47:16,504 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:47:16,504 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:47:16,504 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:47:16,504 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:47:16,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:47:16,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:47:16,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:47:16,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:47:16,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:47:16,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:47:16,508 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:47:16,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:47:16,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:47:16,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:47:16,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:47:16,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:47:16,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:47:16,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:47:16,509 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 -> 49ff6ba228d081d26cec6b087caf15954318cb178107abc089cabcbe5599946d [2025-02-05 11:47:16,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:47:16,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:47:16,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:47:16,776 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:47:16,777 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:47:16,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label54.c [2025-02-05 11:47:17,988 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50520a8c5/79f9d82b166e4debb73e291394787631/FLAGe3c4712e1 [2025-02-05 11:47:18,467 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:47:18,467 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label54.c [2025-02-05 11:47:18,500 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50520a8c5/79f9d82b166e4debb73e291394787631/FLAGe3c4712e1 [2025-02-05 11:47:18,516 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50520a8c5/79f9d82b166e4debb73e291394787631 [2025-02-05 11:47:18,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:47:18,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:47:18,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:47:18,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:47:18,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:47:18,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:47:18" (1/1) ... [2025-02-05 11:47:18,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@612d52d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:18, skipping insertion in model container [2025-02-05 11:47:18,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:47:18" (1/1) ... [2025-02-05 11:47:18,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:47:18,774 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/Problem13_label54.c[4044,4057] [2025-02-05 11:47:19,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:47:19,462 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:47:19,475 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/Problem13_label54.c[4044,4057] [2025-02-05 11:47:19,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:47:19,965 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:47:19,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:19 WrapperNode [2025-02-05 11:47:19,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:47:19,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:47:19,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:47:19,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:47:19,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:19" (1/1) ... [2025-02-05 11:47:20,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:19" (1/1) ... [2025-02-05 11:47:20,502 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-02-05 11:47:20,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:47:20,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:47:20,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:47:20,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:47:20,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:19" (1/1) ... [2025-02-05 11:47:20,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:19" (1/1) ... [2025-02-05 11:47:20,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:19" (1/1) ... [2025-02-05 11:47:20,927 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 11:47:20,928 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:19" (1/1) ... [2025-02-05 11:47:20,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:19" (1/1) ... [2025-02-05 11:47:21,064 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:19" (1/1) ... [2025-02-05 11:47:21,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:19" (1/1) ... [2025-02-05 11:47:21,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:19" (1/1) ... [2025-02-05 11:47:21,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:19" (1/1) ... [2025-02-05 11:47:21,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:47:21,168 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:47:21,168 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:47:21,168 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:47:21,169 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:19" (1/1) ... [2025-02-05 11:47:21,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:47:21,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:47:21,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:47:21,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:47:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:47:21,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:47:21,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:47:21,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:47:21,274 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:47:21,276 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:47:25,660 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-02-05 11:47:25,660 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:47:25,660 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:47:25,908 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-02-05 11:47:25,908 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:47:25,928 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:47:25,928 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:47:25,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:47:25 BoogieIcfgContainer [2025-02-05 11:47:25,928 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:47:25,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:47:25,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:47:25,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:47:25,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:47:18" (1/3) ... [2025-02-05 11:47:25,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32222073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:47:25, skipping insertion in model container [2025-02-05 11:47:25,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:47:19" (2/3) ... [2025-02-05 11:47:25,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32222073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:47:25, skipping insertion in model container [2025-02-05 11:47:25,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:47:25" (3/3) ... [2025-02-05 11:47:25,935 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label54.c [2025-02-05 11:47:25,952 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:47:25,955 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label54.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:47:26,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:47:26,034 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;@5489e314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:47:26,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:47:26,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 11:47:26,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:26,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:26,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:26,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:26,052 INFO L85 PathProgramCache]: Analyzing trace with hash -464790741, now seen corresponding path program 1 times [2025-02-05 11:47:26,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:26,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59149181] [2025-02-05 11:47:26,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:26,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:26,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 11:47:26,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 11:47:26,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:26,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:47:26,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:26,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59149181] [2025-02-05 11:47:26,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59149181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:26,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:26,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:47:26,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045362590] [2025-02-05 11:47:26,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:26,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:26,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:26,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:26,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:26,317 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:29,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:29,766 INFO L93 Difference]: Finished difference Result 3147 states and 5803 transitions. [2025-02-05 11:47:29,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:29,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-05 11:47:29,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:29,791 INFO L225 Difference]: With dead ends: 3147 [2025-02-05 11:47:29,791 INFO L226 Difference]: Without dead ends: 1964 [2025-02-05 11:47:29,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:29,803 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 1152 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:29,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 987 Invalid, 3298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 11:47:29,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2025-02-05 11:47:29,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1951. [2025-02-05 11:47:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1950 states have (on average 1.6538461538461537) internal successors, (3225), 1950 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 3225 transitions. [2025-02-05 11:47:29,915 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 3225 transitions. Word has length 27 [2025-02-05 11:47:29,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:29,915 INFO L471 AbstractCegarLoop]: Abstraction has 1951 states and 3225 transitions. [2025-02-05 11:47:29,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 3225 transitions. [2025-02-05 11:47:29,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 11:47:29,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:29,917 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:29,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:47:29,918 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:29,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:29,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1599221092, now seen corresponding path program 1 times [2025-02-05 11:47:29,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:29,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270610275] [2025-02-05 11:47:29,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:29,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:29,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 11:47:29,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 11:47:29,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:29,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:47:30,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:30,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270610275] [2025-02-05 11:47:30,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270610275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:30,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:30,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:47:30,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635036904] [2025-02-05 11:47:30,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:30,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:30,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:30,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:30,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:30,168 INFO L87 Difference]: Start difference. First operand 1951 states and 3225 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:33,444 INFO L93 Difference]: Finished difference Result 5542 states and 9222 transitions. [2025-02-05 11:47:33,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:33,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-02-05 11:47:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:33,456 INFO L225 Difference]: With dead ends: 5542 [2025-02-05 11:47:33,456 INFO L226 Difference]: Without dead ends: 3593 [2025-02-05 11:47:33,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:33,460 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 924 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:33,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1010 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [749 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 11:47:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2025-02-05 11:47:33,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 3581. [2025-02-05 11:47:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3581 states, 3580 states have (on average 1.5050279329608938) internal successors, (5388), 3580 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:33,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 5388 transitions. [2025-02-05 11:47:33,513 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 5388 transitions. Word has length 98 [2025-02-05 11:47:33,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:33,513 INFO L471 AbstractCegarLoop]: Abstraction has 3581 states and 5388 transitions. [2025-02-05 11:47:33,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:33,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 5388 transitions. [2025-02-05 11:47:33,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 11:47:33,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:33,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:33,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:47:33,515 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:33,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:33,516 INFO L85 PathProgramCache]: Analyzing trace with hash -476970101, now seen corresponding path program 1 times [2025-02-05 11:47:33,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:33,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189864139] [2025-02-05 11:47:33,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:33,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:33,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 11:47:33,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 11:47:33,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:33,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:47:33,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:33,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189864139] [2025-02-05 11:47:33,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189864139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:33,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:33,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:47:33,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547875007] [2025-02-05 11:47:33,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:33,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:33,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:33,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:33,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:33,700 INFO L87 Difference]: Start difference. First operand 3581 states and 5388 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:36,615 INFO L93 Difference]: Finished difference Result 10352 states and 15625 transitions. [2025-02-05 11:47:36,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:36,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-02-05 11:47:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:36,642 INFO L225 Difference]: With dead ends: 10352 [2025-02-05 11:47:36,642 INFO L226 Difference]: Without dead ends: 6773 [2025-02-05 11:47:36,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:36,649 INFO L435 NwaCegarLoop]: 1020 mSDtfsCounter, 785 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:36,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1171 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 11:47:36,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2025-02-05 11:47:36,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6749. [2025-02-05 11:47:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6749 states, 6748 states have (on average 1.3252815649081209) internal successors, (8943), 6748 states have internal predecessors, (8943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:36,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6749 states to 6749 states and 8943 transitions. [2025-02-05 11:47:36,727 INFO L78 Accepts]: Start accepts. Automaton has 6749 states and 8943 transitions. Word has length 112 [2025-02-05 11:47:36,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:36,728 INFO L471 AbstractCegarLoop]: Abstraction has 6749 states and 8943 transitions. [2025-02-05 11:47:36,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 6749 states and 8943 transitions. [2025-02-05 11:47:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 11:47:36,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:36,732 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:36,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:47:36,733 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:36,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:36,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1871513790, now seen corresponding path program 1 times [2025-02-05 11:47:36,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:36,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278362654] [2025-02-05 11:47:36,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:36,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:36,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 11:47:36,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 11:47:36,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:36,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:36,958 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:47:36,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:36,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278362654] [2025-02-05 11:47:36,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278362654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:36,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:36,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:47:36,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954166838] [2025-02-05 11:47:36,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:36,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:36,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:36,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:36,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:36,960 INFO L87 Difference]: Start difference. First operand 6749 states and 8943 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:40,438 INFO L93 Difference]: Finished difference Result 19873 states and 26320 transitions. [2025-02-05 11:47:40,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:40,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-02-05 11:47:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:40,475 INFO L225 Difference]: With dead ends: 19873 [2025-02-05 11:47:40,475 INFO L226 Difference]: Without dead ends: 13126 [2025-02-05 11:47:40,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:40,486 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 901 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 2878 mSolverCounterSat, 554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 3432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 554 IncrementalHoareTripleChecker+Valid, 2878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:40,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 610 Invalid, 3432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [554 Valid, 2878 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-05 11:47:40,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13126 states. [2025-02-05 11:47:40,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13126 to 13114. [2025-02-05 11:47:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13114 states, 13113 states have (on average 1.2756806222832304) internal successors, (16728), 13113 states have internal predecessors, (16728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:40,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13114 states to 13114 states and 16728 transitions. [2025-02-05 11:47:40,679 INFO L78 Accepts]: Start accepts. Automaton has 13114 states and 16728 transitions. Word has length 141 [2025-02-05 11:47:40,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:40,680 INFO L471 AbstractCegarLoop]: Abstraction has 13114 states and 16728 transitions. [2025-02-05 11:47:40,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:40,680 INFO L276 IsEmpty]: Start isEmpty. Operand 13114 states and 16728 transitions. [2025-02-05 11:47:40,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 11:47:40,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:40,684 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:40,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:47:40,684 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:40,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:40,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1614309454, now seen corresponding path program 1 times [2025-02-05 11:47:40,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:40,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046320853] [2025-02-05 11:47:40,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:40,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:40,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 11:47:40,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 11:47:40,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:40,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:41,144 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 11:47:41,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:41,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046320853] [2025-02-05 11:47:41,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046320853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:41,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:41,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:47:41,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436044110] [2025-02-05 11:47:41,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:41,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:41,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:41,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:41,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:41,145 INFO L87 Difference]: Start difference. First operand 13114 states and 16728 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:43,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:43,363 INFO L93 Difference]: Finished difference Result 25439 states and 32642 transitions. [2025-02-05 11:47:43,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:43,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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 219 [2025-02-05 11:47:43,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:43,412 INFO L225 Difference]: With dead ends: 25439 [2025-02-05 11:47:43,412 INFO L226 Difference]: Without dead ends: 13114 [2025-02-05 11:47:43,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:43,428 INFO L435 NwaCegarLoop]: 1085 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2532 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:43,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1214 Invalid, 2546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2532 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 11:47:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13114 states. [2025-02-05 11:47:43,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13114 to 13114. [2025-02-05 11:47:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13114 states, 13113 states have (on average 1.2745367192862045) internal successors, (16713), 13113 states have internal predecessors, (16713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:43,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13114 states to 13114 states and 16713 transitions. [2025-02-05 11:47:43,705 INFO L78 Accepts]: Start accepts. Automaton has 13114 states and 16713 transitions. Word has length 219 [2025-02-05 11:47:43,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:43,705 INFO L471 AbstractCegarLoop]: Abstraction has 13114 states and 16713 transitions. [2025-02-05 11:47:43,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 13114 states and 16713 transitions. [2025-02-05 11:47:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-02-05 11:47:43,711 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:43,711 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:43,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:47:43,711 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:43,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:43,712 INFO L85 PathProgramCache]: Analyzing trace with hash -665354718, now seen corresponding path program 1 times [2025-02-05 11:47:43,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:43,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196676470] [2025-02-05 11:47:43,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:43,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:43,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-05 11:47:43,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-05 11:47:43,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:43,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:43,945 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-02-05 11:47:43,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:43,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196676470] [2025-02-05 11:47:43,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196676470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:43,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:43,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:47:43,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831380727] [2025-02-05 11:47:43,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:43,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:43,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:43,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:43,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:43,951 INFO L87 Difference]: Start difference. First operand 13114 states and 16713 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:47,392 INFO L93 Difference]: Finished difference Result 36461 states and 47014 transitions. [2025-02-05 11:47:47,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:47,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 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 224 [2025-02-05 11:47:47,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:47,440 INFO L225 Difference]: With dead ends: 36461 [2025-02-05 11:47:47,440 INFO L226 Difference]: Without dead ends: 24136 [2025-02-05 11:47:47,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:47,455 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 859 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 3184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:47,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1002 Invalid, 3184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 11:47:47,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24136 states. [2025-02-05 11:47:47,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24136 to 24130. [2025-02-05 11:47:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24130 states, 24129 states have (on average 1.2018318206307763) internal successors, (28999), 24129 states have internal predecessors, (28999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24130 states to 24130 states and 28999 transitions. [2025-02-05 11:47:47,696 INFO L78 Accepts]: Start accepts. Automaton has 24130 states and 28999 transitions. Word has length 224 [2025-02-05 11:47:47,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:47,697 INFO L471 AbstractCegarLoop]: Abstraction has 24130 states and 28999 transitions. [2025-02-05 11:47:47,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 24130 states and 28999 transitions. [2025-02-05 11:47:47,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-02-05 11:47:47,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:47,701 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:47,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:47:47,701 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:47,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:47,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2115164884, now seen corresponding path program 1 times [2025-02-05 11:47:47,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:47,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374111734] [2025-02-05 11:47:47,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:47,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:47,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-05 11:47:47,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-05 11:47:47,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:47,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:47:47,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:47,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374111734] [2025-02-05 11:47:47,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374111734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:47,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:47,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:47:47,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491331212] [2025-02-05 11:47:47,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:47,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:47,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:47,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:47,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:47,841 INFO L87 Difference]: Start difference. First operand 24130 states and 28999 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:51,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:51,077 INFO L93 Difference]: Finished difference Result 59287 states and 72726 transitions. [2025-02-05 11:47:51,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:51,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2025-02-05 11:47:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:51,120 INFO L225 Difference]: With dead ends: 59287 [2025-02-05 11:47:51,121 INFO L226 Difference]: Without dead ends: 35946 [2025-02-05 11:47:51,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:51,136 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 861 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:51,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 940 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:47:51,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35946 states. [2025-02-05 11:47:51,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35946 to 35936. [2025-02-05 11:47:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35936 states, 35935 states have (on average 1.1812995686656462) internal successors, (42450), 35935 states have internal predecessors, (42450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35936 states to 35936 states and 42450 transitions. [2025-02-05 11:47:51,427 INFO L78 Accepts]: Start accepts. Automaton has 35936 states and 42450 transitions. Word has length 226 [2025-02-05 11:47:51,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:51,428 INFO L471 AbstractCegarLoop]: Abstraction has 35936 states and 42450 transitions. [2025-02-05 11:47:51,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 35936 states and 42450 transitions. [2025-02-05 11:47:51,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-02-05 11:47:51,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:51,431 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:47:51,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:47:51,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:51,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:51,432 INFO L85 PathProgramCache]: Analyzing trace with hash 629663560, now seen corresponding path program 1 times [2025-02-05 11:47:51,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:51,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170587736] [2025-02-05 11:47:51,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:51,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:51,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-02-05 11:47:51,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-02-05 11:47:51,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:51,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:47:51,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:51,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170587736] [2025-02-05 11:47:51,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170587736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:51,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:51,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:47:51,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967313362] [2025-02-05 11:47:51,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:51,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:51,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:51,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:51,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:51,537 INFO L87 Difference]: Start difference. First operand 35936 states and 42450 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:54,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:54,513 INFO L93 Difference]: Finished difference Result 70139 states and 83044 transitions. [2025-02-05 11:47:54,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:54,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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 241 [2025-02-05 11:47:54,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:54,575 INFO L225 Difference]: With dead ends: 70139 [2025-02-05 11:47:54,575 INFO L226 Difference]: Without dead ends: 34992 [2025-02-05 11:47:54,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:54,591 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 1037 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:54,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1648 Invalid, 2952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:47:54,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34992 states. [2025-02-05 11:47:54,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34992 to 34200. [2025-02-05 11:47:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34200 states, 34199 states have (on average 1.1258808737097576) internal successors, (38504), 34199 states have internal predecessors, (38504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34200 states to 34200 states and 38504 transitions. [2025-02-05 11:47:54,888 INFO L78 Accepts]: Start accepts. Automaton has 34200 states and 38504 transitions. Word has length 241 [2025-02-05 11:47:54,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:54,889 INFO L471 AbstractCegarLoop]: Abstraction has 34200 states and 38504 transitions. [2025-02-05 11:47:54,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:54,890 INFO L276 IsEmpty]: Start isEmpty. Operand 34200 states and 38504 transitions. [2025-02-05 11:47:54,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-02-05 11:47:54,894 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:54,894 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:54,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:47:54,894 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:54,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:54,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2076446178, now seen corresponding path program 1 times [2025-02-05 11:47:54,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:54,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532620483] [2025-02-05 11:47:54,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:54,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:54,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-05 11:47:54,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-05 11:47:54,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:54,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:55,108 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 11:47:55,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:55,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532620483] [2025-02-05 11:47:55,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532620483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:55,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:55,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:47:55,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636806569] [2025-02-05 11:47:55,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:55,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:47:55,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:55,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:47:55,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:47:55,110 INFO L87 Difference]: Start difference. First operand 34200 states and 38504 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:48:01,129 INFO L93 Difference]: Finished difference Result 119764 states and 135159 transitions. [2025-02-05 11:48:01,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:48:01,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 315 [2025-02-05 11:48:01,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:48:01,236 INFO L225 Difference]: With dead ends: 119764 [2025-02-05 11:48:01,236 INFO L226 Difference]: Without dead ends: 86353 [2025-02-05 11:48:01,269 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 11:48:01,270 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 1717 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 6005 mSolverCounterSat, 1098 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1717 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 7103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1098 IncrementalHoareTripleChecker+Valid, 6005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:48:01,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1717 Valid, 772 Invalid, 7103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1098 Valid, 6005 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-02-05 11:48:01,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86353 states. [2025-02-05 11:48:02,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86353 to 84654. [2025-02-05 11:48:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84654 states, 84653 states have (on average 1.1138648364499781) internal successors, (94292), 84653 states have internal predecessors, (94292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84654 states to 84654 states and 94292 transitions. [2025-02-05 11:48:02,539 INFO L78 Accepts]: Start accepts. Automaton has 84654 states and 94292 transitions. Word has length 315 [2025-02-05 11:48:02,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:48:02,543 INFO L471 AbstractCegarLoop]: Abstraction has 84654 states and 94292 transitions. [2025-02-05 11:48:02,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand 84654 states and 94292 transitions. [2025-02-05 11:48:02,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-02-05 11:48:02,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:48:02,550 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:48:02,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:48:02,550 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:48:02,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:48:02,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1753588306, now seen corresponding path program 1 times [2025-02-05 11:48:02,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:48:02,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750158944] [2025-02-05 11:48:02,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:48:02,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:48:02,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-02-05 11:48:02,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-02-05 11:48:02,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:48:02,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:48:03,041 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 11:48:03,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:48:03,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750158944] [2025-02-05 11:48:03,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750158944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:48:03,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:48:03,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:48:03,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751172749] [2025-02-05 11:48:03,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:48:03,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:48:03,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:48:03,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:48:03,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:48:03,048 INFO L87 Difference]: Start difference. First operand 84654 states and 94292 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:48:06,874 INFO L93 Difference]: Finished difference Result 170127 states and 189425 transitions. [2025-02-05 11:48:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:48:06,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 324 [2025-02-05 11:48:06,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:48:06,981 INFO L225 Difference]: With dead ends: 170127 [2025-02-05 11:48:06,981 INFO L226 Difference]: Without dead ends: 83896 [2025-02-05 11:48:07,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:48:07,026 INFO L435 NwaCegarLoop]: 1827 mSDtfsCounter, 746 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2589 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 2589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:48:07,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 1967 Invalid, 2892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 2589 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 11:48:07,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83896 states. [2025-02-05 11:48:07,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83896 to 80709. [2025-02-05 11:48:07,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80709 states, 80708 states have (on average 1.1048347127917926) internal successors, (89169), 80708 states have internal predecessors, (89169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80709 states to 80709 states and 89169 transitions. [2025-02-05 11:48:07,993 INFO L78 Accepts]: Start accepts. Automaton has 80709 states and 89169 transitions. Word has length 324 [2025-02-05 11:48:07,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:48:07,994 INFO L471 AbstractCegarLoop]: Abstraction has 80709 states and 89169 transitions. [2025-02-05 11:48:07,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:07,994 INFO L276 IsEmpty]: Start isEmpty. Operand 80709 states and 89169 transitions. [2025-02-05 11:48:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-02-05 11:48:07,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:48:07,997 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:48:07,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:48:07,997 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:48:07,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:48:07,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1688554707, now seen corresponding path program 1 times [2025-02-05 11:48:07,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:48:07,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847921005] [2025-02-05 11:48:07,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:48:07,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:48:08,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-02-05 11:48:08,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-02-05 11:48:08,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:48:08,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:48:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 221 proven. 110 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 11:48:08,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:48:08,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847921005] [2025-02-05 11:48:08,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847921005] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:48:08,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818314244] [2025-02-05 11:48:08,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:48:08,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:48:08,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:48:08,839 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:48:08,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:48:08,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-02-05 11:48:08,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-02-05 11:48:08,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:48:08,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:48:08,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:48:08,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:48:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-02-05 11:48:09,133 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:48:09,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818314244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:48:09,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:48:09,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:48:09,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790180585] [2025-02-05 11:48:09,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:48:09,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:48:09,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:48:09,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:48:09,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:48:09,136 INFO L87 Difference]: Start difference. First operand 80709 states and 89169 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:12,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:48:12,075 INFO L93 Difference]: Finished difference Result 160627 states and 177543 transitions. [2025-02-05 11:48:12,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:48:12,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 353 [2025-02-05 11:48:12,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:48:12,166 INFO L225 Difference]: With dead ends: 160627 [2025-02-05 11:48:12,166 INFO L226 Difference]: Without dead ends: 80707 [2025-02-05 11:48:12,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:48:12,214 INFO L435 NwaCegarLoop]: 1344 mSDtfsCounter, 1113 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:48:12,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1423 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:48:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80707 states. [2025-02-05 11:48:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80707 to 80706. [2025-02-05 11:48:13,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80706 states, 80705 states have (on average 1.0796357103029552) internal successors, (87132), 80705 states have internal predecessors, (87132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80706 states to 80706 states and 87132 transitions. [2025-02-05 11:48:13,247 INFO L78 Accepts]: Start accepts. Automaton has 80706 states and 87132 transitions. Word has length 353 [2025-02-05 11:48:13,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:48:13,248 INFO L471 AbstractCegarLoop]: Abstraction has 80706 states and 87132 transitions. [2025-02-05 11:48:13,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 80706 states and 87132 transitions. [2025-02-05 11:48:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-02-05 11:48:13,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:48:13,254 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:48:13,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 11:48:13,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 11:48:13,458 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:48:13,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:48:13,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2142689916, now seen corresponding path program 1 times [2025-02-05 11:48:13,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:48:13,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592732322] [2025-02-05 11:48:13,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:48:13,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:48:13,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-02-05 11:48:13,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-02-05 11:48:13,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:48:13,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:48:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-02-05 11:48:13,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:48:13,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592732322] [2025-02-05 11:48:13,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592732322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:48:13,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:48:13,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:48:13,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915266236] [2025-02-05 11:48:13,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:48:13,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:48:13,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:48:13,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:48:13,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:48:13,843 INFO L87 Difference]: Start difference. First operand 80706 states and 87132 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:48:18,203 INFO L93 Difference]: Finished difference Result 186601 states and 203330 transitions. [2025-02-05 11:48:18,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:48:18,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 383 [2025-02-05 11:48:18,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:48:18,355 INFO L225 Difference]: With dead ends: 186601 [2025-02-05 11:48:18,355 INFO L226 Difference]: Without dead ends: 106684 [2025-02-05 11:48:18,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:48:18,413 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 874 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 3338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:48:18,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 905 Invalid, 3338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-02-05 11:48:18,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106684 states. [2025-02-05 11:48:19,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106684 to 105091. [2025-02-05 11:48:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105091 states, 105090 states have (on average 1.085364925302122) internal successors, (114061), 105090 states have internal predecessors, (114061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:19,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105091 states to 105091 states and 114061 transitions. [2025-02-05 11:48:19,934 INFO L78 Accepts]: Start accepts. Automaton has 105091 states and 114061 transitions. Word has length 383 [2025-02-05 11:48:19,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:48:19,935 INFO L471 AbstractCegarLoop]: Abstraction has 105091 states and 114061 transitions. [2025-02-05 11:48:19,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:19,936 INFO L276 IsEmpty]: Start isEmpty. Operand 105091 states and 114061 transitions. [2025-02-05 11:48:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-02-05 11:48:19,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:48:19,943 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:48:19,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:48:19,943 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:48:19,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:48:19,944 INFO L85 PathProgramCache]: Analyzing trace with hash 16646474, now seen corresponding path program 1 times [2025-02-05 11:48:19,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:48:19,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568430554] [2025-02-05 11:48:19,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:48:19,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:48:19,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-02-05 11:48:20,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-02-05 11:48:20,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:48:20,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:48:20,264 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-02-05 11:48:20,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:48:20,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568430554] [2025-02-05 11:48:20,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568430554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:48:20,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:48:20,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:48:20,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418686434] [2025-02-05 11:48:20,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:48:20,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:48:20,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:48:20,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:48:20,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:48:20,266 INFO L87 Difference]: Start difference. First operand 105091 states and 114061 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:48:24,268 INFO L93 Difference]: Finished difference Result 235379 states and 257182 transitions. [2025-02-05 11:48:24,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:48:24,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 421 [2025-02-05 11:48:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:48:24,410 INFO L225 Difference]: With dead ends: 235379 [2025-02-05 11:48:24,410 INFO L226 Difference]: Without dead ends: 131077 [2025-02-05 11:48:24,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:48:24,441 INFO L435 NwaCegarLoop]: 1740 mSDtfsCounter, 787 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 3232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:48:24,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1882 Invalid, 3232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 11:48:24,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131077 states. [2025-02-05 11:48:25,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131077 to 128700. [2025-02-05 11:48:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128700 states, 128699 states have (on average 1.075385201128214) internal successors, (138401), 128699 states have internal predecessors, (138401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128700 states to 128700 states and 138401 transitions. [2025-02-05 11:48:25,792 INFO L78 Accepts]: Start accepts. Automaton has 128700 states and 138401 transitions. Word has length 421 [2025-02-05 11:48:25,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:48:25,793 INFO L471 AbstractCegarLoop]: Abstraction has 128700 states and 138401 transitions. [2025-02-05 11:48:25,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 128700 states and 138401 transitions. [2025-02-05 11:48:25,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-05 11:48:25,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:48:25,802 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:48:25,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:48:25,802 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:48:25,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:48:25,803 INFO L85 PathProgramCache]: Analyzing trace with hash 36391920, now seen corresponding path program 1 times [2025-02-05 11:48:25,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:48:25,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593350642] [2025-02-05 11:48:25,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:48:25,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:48:25,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 11:48:25,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 11:48:25,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:48:25,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:48:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 287 proven. 113 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 11:48:26,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:48:26,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593350642] [2025-02-05 11:48:26,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593350642] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:48:26,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765385296] [2025-02-05 11:48:26,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:48:26,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:48:26,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:48:26,986 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:48:26,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 11:48:27,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 11:48:27,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 11:48:27,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:48:27,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:48:27,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:48:27,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:48:27,314 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-05 11:48:27,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:48:27,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765385296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:48:27,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:48:27,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-02-05 11:48:27,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936337004] [2025-02-05 11:48:27,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:48:27,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:48:27,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:48:27,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:48:27,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:48:27,318 INFO L87 Difference]: Start difference. First operand 128700 states and 138401 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:30,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:48:30,592 INFO L93 Difference]: Finished difference Result 250284 states and 270181 transitions. [2025-02-05 11:48:30,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:48:30,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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 457 [2025-02-05 11:48:30,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:48:30,764 INFO L225 Difference]: With dead ends: 250284 [2025-02-05 11:48:30,765 INFO L226 Difference]: Without dead ends: 138119 [2025-02-05 11:48:30,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:48:30,832 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 1129 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 793 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 793 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:48:30,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 367 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [793 Valid, 2255 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:48:30,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138119 states. [2025-02-05 11:48:32,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138119 to 138119. [2025-02-05 11:48:32,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138119 states, 138118 states have (on average 1.0708669398630157) internal successors, (147906), 138118 states have internal predecessors, (147906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138119 states to 138119 states and 147906 transitions. [2025-02-05 11:48:32,209 INFO L78 Accepts]: Start accepts. Automaton has 138119 states and 147906 transitions. Word has length 457 [2025-02-05 11:48:32,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:48:32,210 INFO L471 AbstractCegarLoop]: Abstraction has 138119 states and 147906 transitions. [2025-02-05 11:48:32,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 138119 states and 147906 transitions. [2025-02-05 11:48:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-02-05 11:48:32,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:48:32,217 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:48:32,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 11:48:32,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:48:32,419 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:48:32,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:48:32,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2076789467, now seen corresponding path program 1 times [2025-02-05 11:48:32,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:48:32,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511193504] [2025-02-05 11:48:32,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:48:32,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:48:32,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-02-05 11:48:32,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-02-05 11:48:32,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:48:32,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:48:33,926 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 287 proven. 113 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 11:48:33,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:48:33,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511193504] [2025-02-05 11:48:33,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511193504] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:48:33,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785709316] [2025-02-05 11:48:33,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:48:33,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:48:33,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:48:33,934 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:48:33,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 11:48:33,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-02-05 11:48:34,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-02-05 11:48:34,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:48:34,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:48:34,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:48:34,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:48:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-02-05 11:48:34,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:48:34,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785709316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:48:34,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:48:34,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2025-02-05 11:48:34,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141610391] [2025-02-05 11:48:34,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:48:34,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:48:34,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:48:34,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:48:34,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:48:34,548 INFO L87 Difference]: Start difference. First operand 138119 states and 147906 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:37,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:48:37,404 INFO L93 Difference]: Finished difference Result 265226 states and 284390 transitions. [2025-02-05 11:48:37,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:48:37,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 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 473 [2025-02-05 11:48:37,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:48:37,583 INFO L225 Difference]: With dead ends: 265226 [2025-02-05 11:48:37,584 INFO L226 Difference]: Without dead ends: 142065 [2025-02-05 11:48:37,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:48:37,660 INFO L435 NwaCegarLoop]: 990 mSDtfsCounter, 680 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2429 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:48:37,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1119 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2429 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:48:37,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142065 states. [2025-02-05 11:48:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142065 to 140481. [2025-02-05 11:48:39,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140481 states, 140480 states have (on average 1.0639521640091116) internal successors, (149464), 140480 states have internal predecessors, (149464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140481 states to 140481 states and 149464 transitions. [2025-02-05 11:48:39,999 INFO L78 Accepts]: Start accepts. Automaton has 140481 states and 149464 transitions. Word has length 473 [2025-02-05 11:48:40,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:48:40,003 INFO L471 AbstractCegarLoop]: Abstraction has 140481 states and 149464 transitions. [2025-02-05 11:48:40,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:40,003 INFO L276 IsEmpty]: Start isEmpty. Operand 140481 states and 149464 transitions. [2025-02-05 11:48:40,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-02-05 11:48:40,013 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:48:40,014 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:48:40,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 11:48:40,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:48:40,222 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:48:40,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:48:40,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1554357976, now seen corresponding path program 1 times [2025-02-05 11:48:40,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:48:40,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789605462] [2025-02-05 11:48:40,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:48:40,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:48:40,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-02-05 11:48:40,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-02-05 11:48:40,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:48:40,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:48:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 791 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2025-02-05 11:48:40,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:48:40,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789605462] [2025-02-05 11:48:40,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789605462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:48:40,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:48:40,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:48:40,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655074513] [2025-02-05 11:48:40,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:48:40,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:48:40,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:48:40,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:48:40,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:48:40,381 INFO L87 Difference]: Start difference. First operand 140481 states and 149464 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:43,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:48:43,679 INFO L93 Difference]: Finished difference Result 277800 states and 295652 transitions. [2025-02-05 11:48:43,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:48:43,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 492 [2025-02-05 11:48:43,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:48:43,832 INFO L225 Difference]: With dead ends: 277800 [2025-02-05 11:48:43,832 INFO L226 Difference]: Without dead ends: 138108 [2025-02-05 11:48:43,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:48:43,908 INFO L435 NwaCegarLoop]: 1321 mSDtfsCounter, 917 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 2926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:48:43,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 1395 Invalid, 2926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 2359 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:48:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138108 states. [2025-02-05 11:48:45,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138108 to 138095. [2025-02-05 11:48:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138095 states, 138094 states have (on average 1.0480904311555896) internal successors, (144735), 138094 states have internal predecessors, (144735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138095 states to 138095 states and 144735 transitions. [2025-02-05 11:48:45,519 INFO L78 Accepts]: Start accepts. Automaton has 138095 states and 144735 transitions. Word has length 492 [2025-02-05 11:48:45,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:48:45,519 INFO L471 AbstractCegarLoop]: Abstraction has 138095 states and 144735 transitions. [2025-02-05 11:48:45,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:48:45,520 INFO L276 IsEmpty]: Start isEmpty. Operand 138095 states and 144735 transitions. [2025-02-05 11:48:45,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-02-05 11:48:45,526 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:48:45,526 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-02-05 11:48:45,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 11:48:45,526 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:48:45,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:48:45,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1923657414, now seen corresponding path program 1 times [2025-02-05 11:48:45,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:48:45,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785077589] [2025-02-05 11:48:45,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:48:45,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:48:45,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-02-05 11:48:45,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-02-05 11:48:45,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:48:45,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:48:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 649 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-02-05 11:48:45,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:48:45,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785077589] [2025-02-05 11:48:45,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785077589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:48:45,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:48:45,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:48:45,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949386431] [2025-02-05 11:48:45,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:48:45,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:48:45,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:48:45,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:48:45,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:48:45,701 INFO L87 Difference]: Start difference. First operand 138095 states and 144735 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)